/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/product-lines/elevator_spec1_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 08:25:58,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 08:25:58,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 08:25:58,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 08:25:58,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 08:25:58,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 08:25:58,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 08:25:58,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 08:25:58,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 08:25:58,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 08:25:58,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 08:25:58,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 08:25:58,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 08:25:58,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 08:25:58,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 08:25:58,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 08:25:58,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 08:25:58,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 08:25:58,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 08:25:58,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 08:25:58,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 08:25:58,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 08:25:58,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 08:25:58,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 08:25:58,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 08:25:58,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 08:25:58,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 08:25:58,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 08:25:58,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 08:25:58,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 08:25:58,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 08:25:58,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 08:25:58,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 08:25:58,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 08:25:58,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 08:25:58,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 08:25:58,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 08:25:58,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 08:25:58,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 08:25:58,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 08:25:58,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 08:25:58,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 08:25:58,313 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 08:25:58,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 08:25:58,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 08:25:58,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 08:25:58,319 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 08:25:58,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 08:25:58,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 08:25:58,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 08:25:58,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 08:25:58,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 08:25:58,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 08:25:58,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 08:25:58,323 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 08:25:58,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 08:25:58,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 08:25:58,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 08:25:58,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 08:25:58,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 08:25:58,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 08:25:58,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 08:25:58,325 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 08:25:58,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 08:25:58,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 08:25:58,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 08:25:58,326 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 08:25:58,326 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 08:25:58,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 08:25:58,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 08:25:58,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 08:25:58,809 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 08:25:58,810 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 08:25:58,811 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec1_product31.cil.c [2020-12-23 08:25:58,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9a089f8bf/2eb932940b5d4a469d328ddf86107f6f/FLAG7fe139a8d [2020-12-23 08:25:59,705 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 08:25:59,706 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec1_product31.cil.c [2020-12-23 08:25:59,734 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9a089f8bf/2eb932940b5d4a469d328ddf86107f6f/FLAG7fe139a8d [2020-12-23 08:25:59,886 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9a089f8bf/2eb932940b5d4a469d328ddf86107f6f [2020-12-23 08:25:59,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 08:25:59,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 08:25:59,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 08:25:59,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 08:25:59,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 08:25:59,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 08:25:59" (1/1) ... [2020-12-23 08:25:59,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@155e52c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:25:59, skipping insertion in model container [2020-12-23 08:25:59,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 08:25:59" (1/1) ... [2020-12-23 08:25:59,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 08:25:59,981 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~excep~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~cf~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_15~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_16~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~1,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~1,] left hand side expression in assignment: lhs: VariableLHS[~excep~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~2,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~new~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_18~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~2,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_20~0,] left hand side expression in assignment: lhs: VariableLHS[~next~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_21~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~3,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~count,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_22~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mem_23~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_24~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~4,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] [2020-12-23 08:26:00,258 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec1_product31.cil.c[10908,10921] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~weight~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~weight~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~5,] left hand side expression in assignment: lhs: VariableLHS[~overload~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~buttonPressed~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~2,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~7,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp18~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp19~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp20~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp24~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp25~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp26~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~floor~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~3,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~5,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~5,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nd~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~maxLength~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~counter~0,] left hand side expression in assignment: lhs: VariableLHS[~counter~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~action~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~origin~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__utac__ad__arg1~0,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~29,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~30,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~31,] [2020-12-23 08:26:00,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 08:26:00,670 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~excep~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~cf~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_15~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_16~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~1,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~1,] left hand side expression in assignment: lhs: VariableLHS[~excep~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~2,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~new~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_18~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~2,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_20~0,] left hand side expression in assignment: lhs: VariableLHS[~next~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_21~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~3,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~count,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_22~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mem_23~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_24~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~4,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] [2020-12-23 08:26:00,712 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec1_product31.cil.c[10908,10921] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~weight~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~weight~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~5,] left hand side expression in assignment: lhs: VariableLHS[~overload~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~buttonPressed~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~2,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~7,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp18~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp19~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp20~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp24~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp25~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp26~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~floor~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~3,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~5,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~5,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nd~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~maxLength~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~counter~0,] left hand side expression in assignment: lhs: VariableLHS[~counter~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~action~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~origin~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__utac__ad__arg1~0,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~29,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~30,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~31,] [2020-12-23 08:26:00,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 08:26:00,914 INFO L208 MainTranslator]: Completed translation [2020-12-23 08:26:00,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:26:00 WrapperNode [2020-12-23 08:26:00,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 08:26:00,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 08:26:00,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 08:26:00,918 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 08:26:00,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:26:00" (1/1) ... [2020-12-23 08:26:01,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:26:00" (1/1) ... [2020-12-23 08:26:01,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 08:26:01,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 08:26:01,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 08:26:01,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 08:26:01,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:26:00" (1/1) ... [2020-12-23 08:26:01,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:26:00" (1/1) ... [2020-12-23 08:26:01,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:26:00" (1/1) ... [2020-12-23 08:26:01,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:26:00" (1/1) ... [2020-12-23 08:26:01,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:26:00" (1/1) ... [2020-12-23 08:26:01,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:26:00" (1/1) ... [2020-12-23 08:26:01,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:26:00" (1/1) ... [2020-12-23 08:26:01,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 08:26:01,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 08:26:01,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 08:26:01,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 08:26:01,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:26:00" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 08:26:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 08:26:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 08:26:01,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 08:26:01,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 08:26:08,961 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 08:26:08,961 INFO L299 CfgBuilder]: Removed 881 assume(true) statements. [2020-12-23 08:26:08,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 08:26:08 BoogieIcfgContainer [2020-12-23 08:26:08,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 08:26:08,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 08:26:08,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 08:26:08,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 08:26:08,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 08:25:59" (1/3) ... [2020-12-23 08:26:08,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4dd4e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 08:26:08, skipping insertion in model container [2020-12-23 08:26:08,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:26:00" (2/3) ... [2020-12-23 08:26:08,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4dd4e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 08:26:08, skipping insertion in model container [2020-12-23 08:26:08,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 08:26:08" (3/3) ... [2020-12-23 08:26:08,979 INFO L111 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product31.cil.c [2020-12-23 08:26:08,986 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 08:26:08,994 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-12-23 08:26:09,015 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-23 08:26:09,058 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 08:26:09,058 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 08:26:09,058 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 08:26:09,058 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 08:26:09,059 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 08:26:09,059 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 08:26:09,059 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 08:26:09,059 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 08:26:09,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3675 states. [2020-12-23 08:26:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-23 08:26:09,157 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:09,159 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:09,159 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:09,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:09,172 INFO L82 PathProgramCache]: Analyzing trace with hash -183688650, now seen corresponding path program 1 times [2020-12-23 08:26:09,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:09,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273514397] [2020-12-23 08:26:09,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:09,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:09,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273514397] [2020-12-23 08:26:09,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:09,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:26:09,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449443137] [2020-12-23 08:26:09,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:26:09,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:09,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:26:09,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:26:09,720 INFO L87 Difference]: Start difference. First operand 3675 states. Second operand 3 states. [2020-12-23 08:26:10,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:10,135 INFO L93 Difference]: Finished difference Result 10945 states and 20597 transitions. [2020-12-23 08:26:10,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:26:10,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-12-23 08:26:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:10,265 INFO L225 Difference]: With dead ends: 10945 [2020-12-23 08:26:10,265 INFO L226 Difference]: Without dead ends: 7275 [2020-12-23 08:26:10,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:26:10,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7275 states. [2020-12-23 08:26:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7275 to 3671. [2020-12-23 08:26:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3671 states. [2020-12-23 08:26:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 6896 transitions. [2020-12-23 08:26:10,533 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 6896 transitions. Word has length 53 [2020-12-23 08:26:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:10,533 INFO L481 AbstractCegarLoop]: Abstraction has 3671 states and 6896 transitions. [2020-12-23 08:26:10,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:26:10,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 6896 transitions. [2020-12-23 08:26:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-23 08:26:10,539 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:10,540 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:10,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 08:26:10,540 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:10,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:10,541 INFO L82 PathProgramCache]: Analyzing trace with hash -63832707, now seen corresponding path program 1 times [2020-12-23 08:26:10,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:10,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823514938] [2020-12-23 08:26:10,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:10,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823514938] [2020-12-23 08:26:10,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:10,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:26:10,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144026583] [2020-12-23 08:26:10,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:26:10,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:10,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:26:10,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:26:10,684 INFO L87 Difference]: Start difference. First operand 3671 states and 6896 transitions. Second operand 4 states. [2020-12-23 08:26:11,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:11,291 INFO L93 Difference]: Finished difference Result 14438 states and 27139 transitions. [2020-12-23 08:26:11,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:26:11,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-12-23 08:26:11,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:11,354 INFO L225 Difference]: With dead ends: 14438 [2020-12-23 08:26:11,354 INFO L226 Difference]: Without dead ends: 10789 [2020-12-23 08:26:11,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:26:11,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10789 states. [2020-12-23 08:26:11,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10789 to 3647. [2020-12-23 08:26:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3647 states. [2020-12-23 08:26:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3647 states and 6843 transitions. [2020-12-23 08:26:11,571 INFO L78 Accepts]: Start accepts. Automaton has 3647 states and 6843 transitions. Word has length 60 [2020-12-23 08:26:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:11,572 INFO L481 AbstractCegarLoop]: Abstraction has 3647 states and 6843 transitions. [2020-12-23 08:26:11,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:26:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3647 states and 6843 transitions. [2020-12-23 08:26:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 08:26:11,577 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:11,577 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:11,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 08:26:11,578 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:11,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:11,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1713448475, now seen corresponding path program 1 times [2020-12-23 08:26:11,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:11,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961697776] [2020-12-23 08:26:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:11,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961697776] [2020-12-23 08:26:11,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:11,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:26:11,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413057728] [2020-12-23 08:26:11,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:26:11,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:11,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:26:11,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:26:11,755 INFO L87 Difference]: Start difference. First operand 3647 states and 6843 transitions. Second operand 4 states. [2020-12-23 08:26:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:12,207 INFO L93 Difference]: Finished difference Result 10849 states and 20380 transitions. [2020-12-23 08:26:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:26:12,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-23 08:26:12,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:12,245 INFO L225 Difference]: With dead ends: 10849 [2020-12-23 08:26:12,246 INFO L226 Difference]: Without dead ends: 7224 [2020-12-23 08:26:12,255 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:26:12,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2020-12-23 08:26:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 3647. [2020-12-23 08:26:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3647 states. [2020-12-23 08:26:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3647 states and 6837 transitions. [2020-12-23 08:26:12,526 INFO L78 Accepts]: Start accepts. Automaton has 3647 states and 6837 transitions. Word has length 61 [2020-12-23 08:26:12,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:12,528 INFO L481 AbstractCegarLoop]: Abstraction has 3647 states and 6837 transitions. [2020-12-23 08:26:12,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:26:12,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3647 states and 6837 transitions. [2020-12-23 08:26:12,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-23 08:26:12,533 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:12,533 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:12,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 08:26:12,533 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:12,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:12,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1064213782, now seen corresponding path program 1 times [2020-12-23 08:26:12,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:12,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779855616] [2020-12-23 08:26:12,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:12,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779855616] [2020-12-23 08:26:12,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:12,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:26:12,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042846211] [2020-12-23 08:26:12,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:26:12,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:12,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:26:12,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:26:12,630 INFO L87 Difference]: Start difference. First operand 3647 states and 6837 transitions. Second operand 4 states. [2020-12-23 08:26:13,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:13,133 INFO L93 Difference]: Finished difference Result 10849 states and 20368 transitions. [2020-12-23 08:26:13,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:26:13,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-12-23 08:26:13,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:13,158 INFO L225 Difference]: With dead ends: 10849 [2020-12-23 08:26:13,158 INFO L226 Difference]: Without dead ends: 7224 [2020-12-23 08:26:13,171 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:26:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2020-12-23 08:26:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 3647. [2020-12-23 08:26:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3647 states. [2020-12-23 08:26:13,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3647 states and 6831 transitions. [2020-12-23 08:26:13,406 INFO L78 Accepts]: Start accepts. Automaton has 3647 states and 6831 transitions. Word has length 63 [2020-12-23 08:26:13,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:13,408 INFO L481 AbstractCegarLoop]: Abstraction has 3647 states and 6831 transitions. [2020-12-23 08:26:13,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:26:13,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3647 states and 6831 transitions. [2020-12-23 08:26:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-23 08:26:13,413 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:13,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:13,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 08:26:13,414 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:13,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:13,415 INFO L82 PathProgramCache]: Analyzing trace with hash -472275451, now seen corresponding path program 1 times [2020-12-23 08:26:13,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:13,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991724283] [2020-12-23 08:26:13,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:13,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991724283] [2020-12-23 08:26:13,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:13,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:26:13,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712780304] [2020-12-23 08:26:13,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:26:13,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:13,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:26:13,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:26:13,545 INFO L87 Difference]: Start difference. First operand 3647 states and 6831 transitions. Second operand 4 states. [2020-12-23 08:26:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:14,418 INFO L93 Difference]: Finished difference Result 17985 states and 33770 transitions. [2020-12-23 08:26:14,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:26:14,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-12-23 08:26:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:14,459 INFO L225 Difference]: With dead ends: 17985 [2020-12-23 08:26:14,459 INFO L226 Difference]: Without dead ends: 14360 [2020-12-23 08:26:14,470 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:26:14,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14360 states. [2020-12-23 08:26:14,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14360 to 3647. [2020-12-23 08:26:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3647 states. [2020-12-23 08:26:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3647 states and 6830 transitions. [2020-12-23 08:26:14,693 INFO L78 Accepts]: Start accepts. Automaton has 3647 states and 6830 transitions. Word has length 65 [2020-12-23 08:26:14,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:14,694 INFO L481 AbstractCegarLoop]: Abstraction has 3647 states and 6830 transitions. [2020-12-23 08:26:14,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:26:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3647 states and 6830 transitions. [2020-12-23 08:26:14,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 08:26:14,698 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:14,698 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:14,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 08:26:14,699 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:14,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:14,699 INFO L82 PathProgramCache]: Analyzing trace with hash 407840554, now seen corresponding path program 1 times [2020-12-23 08:26:14,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:14,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651183931] [2020-12-23 08:26:14,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:14,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651183931] [2020-12-23 08:26:14,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:14,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:26:14,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839037055] [2020-12-23 08:26:14,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:26:14,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:14,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:26:14,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:26:14,769 INFO L87 Difference]: Start difference. First operand 3647 states and 6830 transitions. Second operand 4 states. [2020-12-23 08:26:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:15,216 INFO L93 Difference]: Finished difference Result 10849 states and 20355 transitions. [2020-12-23 08:26:15,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:26:15,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-12-23 08:26:15,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:15,240 INFO L225 Difference]: With dead ends: 10849 [2020-12-23 08:26:15,240 INFO L226 Difference]: Without dead ends: 7224 [2020-12-23 08:26:15,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:26:15,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2020-12-23 08:26:15,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 3647. [2020-12-23 08:26:15,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3647 states. [2020-12-23 08:26:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3647 states and 6824 transitions. [2020-12-23 08:26:15,437 INFO L78 Accepts]: Start accepts. Automaton has 3647 states and 6824 transitions. Word has length 66 [2020-12-23 08:26:15,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:15,438 INFO L481 AbstractCegarLoop]: Abstraction has 3647 states and 6824 transitions. [2020-12-23 08:26:15,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:26:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3647 states and 6824 transitions. [2020-12-23 08:26:15,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-23 08:26:15,443 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:15,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:15,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 08:26:15,444 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:15,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:15,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1108571670, now seen corresponding path program 1 times [2020-12-23 08:26:15,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:15,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533703485] [2020-12-23 08:26:15,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:15,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533703485] [2020-12-23 08:26:15,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:15,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:26:15,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759183016] [2020-12-23 08:26:15,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:26:15,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:15,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:26:15,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:26:15,583 INFO L87 Difference]: Start difference. First operand 3647 states and 6824 transitions. Second operand 4 states. [2020-12-23 08:26:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:16,078 INFO L93 Difference]: Finished difference Result 10849 states and 20343 transitions. [2020-12-23 08:26:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:26:16,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2020-12-23 08:26:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:16,102 INFO L225 Difference]: With dead ends: 10849 [2020-12-23 08:26:16,102 INFO L226 Difference]: Without dead ends: 7224 [2020-12-23 08:26:16,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:26:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2020-12-23 08:26:16,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 3647. [2020-12-23 08:26:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3647 states. [2020-12-23 08:26:16,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3647 states and 6818 transitions. [2020-12-23 08:26:16,355 INFO L78 Accepts]: Start accepts. Automaton has 3647 states and 6818 transitions. Word has length 67 [2020-12-23 08:26:16,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:16,356 INFO L481 AbstractCegarLoop]: Abstraction has 3647 states and 6818 transitions. [2020-12-23 08:26:16,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:26:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3647 states and 6818 transitions. [2020-12-23 08:26:16,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-23 08:26:16,360 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:16,360 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:16,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 08:26:16,360 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:16,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:16,361 INFO L82 PathProgramCache]: Analyzing trace with hash 392052335, now seen corresponding path program 1 times [2020-12-23 08:26:16,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:16,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956901758] [2020-12-23 08:26:16,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:16,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956901758] [2020-12-23 08:26:16,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:16,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:26:16,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171377351] [2020-12-23 08:26:16,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:26:16,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:16,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:26:16,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:26:16,461 INFO L87 Difference]: Start difference. First operand 3647 states and 6818 transitions. Second operand 4 states. [2020-12-23 08:26:17,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:17,039 INFO L93 Difference]: Finished difference Result 14396 states and 27005 transitions. [2020-12-23 08:26:17,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:26:17,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2020-12-23 08:26:17,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:17,077 INFO L225 Difference]: With dead ends: 14396 [2020-12-23 08:26:17,078 INFO L226 Difference]: Without dead ends: 10777 [2020-12-23 08:26:17,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:26:17,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10777 states. [2020-12-23 08:26:17,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10777 to 3649. [2020-12-23 08:26:17,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2020-12-23 08:26:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 6819 transitions. [2020-12-23 08:26:17,306 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 6819 transitions. Word has length 68 [2020-12-23 08:26:17,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:17,306 INFO L481 AbstractCegarLoop]: Abstraction has 3649 states and 6819 transitions. [2020-12-23 08:26:17,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:26:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 6819 transitions. [2020-12-23 08:26:17,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-23 08:26:17,317 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:17,317 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:17,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 08:26:17,317 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:17,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:17,318 INFO L82 PathProgramCache]: Analyzing trace with hash -488204641, now seen corresponding path program 1 times [2020-12-23 08:26:17,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:17,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886732309] [2020-12-23 08:26:17,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:17,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886732309] [2020-12-23 08:26:17,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:17,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:26:17,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059494573] [2020-12-23 08:26:17,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:26:17,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:17,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:26:17,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:26:17,410 INFO L87 Difference]: Start difference. First operand 3649 states and 6819 transitions. Second operand 4 states. [2020-12-23 08:26:18,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:18,016 INFO L93 Difference]: Finished difference Result 14388 states and 26985 transitions. [2020-12-23 08:26:18,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:26:18,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-12-23 08:26:18,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:18,049 INFO L225 Difference]: With dead ends: 14388 [2020-12-23 08:26:18,049 INFO L226 Difference]: Without dead ends: 10772 [2020-12-23 08:26:18,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:26:18,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10772 states. [2020-12-23 08:26:18,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10772 to 3654. [2020-12-23 08:26:18,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3654 states. [2020-12-23 08:26:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 6827 transitions. [2020-12-23 08:26:18,324 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 6827 transitions. Word has length 69 [2020-12-23 08:26:18,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:18,328 INFO L481 AbstractCegarLoop]: Abstraction has 3654 states and 6827 transitions. [2020-12-23 08:26:18,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:26:18,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 6827 transitions. [2020-12-23 08:26:18,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-23 08:26:18,334 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:18,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:18,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 08:26:18,334 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:18,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:18,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1663726628, now seen corresponding path program 1 times [2020-12-23 08:26:18,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:18,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109890524] [2020-12-23 08:26:18,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:18,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109890524] [2020-12-23 08:26:18,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:18,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:26:18,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025825954] [2020-12-23 08:26:18,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:26:18,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:18,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:26:18,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:26:18,395 INFO L87 Difference]: Start difference. First operand 3654 states and 6827 transitions. Second operand 3 states. [2020-12-23 08:26:18,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:18,568 INFO L93 Difference]: Finished difference Result 7265 states and 13596 transitions. [2020-12-23 08:26:18,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:26:18,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2020-12-23 08:26:18,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:18,581 INFO L225 Difference]: With dead ends: 7265 [2020-12-23 08:26:18,581 INFO L226 Difference]: Without dead ends: 3648 [2020-12-23 08:26:18,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:26:18,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2020-12-23 08:26:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 3648. [2020-12-23 08:26:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3648 states. [2020-12-23 08:26:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 6815 transitions. [2020-12-23 08:26:18,743 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 6815 transitions. Word has length 70 [2020-12-23 08:26:18,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:18,743 INFO L481 AbstractCegarLoop]: Abstraction has 3648 states and 6815 transitions. [2020-12-23 08:26:18,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:26:18,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 6815 transitions. [2020-12-23 08:26:18,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 08:26:18,747 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:18,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:18,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 08:26:18,747 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:18,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:18,748 INFO L82 PathProgramCache]: Analyzing trace with hash -650743265, now seen corresponding path program 1 times [2020-12-23 08:26:18,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:18,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117238448] [2020-12-23 08:26:18,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:18,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:18,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117238448] [2020-12-23 08:26:18,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:18,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:26:18,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615120065] [2020-12-23 08:26:18,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:26:18,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:18,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:26:18,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:26:18,846 INFO L87 Difference]: Start difference. First operand 3648 states and 6815 transitions. Second operand 5 states. [2020-12-23 08:26:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:19,126 INFO L93 Difference]: Finished difference Result 7209 states and 13509 transitions. [2020-12-23 08:26:19,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:26:19,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2020-12-23 08:26:19,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:19,139 INFO L225 Difference]: With dead ends: 7209 [2020-12-23 08:26:19,140 INFO L226 Difference]: Without dead ends: 3635 [2020-12-23 08:26:19,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 08:26:19,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3635 states. [2020-12-23 08:26:19,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3635 to 3635. [2020-12-23 08:26:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2020-12-23 08:26:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 6793 transitions. [2020-12-23 08:26:19,323 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 6793 transitions. Word has length 72 [2020-12-23 08:26:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:19,323 INFO L481 AbstractCegarLoop]: Abstraction has 3635 states and 6793 transitions. [2020-12-23 08:26:19,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:26:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 6793 transitions. [2020-12-23 08:26:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 08:26:19,327 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:19,327 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:19,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 08:26:19,328 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:19,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:19,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1408208117, now seen corresponding path program 1 times [2020-12-23 08:26:19,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:19,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193864124] [2020-12-23 08:26:19,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:19,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:19,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193864124] [2020-12-23 08:26:19,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:19,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:26:19,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594157077] [2020-12-23 08:26:19,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:26:19,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:19,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:26:19,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:26:19,428 INFO L87 Difference]: Start difference. First operand 3635 states and 6793 transitions. Second operand 5 states. [2020-12-23 08:26:19,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:19,733 INFO L93 Difference]: Finished difference Result 7203 states and 13498 transitions. [2020-12-23 08:26:19,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:26:19,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2020-12-23 08:26:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:19,746 INFO L225 Difference]: With dead ends: 7203 [2020-12-23 08:26:19,747 INFO L226 Difference]: Without dead ends: 3629 [2020-12-23 08:26:19,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 08:26:19,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2020-12-23 08:26:19,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 3629. [2020-12-23 08:26:19,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3629 states. [2020-12-23 08:26:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 6784 transitions. [2020-12-23 08:26:19,975 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 6784 transitions. Word has length 75 [2020-12-23 08:26:19,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:19,977 INFO L481 AbstractCegarLoop]: Abstraction has 3629 states and 6784 transitions. [2020-12-23 08:26:19,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:26:19,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 6784 transitions. [2020-12-23 08:26:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 08:26:19,981 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:19,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:19,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 08:26:19,982 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:19,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:19,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1665200245, now seen corresponding path program 1 times [2020-12-23 08:26:19,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:19,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168956215] [2020-12-23 08:26:19,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:20,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168956215] [2020-12-23 08:26:20,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:20,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:26:20,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626860927] [2020-12-23 08:26:20,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:26:20,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:20,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:26:20,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:26:20,072 INFO L87 Difference]: Start difference. First operand 3629 states and 6784 transitions. Second operand 4 states. [2020-12-23 08:26:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:20,306 INFO L93 Difference]: Finished difference Result 7197 states and 13489 transitions. [2020-12-23 08:26:20,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:26:20,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-23 08:26:20,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:20,320 INFO L225 Difference]: With dead ends: 7197 [2020-12-23 08:26:20,321 INFO L226 Difference]: Without dead ends: 3615 [2020-12-23 08:26:20,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:26:20,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2020-12-23 08:26:20,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 3615. [2020-12-23 08:26:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3615 states. [2020-12-23 08:26:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3615 states to 3615 states and 6763 transitions. [2020-12-23 08:26:20,564 INFO L78 Accepts]: Start accepts. Automaton has 3615 states and 6763 transitions. Word has length 75 [2020-12-23 08:26:20,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:20,565 INFO L481 AbstractCegarLoop]: Abstraction has 3615 states and 6763 transitions. [2020-12-23 08:26:20,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:26:20,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 6763 transitions. [2020-12-23 08:26:20,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 08:26:20,569 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:20,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:20,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 08:26:20,570 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:20,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:20,571 INFO L82 PathProgramCache]: Analyzing trace with hash 194041656, now seen corresponding path program 1 times [2020-12-23 08:26:20,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:20,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176546170] [2020-12-23 08:26:20,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:20,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176546170] [2020-12-23 08:26:20,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:20,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 08:26:20,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151813629] [2020-12-23 08:26:20,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:26:20,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:20,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:26:20,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:26:20,685 INFO L87 Difference]: Start difference. First operand 3615 states and 6763 transitions. Second operand 6 states. [2020-12-23 08:26:21,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:21,020 INFO L93 Difference]: Finished difference Result 7197 states and 13484 transitions. [2020-12-23 08:26:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:26:21,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2020-12-23 08:26:21,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:21,033 INFO L225 Difference]: With dead ends: 7197 [2020-12-23 08:26:21,033 INFO L226 Difference]: Without dead ends: 3635 [2020-12-23 08:26:21,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-23 08:26:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3635 states. [2020-12-23 08:26:21,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3635 to 3615. [2020-12-23 08:26:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3615 states. [2020-12-23 08:26:21,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3615 states to 3615 states and 6762 transitions. [2020-12-23 08:26:21,281 INFO L78 Accepts]: Start accepts. Automaton has 3615 states and 6762 transitions. Word has length 76 [2020-12-23 08:26:21,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:21,281 INFO L481 AbstractCegarLoop]: Abstraction has 3615 states and 6762 transitions. [2020-12-23 08:26:21,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:26:21,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 6762 transitions. [2020-12-23 08:26:21,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 08:26:21,286 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:21,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:21,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 08:26:21,287 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:21,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:21,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1134957956, now seen corresponding path program 1 times [2020-12-23 08:26:21,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:21,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006913543] [2020-12-23 08:26:21,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:21,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:21,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006913543] [2020-12-23 08:26:21,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:21,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 08:26:21,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144173284] [2020-12-23 08:26:21,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:26:21,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:21,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:26:21,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:26:21,387 INFO L87 Difference]: Start difference. First operand 3615 states and 6762 transitions. Second operand 6 states. [2020-12-23 08:26:21,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:21,645 INFO L93 Difference]: Finished difference Result 7187 states and 13465 transitions. [2020-12-23 08:26:21,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:26:21,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2020-12-23 08:26:21,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:21,655 INFO L225 Difference]: With dead ends: 7187 [2020-12-23 08:26:21,655 INFO L226 Difference]: Without dead ends: 3630 [2020-12-23 08:26:21,661 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-23 08:26:21,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3630 states. [2020-12-23 08:26:21,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3630 to 3615. [2020-12-23 08:26:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3615 states. [2020-12-23 08:26:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3615 states to 3615 states and 6761 transitions. [2020-12-23 08:26:21,838 INFO L78 Accepts]: Start accepts. Automaton has 3615 states and 6761 transitions. Word has length 77 [2020-12-23 08:26:21,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:21,838 INFO L481 AbstractCegarLoop]: Abstraction has 3615 states and 6761 transitions. [2020-12-23 08:26:21,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:26:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 6761 transitions. [2020-12-23 08:26:21,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 08:26:21,841 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:21,842 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:21,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 08:26:21,842 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:21,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:21,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1149977565, now seen corresponding path program 1 times [2020-12-23 08:26:21,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:21,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345143193] [2020-12-23 08:26:21,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:21,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345143193] [2020-12-23 08:26:21,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:21,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:26:21,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336373099] [2020-12-23 08:26:21,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:26:21,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:21,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:26:21,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:26:21,954 INFO L87 Difference]: Start difference. First operand 3615 states and 6761 transitions. Second operand 6 states. [2020-12-23 08:26:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:27,612 INFO L93 Difference]: Finished difference Result 24719 states and 46195 transitions. [2020-12-23 08:26:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 08:26:27,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2020-12-23 08:26:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:27,641 INFO L225 Difference]: With dead ends: 24719 [2020-12-23 08:26:27,641 INFO L226 Difference]: Without dead ends: 21195 [2020-12-23 08:26:27,651 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-23 08:26:27,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21195 states. [2020-12-23 08:26:28,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21195 to 3621. [2020-12-23 08:26:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3621 states. [2020-12-23 08:26:28,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 6767 transitions. [2020-12-23 08:26:28,089 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 6767 transitions. Word has length 78 [2020-12-23 08:26:28,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:28,090 INFO L481 AbstractCegarLoop]: Abstraction has 3621 states and 6767 transitions. [2020-12-23 08:26:28,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:26:28,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 6767 transitions. [2020-12-23 08:26:28,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-23 08:26:28,095 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:28,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:28,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 08:26:28,095 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:28,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:28,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1660069039, now seen corresponding path program 1 times [2020-12-23 08:26:28,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:28,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654591476] [2020-12-23 08:26:28,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:28,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654591476] [2020-12-23 08:26:28,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:28,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:26:28,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566728274] [2020-12-23 08:26:28,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:26:28,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:28,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:26:28,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:26:28,242 INFO L87 Difference]: Start difference. First operand 3621 states and 6767 transitions. Second operand 4 states. [2020-12-23 08:26:30,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:30,982 INFO L93 Difference]: Finished difference Result 9546 states and 17947 transitions. [2020-12-23 08:26:30,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:26:30,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-12-23 08:26:30,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:30,993 INFO L225 Difference]: With dead ends: 9546 [2020-12-23 08:26:30,993 INFO L226 Difference]: Without dead ends: 6018 [2020-12-23 08:26:30,999 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:26:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-12-23 08:26:31,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3621. [2020-12-23 08:26:31,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3621 states. [2020-12-23 08:26:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 6761 transitions. [2020-12-23 08:26:31,269 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 6761 transitions. Word has length 79 [2020-12-23 08:26:31,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:31,270 INFO L481 AbstractCegarLoop]: Abstraction has 3621 states and 6761 transitions. [2020-12-23 08:26:31,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:26:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 6761 transitions. [2020-12-23 08:26:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 08:26:31,276 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:31,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:31,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 08:26:31,276 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:31,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:31,277 INFO L82 PathProgramCache]: Analyzing trace with hash 479677129, now seen corresponding path program 1 times [2020-12-23 08:26:31,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:31,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309637943] [2020-12-23 08:26:31,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:31,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309637943] [2020-12-23 08:26:31,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:31,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:26:31,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057232730] [2020-12-23 08:26:31,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:26:31,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:31,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:26:31,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:26:31,413 INFO L87 Difference]: Start difference. First operand 3621 states and 6761 transitions. Second operand 4 states. [2020-12-23 08:26:34,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:34,363 INFO L93 Difference]: Finished difference Result 9572 states and 17982 transitions. [2020-12-23 08:26:34,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:26:34,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2020-12-23 08:26:34,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:34,375 INFO L225 Difference]: With dead ends: 9572 [2020-12-23 08:26:34,375 INFO L226 Difference]: Without dead ends: 6018 [2020-12-23 08:26:34,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:26:34,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-12-23 08:26:34,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3621. [2020-12-23 08:26:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3621 states. [2020-12-23 08:26:34,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 6755 transitions. [2020-12-23 08:26:34,678 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 6755 transitions. Word has length 80 [2020-12-23 08:26:34,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:34,678 INFO L481 AbstractCegarLoop]: Abstraction has 3621 states and 6755 transitions. [2020-12-23 08:26:34,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:26:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 6755 transitions. [2020-12-23 08:26:34,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-23 08:26:34,682 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:34,682 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:34,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 08:26:34,683 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:34,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:34,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1078636057, now seen corresponding path program 1 times [2020-12-23 08:26:34,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:34,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274866920] [2020-12-23 08:26:34,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:34,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274866920] [2020-12-23 08:26:34,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:34,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:26:34,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674126196] [2020-12-23 08:26:34,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:26:34,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:34,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:26:34,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:26:34,780 INFO L87 Difference]: Start difference. First operand 3621 states and 6755 transitions. Second operand 4 states. [2020-12-23 08:26:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:37,468 INFO L93 Difference]: Finished difference Result 9572 states and 17971 transitions. [2020-12-23 08:26:37,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:26:37,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2020-12-23 08:26:37,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:37,479 INFO L225 Difference]: With dead ends: 9572 [2020-12-23 08:26:37,479 INFO L226 Difference]: Without dead ends: 6018 [2020-12-23 08:26:37,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:26:37,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-12-23 08:26:37,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3621. [2020-12-23 08:26:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3621 states. [2020-12-23 08:26:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 6749 transitions. [2020-12-23 08:26:37,683 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 6749 transitions. Word has length 82 [2020-12-23 08:26:37,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:37,683 INFO L481 AbstractCegarLoop]: Abstraction has 3621 states and 6749 transitions. [2020-12-23 08:26:37,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:26:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 6749 transitions. [2020-12-23 08:26:37,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 08:26:37,688 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:37,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:37,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 08:26:37,688 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:37,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:37,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1747394921, now seen corresponding path program 1 times [2020-12-23 08:26:37,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:37,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006984040] [2020-12-23 08:26:37,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:37,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006984040] [2020-12-23 08:26:37,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:37,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:26:37,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857773025] [2020-12-23 08:26:37,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:26:37,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:37,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:26:37,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:26:37,776 INFO L87 Difference]: Start difference. First operand 3621 states and 6749 transitions. Second operand 6 states. [2020-12-23 08:26:47,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:47,450 INFO L93 Difference]: Finished difference Result 45890 states and 85651 transitions. [2020-12-23 08:26:47,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 08:26:47,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2020-12-23 08:26:47,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:47,525 INFO L225 Difference]: With dead ends: 45890 [2020-12-23 08:26:47,525 INFO L226 Difference]: Without dead ends: 42363 [2020-12-23 08:26:47,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2020-12-23 08:26:47,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42363 states. [2020-12-23 08:26:48,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42363 to 7194. [2020-12-23 08:26:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7194 states. [2020-12-23 08:26:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7194 states to 7194 states and 13442 transitions. [2020-12-23 08:26:48,494 INFO L78 Accepts]: Start accepts. Automaton has 7194 states and 13442 transitions. Word has length 84 [2020-12-23 08:26:48,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:48,495 INFO L481 AbstractCegarLoop]: Abstraction has 7194 states and 13442 transitions. [2020-12-23 08:26:48,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:26:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 7194 states and 13442 transitions. [2020-12-23 08:26:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 08:26:48,501 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:48,501 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:48,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 08:26:48,502 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:48,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:48,503 INFO L82 PathProgramCache]: Analyzing trace with hash -508944324, now seen corresponding path program 1 times [2020-12-23 08:26:48,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:48,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528613979] [2020-12-23 08:26:48,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:48,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528613979] [2020-12-23 08:26:48,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:48,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:26:48,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837748858] [2020-12-23 08:26:48,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:26:48,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:48,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:26:48,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:26:48,632 INFO L87 Difference]: Start difference. First operand 7194 states and 13442 transitions. Second operand 4 states. [2020-12-23 08:26:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:51,852 INFO L93 Difference]: Finished difference Result 19040 states and 35790 transitions. [2020-12-23 08:26:51,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:26:51,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2020-12-23 08:26:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:51,876 INFO L225 Difference]: With dead ends: 19040 [2020-12-23 08:26:51,876 INFO L226 Difference]: Without dead ends: 11973 [2020-12-23 08:26:51,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:26:51,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11973 states. [2020-12-23 08:26:52,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11973 to 3621. [2020-12-23 08:26:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3621 states. [2020-12-23 08:26:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 6743 transitions. [2020-12-23 08:26:52,176 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 6743 transitions. Word has length 85 [2020-12-23 08:26:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:52,176 INFO L481 AbstractCegarLoop]: Abstraction has 3621 states and 6743 transitions. [2020-12-23 08:26:52,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:26:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 6743 transitions. [2020-12-23 08:26:52,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-23 08:26:52,179 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:52,179 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:52,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 08:26:52,179 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:52,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:52,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1298731663, now seen corresponding path program 1 times [2020-12-23 08:26:52,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:52,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041263055] [2020-12-23 08:26:52,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:52,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:52,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041263055] [2020-12-23 08:26:52,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:52,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:26:52,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143355797] [2020-12-23 08:26:52,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:26:52,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:52,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:26:52,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:26:52,256 INFO L87 Difference]: Start difference. First operand 3621 states and 6743 transitions. Second operand 3 states. [2020-12-23 08:26:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:52,555 INFO L93 Difference]: Finished difference Result 5447 states and 10152 transitions. [2020-12-23 08:26:52,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:26:52,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-23 08:26:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:52,563 INFO L225 Difference]: With dead ends: 5447 [2020-12-23 08:26:52,563 INFO L226 Difference]: Without dead ends: 3615 [2020-12-23 08:26:52,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:26:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2020-12-23 08:26:52,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 3615. [2020-12-23 08:26:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3615 states. [2020-12-23 08:26:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3615 states to 3615 states and 6733 transitions. [2020-12-23 08:26:52,839 INFO L78 Accepts]: Start accepts. Automaton has 3615 states and 6733 transitions. Word has length 86 [2020-12-23 08:26:52,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:52,839 INFO L481 AbstractCegarLoop]: Abstraction has 3615 states and 6733 transitions. [2020-12-23 08:26:52,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:26:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 6733 transitions. [2020-12-23 08:26:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 08:26:52,843 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:52,843 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:52,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 08:26:52,843 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:52,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:52,844 INFO L82 PathProgramCache]: Analyzing trace with hash -726355396, now seen corresponding path program 1 times [2020-12-23 08:26:52,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:52,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166373032] [2020-12-23 08:26:52,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:52,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166373032] [2020-12-23 08:26:52,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:52,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:26:52,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16333536] [2020-12-23 08:26:52,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:26:52,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:52,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:26:52,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:26:52,926 INFO L87 Difference]: Start difference. First operand 3615 states and 6733 transitions. Second operand 5 states. [2020-12-23 08:26:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:54,347 INFO L93 Difference]: Finished difference Result 14410 states and 26853 transitions. [2020-12-23 08:26:54,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:26:54,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2020-12-23 08:26:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:54,369 INFO L225 Difference]: With dead ends: 14410 [2020-12-23 08:26:54,369 INFO L226 Difference]: Without dead ends: 12600 [2020-12-23 08:26:54,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 08:26:54,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12600 states. [2020-12-23 08:26:54,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12600 to 5390. [2020-12-23 08:26:54,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5390 states. [2020-12-23 08:26:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5390 states to 5390 states and 10034 transitions. [2020-12-23 08:26:54,787 INFO L78 Accepts]: Start accepts. Automaton has 5390 states and 10034 transitions. Word has length 88 [2020-12-23 08:26:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:54,788 INFO L481 AbstractCegarLoop]: Abstraction has 5390 states and 10034 transitions. [2020-12-23 08:26:54,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:26:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 5390 states and 10034 transitions. [2020-12-23 08:26:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 08:26:54,792 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:54,792 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:54,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 08:26:54,792 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:54,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:54,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1041663046, now seen corresponding path program 1 times [2020-12-23 08:26:54,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:54,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041659152] [2020-12-23 08:26:54,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:54,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041659152] [2020-12-23 08:26:54,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:54,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:26:54,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229970206] [2020-12-23 08:26:54,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:26:54,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:54,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:26:54,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:26:54,897 INFO L87 Difference]: Start difference. First operand 5390 states and 10034 transitions. Second operand 5 states. [2020-12-23 08:26:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:55,727 INFO L93 Difference]: Finished difference Result 8156 states and 15170 transitions. [2020-12-23 08:26:55,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:26:55,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2020-12-23 08:26:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:55,740 INFO L225 Difference]: With dead ends: 8156 [2020-12-23 08:26:55,740 INFO L226 Difference]: Without dead ends: 8143 [2020-12-23 08:26:55,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:26:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8143 states. [2020-12-23 08:26:56,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8143 to 5396. [2020-12-23 08:26:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5396 states. [2020-12-23 08:26:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5396 states to 5396 states and 10040 transitions. [2020-12-23 08:26:56,194 INFO L78 Accepts]: Start accepts. Automaton has 5396 states and 10040 transitions. Word has length 88 [2020-12-23 08:26:56,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:56,195 INFO L481 AbstractCegarLoop]: Abstraction has 5396 states and 10040 transitions. [2020-12-23 08:26:56,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:26:56,195 INFO L276 IsEmpty]: Start isEmpty. Operand 5396 states and 10040 transitions. [2020-12-23 08:26:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-23 08:26:56,198 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:56,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:56,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 08:26:56,199 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:56,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:56,200 INFO L82 PathProgramCache]: Analyzing trace with hash -183106049, now seen corresponding path program 1 times [2020-12-23 08:26:56,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:56,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314134982] [2020-12-23 08:26:56,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:56,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314134982] [2020-12-23 08:26:56,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:56,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:26:56,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142481871] [2020-12-23 08:26:56,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:26:56,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:56,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:26:56,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:26:56,269 INFO L87 Difference]: Start difference. First operand 5396 states and 10040 transitions. Second operand 4 states. [2020-12-23 08:26:57,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:57,076 INFO L93 Difference]: Finished difference Result 5411 states and 10054 transitions. [2020-12-23 08:26:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:26:57,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2020-12-23 08:26:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:57,087 INFO L225 Difference]: With dead ends: 5411 [2020-12-23 08:26:57,088 INFO L226 Difference]: Without dead ends: 5398 [2020-12-23 08:26:57,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:26:57,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5398 states. [2020-12-23 08:26:57,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5398 to 5396. [2020-12-23 08:26:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5396 states. [2020-12-23 08:26:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5396 states to 5396 states and 10038 transitions. [2020-12-23 08:26:57,580 INFO L78 Accepts]: Start accepts. Automaton has 5396 states and 10038 transitions. Word has length 90 [2020-12-23 08:26:57,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:57,580 INFO L481 AbstractCegarLoop]: Abstraction has 5396 states and 10038 transitions. [2020-12-23 08:26:57,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:26:57,580 INFO L276 IsEmpty]: Start isEmpty. Operand 5396 states and 10038 transitions. [2020-12-23 08:26:57,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 08:26:57,586 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:57,586 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:26:57,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 08:26:57,586 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:26:57,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:57,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1958221190, now seen corresponding path program 1 times [2020-12-23 08:26:57,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:57,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403486843] [2020-12-23 08:26:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:57,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403486843] [2020-12-23 08:26:57,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:57,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:26:57,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989751105] [2020-12-23 08:26:57,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:26:57,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:57,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:26:57,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:26:57,673 INFO L87 Difference]: Start difference. First operand 5396 states and 10038 transitions. Second operand 5 states. [2020-12-23 08:27:01,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:27:01,096 INFO L93 Difference]: Finished difference Result 16761 states and 31036 transitions. [2020-12-23 08:27:01,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:27:01,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2020-12-23 08:27:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:27:01,117 INFO L225 Difference]: With dead ends: 16761 [2020-12-23 08:27:01,117 INFO L226 Difference]: Without dead ends: 14008 [2020-12-23 08:27:01,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 08:27:01,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14008 states. [2020-12-23 08:27:01,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14008 to 5400. [2020-12-23 08:27:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5400 states. [2020-12-23 08:27:01,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5400 states to 5400 states and 10042 transitions. [2020-12-23 08:27:01,687 INFO L78 Accepts]: Start accepts. Automaton has 5400 states and 10042 transitions. Word has length 97 [2020-12-23 08:27:01,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:27:01,688 INFO L481 AbstractCegarLoop]: Abstraction has 5400 states and 10042 transitions. [2020-12-23 08:27:01,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:27:01,688 INFO L276 IsEmpty]: Start isEmpty. Operand 5400 states and 10042 transitions. [2020-12-23 08:27:01,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 08:27:01,693 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:27:01,693 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:27:01,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 08:27:01,694 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:27:01,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:27:01,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1994848158, now seen corresponding path program 1 times [2020-12-23 08:27:01,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:27:01,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332999088] [2020-12-23 08:27:01,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:27:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:27:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:27:01,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332999088] [2020-12-23 08:27:01,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:27:01,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 08:27:01,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115306789] [2020-12-23 08:27:01,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:27:01,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:27:01,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:27:01,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:27:01,769 INFO L87 Difference]: Start difference. First operand 5400 states and 10042 transitions. Second operand 3 states. [2020-12-23 08:27:02,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:27:02,516 INFO L93 Difference]: Finished difference Result 13063 states and 24336 transitions. [2020-12-23 08:27:02,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:27:02,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-12-23 08:27:02,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:27:02,528 INFO L225 Difference]: With dead ends: 13063 [2020-12-23 08:27:02,528 INFO L226 Difference]: Without dead ends: 8668 [2020-12-23 08:27:02,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:27:02,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8668 states. [2020-12-23 08:27:03,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8668 to 8655. [2020-12-23 08:27:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8655 states. [2020-12-23 08:27:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8655 states to 8655 states and 16067 transitions. [2020-12-23 08:27:03,324 INFO L78 Accepts]: Start accepts. Automaton has 8655 states and 16067 transitions. Word has length 98 [2020-12-23 08:27:03,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:27:03,324 INFO L481 AbstractCegarLoop]: Abstraction has 8655 states and 16067 transitions. [2020-12-23 08:27:03,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:27:03,325 INFO L276 IsEmpty]: Start isEmpty. Operand 8655 states and 16067 transitions. [2020-12-23 08:27:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 08:27:03,329 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:27:03,329 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:27:03,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 08:27:03,330 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:27:03,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:27:03,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1317049385, now seen corresponding path program 1 times [2020-12-23 08:27:03,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:27:03,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025402496] [2020-12-23 08:27:03,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:27:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:27:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:27:03,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025402496] [2020-12-23 08:27:03,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:27:03,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:27:03,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135978563] [2020-12-23 08:27:03,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:27:03,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:27:03,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:27:03,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:27:03,392 INFO L87 Difference]: Start difference. First operand 8655 states and 16067 transitions. Second operand 3 states. [2020-12-23 08:27:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:27:06,101 INFO L93 Difference]: Finished difference Result 21231 states and 39317 transitions. [2020-12-23 08:27:06,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:27:06,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-12-23 08:27:06,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:27:06,122 INFO L225 Difference]: With dead ends: 21231 [2020-12-23 08:27:06,122 INFO L226 Difference]: Without dead ends: 14238 [2020-12-23 08:27:06,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:27:06,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14238 states. [2020-12-23 08:27:06,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14238 to 8343. [2020-12-23 08:27:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8343 states. [2020-12-23 08:27:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8343 states to 8343 states and 15371 transitions. [2020-12-23 08:27:06,804 INFO L78 Accepts]: Start accepts. Automaton has 8343 states and 15371 transitions. Word has length 98 [2020-12-23 08:27:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:27:06,804 INFO L481 AbstractCegarLoop]: Abstraction has 8343 states and 15371 transitions. [2020-12-23 08:27:06,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:27:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 8343 states and 15371 transitions. [2020-12-23 08:27:06,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 08:27:06,809 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:27:06,809 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:27:06,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 08:27:06,810 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:27:06,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:27:06,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1220561966, now seen corresponding path program 1 times [2020-12-23 08:27:06,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:27:06,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796197852] [2020-12-23 08:27:06,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:27:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:27:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:27:06,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796197852] [2020-12-23 08:27:06,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:27:06,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:27:06,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358684957] [2020-12-23 08:27:06,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:27:06,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:27:06,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:27:06,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:27:06,896 INFO L87 Difference]: Start difference. First operand 8343 states and 15371 transitions. Second operand 5 states. [2020-12-23 08:27:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:27:10,571 INFO L93 Difference]: Finished difference Result 20169 states and 37381 transitions. [2020-12-23 08:27:10,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:27:10,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2020-12-23 08:27:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:27:10,593 INFO L225 Difference]: With dead ends: 20169 [2020-12-23 08:27:10,593 INFO L226 Difference]: Without dead ends: 13632 [2020-12-23 08:27:10,603 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:27:10,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13632 states. [2020-12-23 08:27:11,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13632 to 8343. [2020-12-23 08:27:11,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8343 states. [2020-12-23 08:27:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8343 states to 8343 states and 15075 transitions. [2020-12-23 08:27:11,517 INFO L78 Accepts]: Start accepts. Automaton has 8343 states and 15075 transitions. Word has length 101 [2020-12-23 08:27:11,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:27:11,517 INFO L481 AbstractCegarLoop]: Abstraction has 8343 states and 15075 transitions. [2020-12-23 08:27:11,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:27:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 8343 states and 15075 transitions. [2020-12-23 08:27:11,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 08:27:11,527 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:27:11,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:27:11,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 08:27:11,527 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:27:11,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:27:11,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1597652250, now seen corresponding path program 1 times [2020-12-23 08:27:11,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:27:11,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499729367] [2020-12-23 08:27:11,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:27:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:27:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:27:11,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499729367] [2020-12-23 08:27:11,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:27:11,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:27:11,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192747997] [2020-12-23 08:27:11,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:27:11,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:27:11,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:27:11,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:27:11,694 INFO L87 Difference]: Start difference. First operand 8343 states and 15075 transitions. Second operand 6 states. [2020-12-23 08:27:16,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:27:16,873 INFO L93 Difference]: Finished difference Result 30747 states and 55483 transitions. [2020-12-23 08:27:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 08:27:16,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2020-12-23 08:27:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:27:16,911 INFO L225 Difference]: With dead ends: 30747 [2020-12-23 08:27:16,911 INFO L226 Difference]: Without dead ends: 24021 [2020-12-23 08:27:17,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-12-23 08:27:17,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24021 states. [2020-12-23 08:27:18,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24021 to 15199. [2020-12-23 08:27:18,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15199 states. [2020-12-23 08:27:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15199 states to 15199 states and 26525 transitions. [2020-12-23 08:27:18,383 INFO L78 Accepts]: Start accepts. Automaton has 15199 states and 26525 transitions. Word has length 102 [2020-12-23 08:27:18,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:27:18,383 INFO L481 AbstractCegarLoop]: Abstraction has 15199 states and 26525 transitions. [2020-12-23 08:27:18,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:27:18,383 INFO L276 IsEmpty]: Start isEmpty. Operand 15199 states and 26525 transitions. [2020-12-23 08:27:18,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 08:27:18,386 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:27:18,386 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:27:18,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 08:27:18,387 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:27:18,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:27:18,387 INFO L82 PathProgramCache]: Analyzing trace with hash -211448856, now seen corresponding path program 1 times [2020-12-23 08:27:18,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:27:18,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631184638] [2020-12-23 08:27:18,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:27:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:27:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:27:18,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631184638] [2020-12-23 08:27:18,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:27:18,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:27:18,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602072634] [2020-12-23 08:27:18,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:27:18,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:27:18,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:27:18,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:27:18,486 INFO L87 Difference]: Start difference. First operand 15199 states and 26525 transitions. Second operand 3 states. [2020-12-23 08:27:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:27:20,857 INFO L93 Difference]: Finished difference Result 36655 states and 64214 transitions. [2020-12-23 08:27:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:27:20,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2020-12-23 08:27:20,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:27:20,891 INFO L225 Difference]: With dead ends: 36655 [2020-12-23 08:27:20,891 INFO L226 Difference]: Without dead ends: 23824 [2020-12-23 08:27:20,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:27:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23824 states. [2020-12-23 08:27:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23824 to 23783. [2020-12-23 08:27:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23783 states. [2020-12-23 08:27:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23783 states to 23783 states and 41768 transitions. [2020-12-23 08:27:23,180 INFO L78 Accepts]: Start accepts. Automaton has 23783 states and 41768 transitions. Word has length 102 [2020-12-23 08:27:23,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:27:23,181 INFO L481 AbstractCegarLoop]: Abstraction has 23783 states and 41768 transitions. [2020-12-23 08:27:23,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:27:23,181 INFO L276 IsEmpty]: Start isEmpty. Operand 23783 states and 41768 transitions. [2020-12-23 08:27:23,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-23 08:27:23,185 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:27:23,185 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:27:23,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 08:27:23,186 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:27:23,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:27:23,186 INFO L82 PathProgramCache]: Analyzing trace with hash 406115304, now seen corresponding path program 1 times [2020-12-23 08:27:23,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:27:23,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105181017] [2020-12-23 08:27:23,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:27:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:27:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:27:23,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105181017] [2020-12-23 08:27:23,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:27:23,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:27:23,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594931287] [2020-12-23 08:27:23,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:27:23,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:27:23,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:27:23,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:27:23,357 INFO L87 Difference]: Start difference. First operand 23783 states and 41768 transitions. Second operand 6 states. [2020-12-23 08:27:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:27:33,075 INFO L93 Difference]: Finished difference Result 95169 states and 168754 transitions. [2020-12-23 08:27:33,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:27:33,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2020-12-23 08:27:33,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:27:33,172 INFO L225 Difference]: With dead ends: 95169 [2020-12-23 08:27:33,172 INFO L226 Difference]: Without dead ends: 71480 [2020-12-23 08:27:33,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-12-23 08:27:33,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71480 states. [2020-12-23 08:27:38,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71480 to 46969. [2020-12-23 08:27:38,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46969 states. [2020-12-23 08:27:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46969 states to 46969 states and 82551 transitions. [2020-12-23 08:27:38,312 INFO L78 Accepts]: Start accepts. Automaton has 46969 states and 82551 transitions. Word has length 103 [2020-12-23 08:27:38,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:27:38,313 INFO L481 AbstractCegarLoop]: Abstraction has 46969 states and 82551 transitions. [2020-12-23 08:27:38,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:27:38,313 INFO L276 IsEmpty]: Start isEmpty. Operand 46969 states and 82551 transitions. [2020-12-23 08:27:38,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 08:27:38,320 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:27:38,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:27:38,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 08:27:38,321 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:27:38,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:27:38,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1844676653, now seen corresponding path program 1 times [2020-12-23 08:27:38,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:27:38,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214699066] [2020-12-23 08:27:38,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:27:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:27:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:27:38,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214699066] [2020-12-23 08:27:38,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:27:38,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:27:38,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508198238] [2020-12-23 08:27:38,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:27:38,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:27:38,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:27:38,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:27:38,393 INFO L87 Difference]: Start difference. First operand 46969 states and 82551 transitions. Second operand 5 states. [2020-12-23 08:27:43,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:27:43,712 INFO L93 Difference]: Finished difference Result 93870 states and 165011 transitions. [2020-12-23 08:27:43,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 08:27:43,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2020-12-23 08:27:43,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:27:43,781 INFO L225 Difference]: With dead ends: 93870 [2020-12-23 08:27:43,781 INFO L226 Difference]: Without dead ends: 46980 [2020-12-23 08:27:43,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 08:27:43,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46980 states. [2020-12-23 08:27:48,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46980 to 46965. [2020-12-23 08:27:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46965 states. [2020-12-23 08:27:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46965 states to 46965 states and 82541 transitions. [2020-12-23 08:27:48,712 INFO L78 Accepts]: Start accepts. Automaton has 46965 states and 82541 transitions. Word has length 105 [2020-12-23 08:27:48,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:27:48,712 INFO L481 AbstractCegarLoop]: Abstraction has 46965 states and 82541 transitions. [2020-12-23 08:27:48,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:27:48,712 INFO L276 IsEmpty]: Start isEmpty. Operand 46965 states and 82541 transitions. [2020-12-23 08:27:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 08:27:48,720 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:27:48,720 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:27:48,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 08:27:48,720 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:27:48,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:27:48,721 INFO L82 PathProgramCache]: Analyzing trace with hash -833402693, now seen corresponding path program 1 times [2020-12-23 08:27:48,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:27:48,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006152157] [2020-12-23 08:27:48,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:27:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:27:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:27:48,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006152157] [2020-12-23 08:27:48,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:27:48,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:27:48,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922984784] [2020-12-23 08:27:48,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:27:48,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:27:48,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:27:48,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:27:48,845 INFO L87 Difference]: Start difference. First operand 46965 states and 82541 transitions. Second operand 4 states. [2020-12-23 08:27:58,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:27:58,286 INFO L93 Difference]: Finished difference Result 131509 states and 231268 transitions. [2020-12-23 08:27:58,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:27:58,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 08:27:58,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:27:58,421 INFO L225 Difference]: With dead ends: 131509 [2020-12-23 08:27:58,421 INFO L226 Difference]: Without dead ends: 84694 [2020-12-23 08:27:58,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:27:58,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84694 states. [2020-12-23 08:28:05,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84694 to 63288. [2020-12-23 08:28:05,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63288 states. [2020-12-23 08:28:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63288 states to 63288 states and 110478 transitions. [2020-12-23 08:28:05,653 INFO L78 Accepts]: Start accepts. Automaton has 63288 states and 110478 transitions. Word has length 106 [2020-12-23 08:28:05,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:28:05,653 INFO L481 AbstractCegarLoop]: Abstraction has 63288 states and 110478 transitions. [2020-12-23 08:28:05,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:28:05,653 INFO L276 IsEmpty]: Start isEmpty. Operand 63288 states and 110478 transitions. [2020-12-23 08:28:05,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 08:28:05,661 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:28:05,661 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:28:05,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 08:28:05,661 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:28:05,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:28:05,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1447452521, now seen corresponding path program 1 times [2020-12-23 08:28:05,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:28:05,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357573184] [2020-12-23 08:28:05,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:28:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:28:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:28:05,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357573184] [2020-12-23 08:28:05,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:28:05,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:28:05,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784017174] [2020-12-23 08:28:05,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:28:05,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:28:05,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:28:05,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:28:05,733 INFO L87 Difference]: Start difference. First operand 63288 states and 110478 transitions. Second operand 5 states. [2020-12-23 08:28:09,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:28:09,705 INFO L93 Difference]: Finished difference Result 94551 states and 165081 transitions. [2020-12-23 08:28:09,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 08:28:09,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2020-12-23 08:28:09,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:28:09,748 INFO L225 Difference]: With dead ends: 94551 [2020-12-23 08:28:09,748 INFO L226 Difference]: Without dead ends: 31293 [2020-12-23 08:28:09,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 08:28:09,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31293 states. [2020-12-23 08:28:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31293 to 31293. [2020-12-23 08:28:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31293 states. [2020-12-23 08:28:13,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31293 states to 31293 states and 54638 transitions. [2020-12-23 08:28:13,449 INFO L78 Accepts]: Start accepts. Automaton has 31293 states and 54638 transitions. Word has length 106 [2020-12-23 08:28:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:28:13,449 INFO L481 AbstractCegarLoop]: Abstraction has 31293 states and 54638 transitions. [2020-12-23 08:28:13,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:28:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 31293 states and 54638 transitions. [2020-12-23 08:28:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 08:28:13,453 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:28:13,453 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:28:13,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 08:28:13,454 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:28:13,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:28:13,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1065012452, now seen corresponding path program 1 times [2020-12-23 08:28:13,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:28:13,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309581537] [2020-12-23 08:28:13,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:28:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:28:13,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:28:13,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309581537] [2020-12-23 08:28:13,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:28:13,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:28:13,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847614406] [2020-12-23 08:28:13,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:28:13,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:28:13,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:28:13,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:28:13,538 INFO L87 Difference]: Start difference. First operand 31293 states and 54638 transitions. Second operand 5 states. [2020-12-23 08:28:28,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:28:28,343 INFO L93 Difference]: Finished difference Result 138698 states and 242253 transitions. [2020-12-23 08:28:28,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:28:28,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2020-12-23 08:28:28,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:28:28,507 INFO L225 Difference]: With dead ends: 138698 [2020-12-23 08:28:28,507 INFO L226 Difference]: Without dead ends: 107482 [2020-12-23 08:28:28,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 08:28:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107482 states. [2020-12-23 08:28:32,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107482 to 31349. [2020-12-23 08:28:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31349 states. [2020-12-23 08:28:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31349 states to 31349 states and 54694 transitions. [2020-12-23 08:28:32,942 INFO L78 Accepts]: Start accepts. Automaton has 31349 states and 54694 transitions. Word has length 107 [2020-12-23 08:28:32,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:28:32,942 INFO L481 AbstractCegarLoop]: Abstraction has 31349 states and 54694 transitions. [2020-12-23 08:28:32,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:28:32,942 INFO L276 IsEmpty]: Start isEmpty. Operand 31349 states and 54694 transitions. [2020-12-23 08:28:32,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-23 08:28:32,945 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:28:32,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:28:32,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 08:28:32,945 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:28:32,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:28:32,946 INFO L82 PathProgramCache]: Analyzing trace with hash -79358499, now seen corresponding path program 1 times [2020-12-23 08:28:32,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:28:32,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942803456] [2020-12-23 08:28:32,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:28:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:28:33,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:28:33,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942803456] [2020-12-23 08:28:33,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:28:33,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:28:33,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811544525] [2020-12-23 08:28:33,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:28:33,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:28:33,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:28:33,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:28:33,052 INFO L87 Difference]: Start difference. First operand 31349 states and 54694 transitions. Second operand 4 states. [2020-12-23 08:28:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:28:42,536 INFO L93 Difference]: Finished difference Result 87775 states and 155207 transitions. [2020-12-23 08:28:42,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:28:42,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2020-12-23 08:28:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:28:42,616 INFO L225 Difference]: With dead ends: 87775 [2020-12-23 08:28:42,616 INFO L226 Difference]: Without dead ends: 56496 [2020-12-23 08:28:42,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:28:42,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56496 states. [2020-12-23 08:28:47,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56496 to 38557. [2020-12-23 08:28:47,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38557 states. [2020-12-23 08:28:47,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38557 states to 38557 states and 66366 transitions. [2020-12-23 08:28:47,552 INFO L78 Accepts]: Start accepts. Automaton has 38557 states and 66366 transitions. Word has length 108 [2020-12-23 08:28:47,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:28:47,553 INFO L481 AbstractCegarLoop]: Abstraction has 38557 states and 66366 transitions. [2020-12-23 08:28:47,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:28:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 38557 states and 66366 transitions. [2020-12-23 08:28:47,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-23 08:28:47,556 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:28:47,557 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:28:47,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-23 08:28:47,557 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:28:47,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:28:47,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1418033947, now seen corresponding path program 1 times [2020-12-23 08:28:47,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:28:47,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164828249] [2020-12-23 08:28:47,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:28:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:28:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:28:47,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164828249] [2020-12-23 08:28:47,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:28:47,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:28:47,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245631364] [2020-12-23 08:28:47,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:28:47,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:28:47,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:28:47,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:28:47,632 INFO L87 Difference]: Start difference. First operand 38557 states and 66366 transitions. Second operand 5 states. [2020-12-23 08:29:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:29:06,465 INFO L93 Difference]: Finished difference Result 187335 states and 322285 transitions. [2020-12-23 08:29:06,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:29:06,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2020-12-23 08:29:06,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:29:06,727 INFO L225 Difference]: With dead ends: 187335 [2020-12-23 08:29:06,728 INFO L226 Difference]: Without dead ends: 148855 [2020-12-23 08:29:06,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 08:29:07,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148855 states. [2020-12-23 08:29:12,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148855 to 38625. [2020-12-23 08:29:12,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38625 states. [2020-12-23 08:29:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38625 states to 38625 states and 66434 transitions. [2020-12-23 08:29:12,982 INFO L78 Accepts]: Start accepts. Automaton has 38625 states and 66434 transitions. Word has length 110 [2020-12-23 08:29:12,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:29:12,982 INFO L481 AbstractCegarLoop]: Abstraction has 38625 states and 66434 transitions. [2020-12-23 08:29:12,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:29:12,982 INFO L276 IsEmpty]: Start isEmpty. Operand 38625 states and 66434 transitions. [2020-12-23 08:29:12,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-23 08:29:12,985 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:29:12,985 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:29:12,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-23 08:29:12,986 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:29:12,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:29:12,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1899114205, now seen corresponding path program 1 times [2020-12-23 08:29:12,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:29:12,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758286896] [2020-12-23 08:29:12,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:29:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:29:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:29:13,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758286896] [2020-12-23 08:29:13,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:29:13,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:29:13,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299080163] [2020-12-23 08:29:13,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:29:13,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:29:13,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:29:13,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:29:13,163 INFO L87 Difference]: Start difference. First operand 38625 states and 66434 transitions. Second operand 6 states. [2020-12-23 08:29:24,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:29:24,056 INFO L93 Difference]: Finished difference Result 98172 states and 169159 transitions. [2020-12-23 08:29:24,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 08:29:24,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2020-12-23 08:29:24,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:29:24,152 INFO L225 Difference]: With dead ends: 98172 [2020-12-23 08:29:24,152 INFO L226 Difference]: Without dead ends: 65137 [2020-12-23 08:29:24,177 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-23 08:29:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65137 states. [2020-12-23 08:29:29,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65137 to 38537. [2020-12-23 08:29:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38537 states. [2020-12-23 08:29:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38537 states to 38537 states and 66258 transitions. [2020-12-23 08:29:29,642 INFO L78 Accepts]: Start accepts. Automaton has 38537 states and 66258 transitions. Word has length 110 [2020-12-23 08:29:29,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:29:29,642 INFO L481 AbstractCegarLoop]: Abstraction has 38537 states and 66258 transitions. [2020-12-23 08:29:29,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:29:29,642 INFO L276 IsEmpty]: Start isEmpty. Operand 38537 states and 66258 transitions. [2020-12-23 08:29:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 08:29:29,645 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:29:29,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:29:29,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-23 08:29:29,645 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:29:29,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:29:29,646 INFO L82 PathProgramCache]: Analyzing trace with hash 809491801, now seen corresponding path program 1 times [2020-12-23 08:29:29,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:29:29,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855684696] [2020-12-23 08:29:29,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:29:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:29:29,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:29:29,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855684696] [2020-12-23 08:29:29,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:29:29,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 08:29:29,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102619678] [2020-12-23 08:29:29,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:29:29,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:29:29,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:29:29,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:29:29,726 INFO L87 Difference]: Start difference. First operand 38537 states and 66258 transitions. Second operand 3 states. [2020-12-23 08:29:38,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:29:38,633 INFO L93 Difference]: Finished difference Result 101880 states and 175387 transitions. [2020-12-23 08:29:38,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:29:38,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2020-12-23 08:29:38,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:29:38,745 INFO L225 Difference]: With dead ends: 101880 [2020-12-23 08:29:38,746 INFO L226 Difference]: Without dead ends: 65246 [2020-12-23 08:29:38,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:29:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65246 states. [2020-12-23 08:29:47,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65246 to 65233. [2020-12-23 08:29:47,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65233 states. [2020-12-23 08:29:47,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65233 states to 65233 states and 112328 transitions. [2020-12-23 08:29:47,834 INFO L78 Accepts]: Start accepts. Automaton has 65233 states and 112328 transitions. Word has length 117 [2020-12-23 08:29:47,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:29:47,834 INFO L481 AbstractCegarLoop]: Abstraction has 65233 states and 112328 transitions. [2020-12-23 08:29:47,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:29:47,835 INFO L276 IsEmpty]: Start isEmpty. Operand 65233 states and 112328 transitions. [2020-12-23 08:29:47,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 08:29:47,839 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:29:47,840 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:29:47,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-23 08:29:47,840 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:29:47,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:29:47,840 INFO L82 PathProgramCache]: Analyzing trace with hash 112939318, now seen corresponding path program 1 times [2020-12-23 08:29:47,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:29:47,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502478749] [2020-12-23 08:29:47,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:29:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:29:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:29:47,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502478749] [2020-12-23 08:29:47,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:29:47,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 08:29:47,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080531910] [2020-12-23 08:29:47,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:29:47,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:29:47,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:29:47,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:29:47,921 INFO L87 Difference]: Start difference. First operand 65233 states and 112328 transitions. Second operand 3 states.