/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_product19.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 18:17:20,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 18:17:20,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 18:17:20,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 18:17:20,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 18:17:20,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 18:17:20,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 18:17:20,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 18:17:20,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 18:17:20,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 18:17:20,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 18:17:20,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 18:17:20,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 18:17:20,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 18:17:20,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 18:17:20,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 18:17:20,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 18:17:20,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 18:17:20,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 18:17:20,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 18:17:20,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 18:17:20,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 18:17:20,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 18:17:20,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 18:17:20,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 18:17:20,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 18:17:20,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 18:17:20,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 18:17:20,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 18:17:20,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 18:17:20,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 18:17:20,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 18:17:20,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 18:17:20,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 18:17:20,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 18:17:20,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 18:17:20,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 18:17:20,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 18:17:20,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 18:17:20,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 18:17:20,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 18:17:20,555 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 18:17:20,604 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 18:17:20,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 18:17:20,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 18:17:20,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 18:17:20,610 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 18:17:20,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 18:17:20,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 18:17:20,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 18:17:20,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 18:17:20,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 18:17:20,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 18:17:20,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 18:17:20,612 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 18:17:20,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 18:17:20,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 18:17:20,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 18:17:20,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 18:17:20,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 18:17:20,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 18:17:20,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 18:17:20,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 18:17:20,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 18:17:20,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 18:17:20,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 18:17:20,615 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 18:17:20,615 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 [2021-01-06 18:17:21,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 18:17:21,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 18:17:21,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 18:17:21,099 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 18:17:21,099 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 18:17:21,100 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec1_product19.cil.c [2021-01-06 18:17:21,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/32d5a0b75/009e9ca2747e439299c317fcce11aa14/FLAG8d5371f46 [2021-01-06 18:17:22,101 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 18:17:22,102 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec1_product19.cil.c [2021-01-06 18:17:22,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/32d5a0b75/009e9ca2747e439299c317fcce11aa14/FLAG8d5371f46 [2021-01-06 18:17:22,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/32d5a0b75/009e9ca2747e439299c317fcce11aa14 [2021-01-06 18:17:22,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 18:17:22,221 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 18:17:22,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 18:17:22,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 18:17:22,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 18:17:22,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 06:17:22" (1/1) ... [2021-01-06 18:17:22,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2b2c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:17:22, skipping insertion in model container [2021-01-06 18:17:22,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 06:17:22" (1/1) ... [2021-01-06 18:17:22,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 18:17:22,334 INFO L178 MainTranslator]: Built tables and reachable declarations 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[~retValue_acc~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[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] 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~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] 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~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] 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~5,] left hand side expression in assignment: lhs: VariableLHS[~nd~0,] 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~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~maxLength~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~action~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~origin~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] 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~9,] 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~9,] left hand side expression in assignment: lhs: VariableLHS[~floor~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~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[~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~10,] 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~10,] 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~11,] left hand side expression in assignment: lhs: VariableLHS[~weight~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~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] 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~13,] 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~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] 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[~retValue_acc~15,] 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[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] 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___2~2,] 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___1~2,] 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___0~3,] 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~12,] 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[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] 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___3~2,] 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___2~3,] 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___1~3,] 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~4,] 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[~retValue_acc~18,] 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[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] 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___8~0,] 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___7~0,] 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___6~0,] 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___5~0,] 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[~retValue_acc~18,] 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~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] 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[~retValue_acc~19,] 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~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] 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~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] 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~7,] 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[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] 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~20,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~3,] 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~0,] 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~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[~__cil_tmp13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~0,] 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~21,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp24~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~5,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] 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[~i~1,] 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~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[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] [2021-01-06 18:17:23,000 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_product19.cil.c[61143,61156] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~excep~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~2,] 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~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[~__cil_tmp12~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~1,] 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~1,] 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~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] 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[~mem_16~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~2,] 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[~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~2,] 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~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~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[~__cil_tmp12~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~1,] 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~26,] 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~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~4,] 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~27,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] 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[~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~4,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~mem_24~0,] 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[~__cil_tmp4~1,] 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~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~4,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~0,] 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~28,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~2,] 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~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~5,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~1,] 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[~retValue_acc~29,] [2021-01-06 18:17:23,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 18:17:23,068 INFO L203 MainTranslator]: Completed pre-run 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[~retValue_acc~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[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] 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~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] 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~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] 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~5,] left hand side expression in assignment: lhs: VariableLHS[~nd~0,] 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~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~maxLength~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~action~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~origin~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] 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~9,] 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~9,] left hand side expression in assignment: lhs: VariableLHS[~floor~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~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[~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~10,] 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~10,] 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~11,] left hand side expression in assignment: lhs: VariableLHS[~weight~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~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] 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~13,] 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~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] 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[~retValue_acc~15,] 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[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] 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___2~2,] 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___1~2,] 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___0~3,] 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~12,] 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[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] 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___3~2,] 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___2~3,] 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___1~3,] 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~4,] 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[~retValue_acc~18,] 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[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] 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___8~0,] 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___7~0,] 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___6~0,] 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___5~0,] 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[~retValue_acc~18,] 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~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] 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[~retValue_acc~19,] 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~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] 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~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] 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~7,] 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[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] 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~20,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~3,] 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~0,] 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~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[~__cil_tmp13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~0,] 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~21,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp24~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~5,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] 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[~i~1,] 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~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[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] [2021-01-06 18:17:23,185 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_product19.cil.c[61143,61156] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~excep~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~2,] 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~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[~__cil_tmp12~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~1,] 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~1,] 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~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] 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[~mem_16~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~2,] 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[~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~2,] 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~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~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[~__cil_tmp12~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~1,] 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~26,] 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~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~4,] 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~27,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] 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[~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~4,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~mem_24~0,] 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[~__cil_tmp4~1,] 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~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~4,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~0,] 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~28,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~2,] 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~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~5,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~1,] 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[~retValue_acc~29,] [2021-01-06 18:17:23,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 18:17:23,322 INFO L208 MainTranslator]: Completed translation [2021-01-06 18:17:23,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:17:23 WrapperNode [2021-01-06 18:17:23,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 18:17:23,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 18:17:23,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 18:17:23,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 18:17:23,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:17:23" (1/1) ... [2021-01-06 18:17:23,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:17:23" (1/1) ... [2021-01-06 18:17:23,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 18:17:23,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 18:17:23,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 18:17:23,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 18:17:23,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:17:23" (1/1) ... [2021-01-06 18:17:23,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:17:23" (1/1) ... [2021-01-06 18:17:23,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:17:23" (1/1) ... [2021-01-06 18:17:23,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:17:23" (1/1) ... [2021-01-06 18:17:23,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:17:23" (1/1) ... [2021-01-06 18:17:23,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:17:23" (1/1) ... [2021-01-06 18:17:23,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:17:23" (1/1) ... [2021-01-06 18:17:23,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 18:17:23,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 18:17:23,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 18:17:23,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 18:17:23,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:17:23" (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 [2021-01-06 18:17:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 18:17:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 18:17:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 18:17:23,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 18:17:29,639 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 18:17:29,639 INFO L299 CfgBuilder]: Removed 601 assume(true) statements. [2021-01-06 18:17:29,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 06:17:29 BoogieIcfgContainer [2021-01-06 18:17:29,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 18:17:29,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 18:17:29,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 18:17:29,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 18:17:29,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 06:17:22" (1/3) ... [2021-01-06 18:17:29,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7c703c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 06:17:29, skipping insertion in model container [2021-01-06 18:17:29,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:17:23" (2/3) ... [2021-01-06 18:17:29,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7c703c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 06:17:29, skipping insertion in model container [2021-01-06 18:17:29,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 06:17:29" (3/3) ... [2021-01-06 18:17:29,658 INFO L111 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product19.cil.c [2021-01-06 18:17:29,665 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 18:17:29,672 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2021-01-06 18:17:29,694 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-01-06 18:17:29,734 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 18:17:29,734 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 18:17:29,734 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 18:17:29,735 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 18:17:29,735 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 18:17:29,735 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 18:17:29,735 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 18:17:29,736 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 18:17:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states. [2021-01-06 18:17:29,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 18:17:29,820 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:29,821 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] [2021-01-06 18:17:29,821 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]=== [2021-01-06 18:17:29,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:29,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1084388217, now seen corresponding path program 1 times [2021-01-06 18:17:29,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:29,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414754486] [2021-01-06 18:17:29,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:30,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414754486] [2021-01-06 18:17:30,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:30,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:30,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080100034] [2021-01-06 18:17:30,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:17:30,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:30,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:17:30,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:17:30,317 INFO L87 Difference]: Start difference. First operand 2495 states. Second operand 3 states. [2021-01-06 18:17:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:30,656 INFO L93 Difference]: Finished difference Result 7405 states and 13937 transitions. [2021-01-06 18:17:30,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:17:30,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2021-01-06 18:17:30,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:30,734 INFO L225 Difference]: With dead ends: 7405 [2021-01-06 18:17:30,734 INFO L226 Difference]: Without dead ends: 4915 [2021-01-06 18:17:30,750 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 [2021-01-06 18:17:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4915 states. [2021-01-06 18:17:30,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4915 to 2491. [2021-01-06 18:17:30,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2491 states. [2021-01-06 18:17:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2491 states to 2491 states and 4676 transitions. [2021-01-06 18:17:30,947 INFO L78 Accepts]: Start accepts. Automaton has 2491 states and 4676 transitions. Word has length 53 [2021-01-06 18:17:30,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:30,948 INFO L481 AbstractCegarLoop]: Abstraction has 2491 states and 4676 transitions. [2021-01-06 18:17:30,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:17:30,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2491 states and 4676 transitions. [2021-01-06 18:17:30,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-06 18:17:30,956 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:30,956 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] [2021-01-06 18:17:30,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 18:17:30,958 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]=== [2021-01-06 18:17:30,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:30,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1476285378, now seen corresponding path program 1 times [2021-01-06 18:17:30,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:30,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172083693] [2021-01-06 18:17:30,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:31,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:31,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172083693] [2021-01-06 18:17:31,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:31,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:17:31,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970490541] [2021-01-06 18:17:31,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:17:31,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:31,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:17:31,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:17:31,187 INFO L87 Difference]: Start difference. First operand 2491 states and 4676 transitions. Second operand 6 states. [2021-01-06 18:17:31,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:31,910 INFO L93 Difference]: Finished difference Result 9739 states and 18301 transitions. [2021-01-06 18:17:31,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 18:17:31,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2021-01-06 18:17:31,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:31,956 INFO L225 Difference]: With dead ends: 9739 [2021-01-06 18:17:31,956 INFO L226 Difference]: Without dead ends: 7291 [2021-01-06 18:17:31,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-01-06 18:17:31,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7291 states. [2021-01-06 18:17:32,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7291 to 2487. [2021-01-06 18:17:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2487 states. [2021-01-06 18:17:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 4665 transitions. [2021-01-06 18:17:32,126 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 4665 transitions. Word has length 60 [2021-01-06 18:17:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:32,127 INFO L481 AbstractCegarLoop]: Abstraction has 2487 states and 4665 transitions. [2021-01-06 18:17:32,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:17:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 4665 transitions. [2021-01-06 18:17:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 18:17:32,131 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:32,132 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] [2021-01-06 18:17:32,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 18:17:32,132 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]=== [2021-01-06 18:17:32,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:32,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1835176235, now seen corresponding path program 1 times [2021-01-06 18:17:32,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:32,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72717771] [2021-01-06 18:17:32,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:32,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72717771] [2021-01-06 18:17:32,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:32,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:32,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636046840] [2021-01-06 18:17:32,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:32,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:32,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:32,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:32,271 INFO L87 Difference]: Start difference. First operand 2487 states and 4665 transitions. Second operand 4 states. [2021-01-06 18:17:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:32,812 INFO L93 Difference]: Finished difference Result 7349 states and 13804 transitions. [2021-01-06 18:17:32,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:32,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2021-01-06 18:17:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:32,842 INFO L225 Difference]: With dead ends: 7349 [2021-01-06 18:17:32,842 INFO L226 Difference]: Without dead ends: 4905 [2021-01-06 18:17:32,848 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 [2021-01-06 18:17:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2021-01-06 18:17:33,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 2487. [2021-01-06 18:17:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2487 states. [2021-01-06 18:17:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 4656 transitions. [2021-01-06 18:17:33,053 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 4656 transitions. Word has length 62 [2021-01-06 18:17:33,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:33,053 INFO L481 AbstractCegarLoop]: Abstraction has 2487 states and 4656 transitions. [2021-01-06 18:17:33,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:33,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 4656 transitions. [2021-01-06 18:17:33,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 18:17:33,057 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:33,057 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] [2021-01-06 18:17:33,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 18:17:33,058 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]=== [2021-01-06 18:17:33,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:33,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1856631896, now seen corresponding path program 1 times [2021-01-06 18:17:33,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:33,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766771657] [2021-01-06 18:17:33,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:33,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766771657] [2021-01-06 18:17:33,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:33,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:33,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726611802] [2021-01-06 18:17:33,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:33,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:33,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:33,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:33,140 INFO L87 Difference]: Start difference. First operand 2487 states and 4656 transitions. Second operand 4 states. [2021-01-06 18:17:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:33,638 INFO L93 Difference]: Finished difference Result 7349 states and 13786 transitions. [2021-01-06 18:17:33,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:33,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-01-06 18:17:33,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:33,669 INFO L225 Difference]: With dead ends: 7349 [2021-01-06 18:17:33,669 INFO L226 Difference]: Without dead ends: 4905 [2021-01-06 18:17:33,675 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 [2021-01-06 18:17:33,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2021-01-06 18:17:33,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 2487. [2021-01-06 18:17:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2487 states. [2021-01-06 18:17:33,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 4647 transitions. [2021-01-06 18:17:33,809 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 4647 transitions. Word has length 64 [2021-01-06 18:17:33,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:33,809 INFO L481 AbstractCegarLoop]: Abstraction has 2487 states and 4647 transitions. [2021-01-06 18:17:33,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:33,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 4647 transitions. [2021-01-06 18:17:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 18:17:33,812 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:33,812 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] [2021-01-06 18:17:33,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 18:17:33,813 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]=== [2021-01-06 18:17:33,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:33,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1413024043, now seen corresponding path program 1 times [2021-01-06 18:17:33,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:33,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247129862] [2021-01-06 18:17:33,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:33,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247129862] [2021-01-06 18:17:33,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:33,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:33,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050427764] [2021-01-06 18:17:33,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:33,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:33,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:33,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:33,885 INFO L87 Difference]: Start difference. First operand 2487 states and 4647 transitions. Second operand 4 states. [2021-01-06 18:17:34,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:34,598 INFO L93 Difference]: Finished difference Result 12125 states and 22742 transitions. [2021-01-06 18:17:34,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:34,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 18:17:34,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:34,657 INFO L225 Difference]: With dead ends: 12125 [2021-01-06 18:17:34,657 INFO L226 Difference]: Without dead ends: 9681 [2021-01-06 18:17:34,665 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 [2021-01-06 18:17:34,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9681 states. [2021-01-06 18:17:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9681 to 2487. [2021-01-06 18:17:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2487 states. [2021-01-06 18:17:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 4643 transitions. [2021-01-06 18:17:34,858 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 4643 transitions. Word has length 66 [2021-01-06 18:17:34,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:34,858 INFO L481 AbstractCegarLoop]: Abstraction has 2487 states and 4643 transitions. [2021-01-06 18:17:34,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:34,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 4643 transitions. [2021-01-06 18:17:34,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 18:17:34,861 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:34,862 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] [2021-01-06 18:17:34,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 18:17:34,863 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]=== [2021-01-06 18:17:34,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:34,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2071958955, now seen corresponding path program 1 times [2021-01-06 18:17:34,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:34,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439125313] [2021-01-06 18:17:34,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:34,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:34,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439125313] [2021-01-06 18:17:34,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:34,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:34,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019707353] [2021-01-06 18:17:34,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:34,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:34,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:34,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:34,987 INFO L87 Difference]: Start difference. First operand 2487 states and 4643 transitions. Second operand 4 states. [2021-01-06 18:17:35,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:35,491 INFO L93 Difference]: Finished difference Result 9716 states and 18215 transitions. [2021-01-06 18:17:35,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:35,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 18:17:35,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:35,515 INFO L225 Difference]: With dead ends: 9716 [2021-01-06 18:17:35,516 INFO L226 Difference]: Without dead ends: 7251 [2021-01-06 18:17:35,524 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 [2021-01-06 18:17:35,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7251 states. [2021-01-06 18:17:35,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7251 to 2469. [2021-01-06 18:17:35,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2469 states. [2021-01-06 18:17:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 4612 transitions. [2021-01-06 18:17:35,721 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 4612 transitions. Word has length 66 [2021-01-06 18:17:35,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:35,721 INFO L481 AbstractCegarLoop]: Abstraction has 2469 states and 4612 transitions. [2021-01-06 18:17:35,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 4612 transitions. [2021-01-06 18:17:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 18:17:35,725 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:35,725 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] [2021-01-06 18:17:35,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 18:17:35,725 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]=== [2021-01-06 18:17:35,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:35,726 INFO L82 PathProgramCache]: Analyzing trace with hash 100768336, now seen corresponding path program 1 times [2021-01-06 18:17:35,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:35,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619496979] [2021-01-06 18:17:35,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:35,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619496979] [2021-01-06 18:17:35,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:35,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:35,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54884819] [2021-01-06 18:17:35,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:35,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:35,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:35,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:35,842 INFO L87 Difference]: Start difference. First operand 2469 states and 4612 transitions. Second operand 4 states. [2021-01-06 18:17:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:36,320 INFO L93 Difference]: Finished difference Result 7313 states and 13699 transitions. [2021-01-06 18:17:36,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:36,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-01-06 18:17:36,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:36,335 INFO L225 Difference]: With dead ends: 7313 [2021-01-06 18:17:36,336 INFO L226 Difference]: Without dead ends: 4866 [2021-01-06 18:17:36,343 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 [2021-01-06 18:17:36,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4866 states. [2021-01-06 18:17:36,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4866 to 2469. [2021-01-06 18:17:36,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2469 states. [2021-01-06 18:17:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 4606 transitions. [2021-01-06 18:17:36,506 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 4606 transitions. Word has length 67 [2021-01-06 18:17:36,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:36,506 INFO L481 AbstractCegarLoop]: Abstraction has 2469 states and 4606 transitions. [2021-01-06 18:17:36,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 4606 transitions. [2021-01-06 18:17:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 18:17:36,509 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:36,509 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] [2021-01-06 18:17:36,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 18:17:36,510 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]=== [2021-01-06 18:17:36,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:36,510 INFO L82 PathProgramCache]: Analyzing trace with hash 336629648, now seen corresponding path program 1 times [2021-01-06 18:17:36,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:36,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26723461] [2021-01-06 18:17:36,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:36,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26723461] [2021-01-06 18:17:36,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:36,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:36,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785536259] [2021-01-06 18:17:36,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:36,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:36,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:36,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:36,628 INFO L87 Difference]: Start difference. First operand 2469 states and 4606 transitions. Second operand 4 states. [2021-01-06 18:17:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:37,032 INFO L93 Difference]: Finished difference Result 7313 states and 13687 transitions. [2021-01-06 18:17:37,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:37,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-01-06 18:17:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:37,048 INFO L225 Difference]: With dead ends: 7313 [2021-01-06 18:17:37,049 INFO L226 Difference]: Without dead ends: 4866 [2021-01-06 18:17:37,053 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 [2021-01-06 18:17:37,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4866 states. [2021-01-06 18:17:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4866 to 2469. [2021-01-06 18:17:37,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2469 states. [2021-01-06 18:17:37,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 4600 transitions. [2021-01-06 18:17:37,196 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 4600 transitions. Word has length 68 [2021-01-06 18:17:37,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:37,197 INFO L481 AbstractCegarLoop]: Abstraction has 2469 states and 4600 transitions. [2021-01-06 18:17:37,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:37,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 4600 transitions. [2021-01-06 18:17:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 18:17:37,200 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:37,200 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] [2021-01-06 18:17:37,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 18:17:37,200 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]=== [2021-01-06 18:17:37,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:37,201 INFO L82 PathProgramCache]: Analyzing trace with hash -388666453, now seen corresponding path program 1 times [2021-01-06 18:17:37,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:37,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034359145] [2021-01-06 18:17:37,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:37,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:37,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034359145] [2021-01-06 18:17:37,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:37,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 18:17:37,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140505666] [2021-01-06 18:17:37,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 18:17:37,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:37,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 18:17:37,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:17:37,320 INFO L87 Difference]: Start difference. First operand 2469 states and 4600 transitions. Second operand 7 states. [2021-01-06 18:17:38,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:38,151 INFO L93 Difference]: Finished difference Result 12096 states and 22656 transitions. [2021-01-06 18:17:38,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:17:38,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2021-01-06 18:17:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:38,181 INFO L225 Difference]: With dead ends: 12096 [2021-01-06 18:17:38,182 INFO L226 Difference]: Without dead ends: 9655 [2021-01-06 18:17:38,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-01-06 18:17:38,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9655 states. [2021-01-06 18:17:38,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9655 to 2471. [2021-01-06 18:17:38,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2471 states. [2021-01-06 18:17:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 4601 transitions. [2021-01-06 18:17:38,381 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 4601 transitions. Word has length 69 [2021-01-06 18:17:38,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:38,386 INFO L481 AbstractCegarLoop]: Abstraction has 2471 states and 4601 transitions. [2021-01-06 18:17:38,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 18:17:38,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 4601 transitions. [2021-01-06 18:17:38,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 18:17:38,389 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:38,389 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] [2021-01-06 18:17:38,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 18:17:38,390 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]=== [2021-01-06 18:17:38,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:38,390 INFO L82 PathProgramCache]: Analyzing trace with hash -436213658, now seen corresponding path program 1 times [2021-01-06 18:17:38,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:38,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314123775] [2021-01-06 18:17:38,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:38,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:38,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314123775] [2021-01-06 18:17:38,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:38,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 18:17:38,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277508097] [2021-01-06 18:17:38,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 18:17:38,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:38,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 18:17:38,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:17:38,528 INFO L87 Difference]: Start difference. First operand 2471 states and 4601 transitions. Second operand 7 states. [2021-01-06 18:17:39,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:39,414 INFO L93 Difference]: Finished difference Result 12088 states and 22635 transitions. [2021-01-06 18:17:39,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:17:39,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2021-01-06 18:17:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:39,449 INFO L225 Difference]: With dead ends: 12088 [2021-01-06 18:17:39,449 INFO L226 Difference]: Without dead ends: 9650 [2021-01-06 18:17:39,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-01-06 18:17:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9650 states. [2021-01-06 18:17:39,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9650 to 2476. [2021-01-06 18:17:39,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2021-01-06 18:17:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 4609 transitions. [2021-01-06 18:17:39,642 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 4609 transitions. Word has length 71 [2021-01-06 18:17:39,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:39,642 INFO L481 AbstractCegarLoop]: Abstraction has 2476 states and 4609 transitions. [2021-01-06 18:17:39,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 18:17:39,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 4609 transitions. [2021-01-06 18:17:39,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 18:17:39,645 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:39,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] [2021-01-06 18:17:39,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 18:17:39,645 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]=== [2021-01-06 18:17:39,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:39,646 INFO L82 PathProgramCache]: Analyzing trace with hash -900477653, now seen corresponding path program 1 times [2021-01-06 18:17:39,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:39,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380380022] [2021-01-06 18:17:39,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:39,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380380022] [2021-01-06 18:17:39,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:39,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:39,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261916433] [2021-01-06 18:17:39,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:17:39,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:39,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:17:39,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:17:39,710 INFO L87 Difference]: Start difference. First operand 2476 states and 4609 transitions. Second operand 3 states. [2021-01-06 18:17:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:39,886 INFO L93 Difference]: Finished difference Result 4894 states and 9136 transitions. [2021-01-06 18:17:39,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:17:39,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2021-01-06 18:17:39,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:39,893 INFO L225 Difference]: With dead ends: 4894 [2021-01-06 18:17:39,894 INFO L226 Difference]: Without dead ends: 2455 [2021-01-06 18:17:39,897 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 [2021-01-06 18:17:39,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2021-01-06 18:17:40,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2455. [2021-01-06 18:17:40,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2455 states. [2021-01-06 18:17:40,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2455 states to 2455 states and 4573 transitions. [2021-01-06 18:17:40,021 INFO L78 Accepts]: Start accepts. Automaton has 2455 states and 4573 transitions. Word has length 73 [2021-01-06 18:17:40,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:40,021 INFO L481 AbstractCegarLoop]: Abstraction has 2455 states and 4573 transitions. [2021-01-06 18:17:40,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:17:40,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 4573 transitions. [2021-01-06 18:17:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 18:17:40,026 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:40,027 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] [2021-01-06 18:17:40,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 18:17:40,027 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]=== [2021-01-06 18:17:40,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:40,028 INFO L82 PathProgramCache]: Analyzing trace with hash 131909968, now seen corresponding path program 1 times [2021-01-06 18:17:40,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:40,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161115969] [2021-01-06 18:17:40,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:40,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:40,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161115969] [2021-01-06 18:17:40,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:40,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:40,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343877448] [2021-01-06 18:17:40,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:40,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:40,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:40,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:40,115 INFO L87 Difference]: Start difference. First operand 2455 states and 4573 transitions. Second operand 5 states. [2021-01-06 18:17:40,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:40,368 INFO L93 Difference]: Finished difference Result 4843 states and 9058 transitions. [2021-01-06 18:17:40,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:40,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2021-01-06 18:17:40,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:40,377 INFO L225 Difference]: With dead ends: 4843 [2021-01-06 18:17:40,378 INFO L226 Difference]: Without dead ends: 2449 [2021-01-06 18:17:40,383 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 [2021-01-06 18:17:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2021-01-06 18:17:40,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 2449. [2021-01-06 18:17:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2449 states. [2021-01-06 18:17:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 4564 transitions. [2021-01-06 18:17:40,576 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 4564 transitions. Word has length 75 [2021-01-06 18:17:40,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:40,576 INFO L481 AbstractCegarLoop]: Abstraction has 2449 states and 4564 transitions. [2021-01-06 18:17:40,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:40,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 4564 transitions. [2021-01-06 18:17:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 18:17:40,580 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:40,581 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] [2021-01-06 18:17:40,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 18:17:40,581 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]=== [2021-01-06 18:17:40,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:40,582 INFO L82 PathProgramCache]: Analyzing trace with hash -125082160, now seen corresponding path program 1 times [2021-01-06 18:17:40,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:40,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562550696] [2021-01-06 18:17:40,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:40,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562550696] [2021-01-06 18:17:40,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:40,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:40,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584592936] [2021-01-06 18:17:40,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:40,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:40,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:40,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:40,701 INFO L87 Difference]: Start difference. First operand 2449 states and 4564 transitions. Second operand 4 states. [2021-01-06 18:17:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:40,919 INFO L93 Difference]: Finished difference Result 4837 states and 9049 transitions. [2021-01-06 18:17:40,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:17:40,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 18:17:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:40,929 INFO L225 Difference]: With dead ends: 4837 [2021-01-06 18:17:40,929 INFO L226 Difference]: Without dead ends: 2435 [2021-01-06 18:17:40,942 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 [2021-01-06 18:17:40,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2021-01-06 18:17:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2435. [2021-01-06 18:17:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2021-01-06 18:17:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 4543 transitions. [2021-01-06 18:17:41,084 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 4543 transitions. Word has length 75 [2021-01-06 18:17:41,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:41,086 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 4543 transitions. [2021-01-06 18:17:41,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:41,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 4543 transitions. [2021-01-06 18:17:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 18:17:41,089 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:41,089 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] [2021-01-06 18:17:41,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 18:17:41,090 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]=== [2021-01-06 18:17:41,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:41,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1734159741, now seen corresponding path program 1 times [2021-01-06 18:17:41,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:41,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138893854] [2021-01-06 18:17:41,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:41,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138893854] [2021-01-06 18:17:41,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:41,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:17:41,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118811417] [2021-01-06 18:17:41,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:17:41,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:41,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:17:41,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:17:41,216 INFO L87 Difference]: Start difference. First operand 2435 states and 4543 transitions. Second operand 6 states. [2021-01-06 18:17:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:41,567 INFO L93 Difference]: Finished difference Result 4837 states and 9044 transitions. [2021-01-06 18:17:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:17:41,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2021-01-06 18:17:41,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:41,576 INFO L225 Difference]: With dead ends: 4837 [2021-01-06 18:17:41,576 INFO L226 Difference]: Without dead ends: 2455 [2021-01-06 18:17:41,582 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 [2021-01-06 18:17:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2021-01-06 18:17:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2435. [2021-01-06 18:17:41,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2021-01-06 18:17:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 4542 transitions. [2021-01-06 18:17:41,745 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 4542 transitions. Word has length 76 [2021-01-06 18:17:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:41,746 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 4542 transitions. [2021-01-06 18:17:41,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:17:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 4542 transitions. [2021-01-06 18:17:41,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 18:17:41,749 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:41,749 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] [2021-01-06 18:17:41,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 18:17:41,749 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]=== [2021-01-06 18:17:41,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:41,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1619891255, now seen corresponding path program 1 times [2021-01-06 18:17:41,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:41,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021713204] [2021-01-06 18:17:41,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:41,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021713204] [2021-01-06 18:17:41,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:41,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:17:41,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664157364] [2021-01-06 18:17:41,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:17:41,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:41,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:17:41,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:17:41,854 INFO L87 Difference]: Start difference. First operand 2435 states and 4542 transitions. Second operand 6 states. [2021-01-06 18:17:42,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:42,132 INFO L93 Difference]: Finished difference Result 4827 states and 9025 transitions. [2021-01-06 18:17:42,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:17:42,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2021-01-06 18:17:42,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:42,140 INFO L225 Difference]: With dead ends: 4827 [2021-01-06 18:17:42,141 INFO L226 Difference]: Without dead ends: 2450 [2021-01-06 18:17:42,145 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 [2021-01-06 18:17:42,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2021-01-06 18:17:42,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2435. [2021-01-06 18:17:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2021-01-06 18:17:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 4541 transitions. [2021-01-06 18:17:42,285 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 4541 transitions. Word has length 77 [2021-01-06 18:17:42,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:42,285 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 4541 transitions. [2021-01-06 18:17:42,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:17:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 4541 transitions. [2021-01-06 18:17:42,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 18:17:42,288 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:42,288 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] [2021-01-06 18:17:42,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 18:17:42,289 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]=== [2021-01-06 18:17:42,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:42,289 INFO L82 PathProgramCache]: Analyzing trace with hash 390140520, now seen corresponding path program 1 times [2021-01-06 18:17:42,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:42,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417561459] [2021-01-06 18:17:42,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:42,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417561459] [2021-01-06 18:17:42,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:42,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:42,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279986532] [2021-01-06 18:17:42,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:42,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:42,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:42,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:42,412 INFO L87 Difference]: Start difference. First operand 2435 states and 4541 transitions. Second operand 4 states. [2021-01-06 18:17:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:43,801 INFO L93 Difference]: Finished difference Result 6711 states and 12600 transitions. [2021-01-06 18:17:43,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:17:43,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-06 18:17:43,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:43,813 INFO L225 Difference]: With dead ends: 6711 [2021-01-06 18:17:43,814 INFO L226 Difference]: Without dead ends: 4340 [2021-01-06 18:17:43,818 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 [2021-01-06 18:17:43,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4340 states. [2021-01-06 18:17:43,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4340 to 2435. [2021-01-06 18:17:43,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2021-01-06 18:17:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 4535 transitions. [2021-01-06 18:17:43,996 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 4535 transitions. Word has length 78 [2021-01-06 18:17:43,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:43,996 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 4535 transitions. [2021-01-06 18:17:43,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 4535 transitions. [2021-01-06 18:17:43,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 18:17:43,999 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:43,999 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] [2021-01-06 18:17:43,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 18:17:44,000 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]=== [2021-01-06 18:17:44,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:44,000 INFO L82 PathProgramCache]: Analyzing trace with hash -807776386, now seen corresponding path program 1 times [2021-01-06 18:17:44,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:44,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761379397] [2021-01-06 18:17:44,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:44,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761379397] [2021-01-06 18:17:44,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:44,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:44,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965889837] [2021-01-06 18:17:44,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:44,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:44,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:44,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:44,097 INFO L87 Difference]: Start difference. First operand 2435 states and 4535 transitions. Second operand 4 states. [2021-01-06 18:17:45,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:45,295 INFO L93 Difference]: Finished difference Result 6711 states and 12589 transitions. [2021-01-06 18:17:45,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:17:45,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2021-01-06 18:17:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:45,309 INFO L225 Difference]: With dead ends: 6711 [2021-01-06 18:17:45,309 INFO L226 Difference]: Without dead ends: 4340 [2021-01-06 18:17:45,314 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 [2021-01-06 18:17:45,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4340 states. [2021-01-06 18:17:45,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4340 to 2435. [2021-01-06 18:17:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2021-01-06 18:17:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 4529 transitions. [2021-01-06 18:17:45,479 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 4529 transitions. Word has length 80 [2021-01-06 18:17:45,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:45,479 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 4529 transitions. [2021-01-06 18:17:45,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:45,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 4529 transitions. [2021-01-06 18:17:45,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 18:17:45,525 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:45,525 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] [2021-01-06 18:17:45,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 18:17:45,525 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]=== [2021-01-06 18:17:45,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:45,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1964191138, now seen corresponding path program 1 times [2021-01-06 18:17:45,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:45,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578757159] [2021-01-06 18:17:45,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:45,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578757159] [2021-01-06 18:17:45,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:45,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:45,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565697450] [2021-01-06 18:17:45,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:45,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:45,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:45,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:45,645 INFO L87 Difference]: Start difference. First operand 2435 states and 4529 transitions. Second operand 4 states. [2021-01-06 18:17:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:46,783 INFO L93 Difference]: Finished difference Result 6711 states and 12578 transitions. [2021-01-06 18:17:46,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:17:46,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2021-01-06 18:17:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:46,799 INFO L225 Difference]: With dead ends: 6711 [2021-01-06 18:17:46,799 INFO L226 Difference]: Without dead ends: 4340 [2021-01-06 18:17:46,805 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 [2021-01-06 18:17:46,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4340 states. [2021-01-06 18:17:46,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4340 to 2435. [2021-01-06 18:17:46,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2021-01-06 18:17:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 4523 transitions. [2021-01-06 18:17:46,978 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 4523 transitions. Word has length 82 [2021-01-06 18:17:46,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:46,978 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 4523 transitions. [2021-01-06 18:17:46,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 4523 transitions. [2021-01-06 18:17:46,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 18:17:46,981 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:17:46,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 18:17:46,982 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]=== [2021-01-06 18:17:46,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:46,982 INFO L82 PathProgramCache]: Analyzing trace with hash 122558494, now seen corresponding path program 1 times [2021-01-06 18:17:46,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:46,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222410479] [2021-01-06 18:17:46,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:47,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:47,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222410479] [2021-01-06 18:17:47,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:47,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:47,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122319978] [2021-01-06 18:17:47,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:47,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:47,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:47,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:47,082 INFO L87 Difference]: Start difference. First operand 2435 states and 4523 transitions. Second operand 4 states. [2021-01-06 18:17:48,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:48,226 INFO L93 Difference]: Finished difference Result 6711 states and 12567 transitions. [2021-01-06 18:17:48,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:17:48,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2021-01-06 18:17:48,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:48,239 INFO L225 Difference]: With dead ends: 6711 [2021-01-06 18:17:48,239 INFO L226 Difference]: Without dead ends: 4340 [2021-01-06 18:17:48,243 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 [2021-01-06 18:17:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4340 states. [2021-01-06 18:17:48,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4340 to 2435. [2021-01-06 18:17:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2021-01-06 18:17:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 4517 transitions. [2021-01-06 18:17:48,414 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 4517 transitions. Word has length 84 [2021-01-06 18:17:48,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:48,414 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 4517 transitions. [2021-01-06 18:17:48,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 4517 transitions. [2021-01-06 18:17:48,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 18:17:48,418 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:48,418 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] [2021-01-06 18:17:48,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 18:17:48,418 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]=== [2021-01-06 18:17:48,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:48,419 INFO L82 PathProgramCache]: Analyzing trace with hash 681936084, now seen corresponding path program 1 times [2021-01-06 18:17:48,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:48,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073921384] [2021-01-06 18:17:48,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:48,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:48,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073921384] [2021-01-06 18:17:48,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:48,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:48,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19076704] [2021-01-06 18:17:48,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:17:48,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:48,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:17:48,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:17:48,502 INFO L87 Difference]: Start difference. First operand 2435 states and 4517 transitions. Second operand 6 states. [2021-01-06 18:17:52,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:52,050 INFO L93 Difference]: Finished difference Result 25957 states and 48532 transitions. [2021-01-06 18:17:52,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 18:17:52,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2021-01-06 18:17:52,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:52,113 INFO L225 Difference]: With dead ends: 25957 [2021-01-06 18:17:52,114 INFO L226 Difference]: Without dead ends: 23604 [2021-01-06 18:17:52,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-01-06 18:17:52,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23604 states. [2021-01-06 18:17:52,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23604 to 4794. [2021-01-06 18:17:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4794 states. [2021-01-06 18:17:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4794 states to 4794 states and 8922 transitions. [2021-01-06 18:17:52,584 INFO L78 Accepts]: Start accepts. Automaton has 4794 states and 8922 transitions. Word has length 86 [2021-01-06 18:17:52,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:52,584 INFO L481 AbstractCegarLoop]: Abstraction has 4794 states and 8922 transitions. [2021-01-06 18:17:52,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:17:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 4794 states and 8922 transitions. [2021-01-06 18:17:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 18:17:52,590 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:52,590 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] [2021-01-06 18:17:52,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 18:17:52,591 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]=== [2021-01-06 18:17:52,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:52,596 INFO L82 PathProgramCache]: Analyzing trace with hash -694497868, now seen corresponding path program 1 times [2021-01-06 18:17:52,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:52,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558312370] [2021-01-06 18:17:52,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:52,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:52,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558312370] [2021-01-06 18:17:52,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:52,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:52,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898153362] [2021-01-06 18:17:52,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:52,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:52,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:52,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:52,677 INFO L87 Difference]: Start difference. First operand 4794 states and 8922 transitions. Second operand 5 states. [2021-01-06 18:17:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:55,109 INFO L93 Difference]: Finished difference Result 19079 states and 35565 transitions. [2021-01-06 18:17:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:17:55,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2021-01-06 18:17:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:55,133 INFO L225 Difference]: With dead ends: 19079 [2021-01-06 18:17:55,134 INFO L226 Difference]: Without dead ends: 14433 [2021-01-06 18:17:55,142 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 [2021-01-06 18:17:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14433 states. [2021-01-06 18:17:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14433 to 4806. [2021-01-06 18:17:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4806 states. [2021-01-06 18:17:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4806 states to 4806 states and 8934 transitions. [2021-01-06 18:17:55,597 INFO L78 Accepts]: Start accepts. Automaton has 4806 states and 8934 transitions. Word has length 88 [2021-01-06 18:17:55,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:55,598 INFO L481 AbstractCegarLoop]: Abstraction has 4806 states and 8934 transitions. [2021-01-06 18:17:55,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 4806 states and 8934 transitions. [2021-01-06 18:17:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 18:17:55,602 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:55,602 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] [2021-01-06 18:17:55,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 18:17:55,603 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]=== [2021-01-06 18:17:55,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:55,603 INFO L82 PathProgramCache]: Analyzing trace with hash 168577519, now seen corresponding path program 1 times [2021-01-06 18:17:55,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:55,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735788270] [2021-01-06 18:17:55,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:55,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735788270] [2021-01-06 18:17:55,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:55,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:55,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129425787] [2021-01-06 18:17:55,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:55,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:55,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:55,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:55,676 INFO L87 Difference]: Start difference. First operand 4806 states and 8934 transitions. Second operand 5 states. [2021-01-06 18:17:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:56,083 INFO L93 Difference]: Finished difference Result 9544 states and 17777 transitions. [2021-01-06 18:17:56,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 18:17:56,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2021-01-06 18:17:56,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:56,094 INFO L225 Difference]: With dead ends: 9544 [2021-01-06 18:17:56,095 INFO L226 Difference]: Without dead ends: 4817 [2021-01-06 18:17:56,102 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 [2021-01-06 18:17:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4817 states. [2021-01-06 18:17:56,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4817 to 4802. [2021-01-06 18:17:56,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4802 states. [2021-01-06 18:17:56,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 8924 transitions. [2021-01-06 18:17:56,528 INFO L78 Accepts]: Start accepts. Automaton has 4802 states and 8924 transitions. Word has length 88 [2021-01-06 18:17:56,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:56,528 INFO L481 AbstractCegarLoop]: Abstraction has 4802 states and 8924 transitions. [2021-01-06 18:17:56,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:56,528 INFO L276 IsEmpty]: Start isEmpty. Operand 4802 states and 8924 transitions. [2021-01-06 18:17:56,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 18:17:56,532 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:56,532 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] [2021-01-06 18:17:56,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 18:17:56,533 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]=== [2021-01-06 18:17:56,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:56,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2143426133, now seen corresponding path program 1 times [2021-01-06 18:17:56,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:56,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583836385] [2021-01-06 18:17:56,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:56,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583836385] [2021-01-06 18:17:56,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:56,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:56,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736206930] [2021-01-06 18:17:56,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:56,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:56,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:56,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:56,605 INFO L87 Difference]: Start difference. First operand 4802 states and 8924 transitions. Second operand 4 states. [2021-01-06 18:17:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:58,894 INFO L93 Difference]: Finished difference Result 16620 states and 30995 transitions. [2021-01-06 18:17:58,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:58,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2021-01-06 18:17:58,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:58,911 INFO L225 Difference]: With dead ends: 16620 [2021-01-06 18:17:58,911 INFO L226 Difference]: Without dead ends: 11923 [2021-01-06 18:17:58,919 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 [2021-01-06 18:17:58,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11923 states. [2021-01-06 18:17:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11923 to 6588. [2021-01-06 18:17:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6588 states. [2021-01-06 18:17:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6588 states to 6588 states and 12110 transitions. [2021-01-06 18:17:59,437 INFO L78 Accepts]: Start accepts. Automaton has 6588 states and 12110 transitions. Word has length 89 [2021-01-06 18:17:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:59,437 INFO L481 AbstractCegarLoop]: Abstraction has 6588 states and 12110 transitions. [2021-01-06 18:17:59,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 6588 states and 12110 transitions. [2021-01-06 18:17:59,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 18:17:59,441 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:59,441 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] [2021-01-06 18:17:59,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 18:17:59,441 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]=== [2021-01-06 18:17:59,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:59,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1484543239, now seen corresponding path program 1 times [2021-01-06 18:17:59,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:59,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824214310] [2021-01-06 18:17:59,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:59,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:17:59,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824214310] [2021-01-06 18:17:59,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:59,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:59,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586482160] [2021-01-06 18:17:59,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:59,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:59,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:59,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:59,510 INFO L87 Difference]: Start difference. First operand 6588 states and 12110 transitions. Second operand 5 states. [2021-01-06 18:17:59,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:59,780 INFO L93 Difference]: Finished difference Result 9846 states and 18109 transitions. [2021-01-06 18:17:59,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 18:17:59,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2021-01-06 18:17:59,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:59,784 INFO L225 Difference]: With dead ends: 9846 [2021-01-06 18:17:59,785 INFO L226 Difference]: Without dead ends: 3288 [2021-01-06 18:17:59,790 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 [2021-01-06 18:17:59,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2021-01-06 18:18:00,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3288. [2021-01-06 18:18:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3288 states. [2021-01-06 18:18:00,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 6034 transitions. [2021-01-06 18:18:00,025 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 6034 transitions. Word has length 89 [2021-01-06 18:18:00,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:00,025 INFO L481 AbstractCegarLoop]: Abstraction has 3288 states and 6034 transitions. [2021-01-06 18:18:00,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:18:00,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 6034 transitions. [2021-01-06 18:18:00,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 18:18:00,027 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:00,028 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] [2021-01-06 18:18:00,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 18:18:00,028 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]=== [2021-01-06 18:18:00,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:00,028 INFO L82 PathProgramCache]: Analyzing trace with hash -820203489, now seen corresponding path program 1 times [2021-01-06 18:18:00,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:00,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799442269] [2021-01-06 18:18:00,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:00,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799442269] [2021-01-06 18:18:00,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:00,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:18:00,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848335080] [2021-01-06 18:18:00,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:18:00,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:00,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:18:00,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:18:00,114 INFO L87 Difference]: Start difference. First operand 3288 states and 6034 transitions. Second operand 5 states. [2021-01-06 18:18:01,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:01,396 INFO L93 Difference]: Finished difference Result 23556 states and 43568 transitions. [2021-01-06 18:18:01,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:18:01,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2021-01-06 18:18:01,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:01,420 INFO L225 Difference]: With dead ends: 23556 [2021-01-06 18:18:01,420 INFO L226 Difference]: Without dead ends: 20340 [2021-01-06 18:18:01,426 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 [2021-01-06 18:18:01,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20340 states. [2021-01-06 18:18:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20340 to 6025. [2021-01-06 18:18:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6025 states. [2021-01-06 18:18:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6025 states to 6025 states and 11122 transitions. [2021-01-06 18:18:01,861 INFO L78 Accepts]: Start accepts. Automaton has 6025 states and 11122 transitions. Word has length 91 [2021-01-06 18:18:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:01,861 INFO L481 AbstractCegarLoop]: Abstraction has 6025 states and 11122 transitions. [2021-01-06 18:18:01,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:18:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 6025 states and 11122 transitions. [2021-01-06 18:18:01,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 18:18:01,864 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:01,864 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] [2021-01-06 18:18:01,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 18:18:01,864 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]=== [2021-01-06 18:18:01,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:01,865 INFO L82 PathProgramCache]: Analyzing trace with hash -545443875, now seen corresponding path program 1 times [2021-01-06 18:18:01,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:01,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425040982] [2021-01-06 18:18:01,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:01,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425040982] [2021-01-06 18:18:01,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:01,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 18:18:01,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927705471] [2021-01-06 18:18:01,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:18:01,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:01,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:18:01,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:18:01,937 INFO L87 Difference]: Start difference. First operand 6025 states and 11122 transitions. Second operand 3 states. [2021-01-06 18:18:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:02,785 INFO L93 Difference]: Finished difference Result 11018 states and 20306 transitions. [2021-01-06 18:18:02,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:18:02,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2021-01-06 18:18:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:02,799 INFO L225 Difference]: With dead ends: 11018 [2021-01-06 18:18:02,799 INFO L226 Difference]: Without dead ends: 8506 [2021-01-06 18:18:02,803 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 [2021-01-06 18:18:02,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8506 states. [2021-01-06 18:18:03,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8506 to 8479. [2021-01-06 18:18:03,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8479 states. [2021-01-06 18:18:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8479 states to 8479 states and 15642 transitions. [2021-01-06 18:18:03,340 INFO L78 Accepts]: Start accepts. Automaton has 8479 states and 15642 transitions. Word has length 91 [2021-01-06 18:18:03,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:03,340 INFO L481 AbstractCegarLoop]: Abstraction has 8479 states and 15642 transitions. [2021-01-06 18:18:03,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:18:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 8479 states and 15642 transitions. [2021-01-06 18:18:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 18:18:03,343 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:03,343 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] [2021-01-06 18:18:03,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 18:18:03,343 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]=== [2021-01-06 18:18:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:03,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1638922468, now seen corresponding path program 1 times [2021-01-06 18:18:03,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:03,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750250518] [2021-01-06 18:18:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:03,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:03,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750250518] [2021-01-06 18:18:03,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:03,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:18:03,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841546427] [2021-01-06 18:18:03,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:18:03,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:03,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:18:03,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:18:03,416 INFO L87 Difference]: Start difference. First operand 8479 states and 15642 transitions. Second operand 5 states. [2021-01-06 18:18:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:04,340 INFO L93 Difference]: Finished difference Result 13440 states and 24760 transitions. [2021-01-06 18:18:04,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:18:04,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2021-01-06 18:18:04,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:04,352 INFO L225 Difference]: With dead ends: 13440 [2021-01-06 18:18:04,353 INFO L226 Difference]: Without dead ends: 8502 [2021-01-06 18:18:04,358 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:18:04,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8502 states. [2021-01-06 18:18:04,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8502 to 8479. [2021-01-06 18:18:04,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8479 states. [2021-01-06 18:18:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8479 states to 8479 states and 15625 transitions. [2021-01-06 18:18:04,905 INFO L78 Accepts]: Start accepts. Automaton has 8479 states and 15625 transitions. Word has length 92 [2021-01-06 18:18:04,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:04,905 INFO L481 AbstractCegarLoop]: Abstraction has 8479 states and 15625 transitions. [2021-01-06 18:18:04,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:18:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 8479 states and 15625 transitions. [2021-01-06 18:18:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 18:18:04,907 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:04,908 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] [2021-01-06 18:18:04,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 18:18:04,908 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]=== [2021-01-06 18:18:04,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:04,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1052116454, now seen corresponding path program 1 times [2021-01-06 18:18:04,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:04,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067684538] [2021-01-06 18:18:04,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:04,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:04,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067684538] [2021-01-06 18:18:04,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:04,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:18:04,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018432765] [2021-01-06 18:18:04,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:18:04,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:04,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:18:04,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:18:04,981 INFO L87 Difference]: Start difference. First operand 8479 states and 15625 transitions. Second operand 3 states. [2021-01-06 18:18:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:05,398 INFO L93 Difference]: Finished difference Result 15324 states and 28251 transitions. [2021-01-06 18:18:05,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:18:05,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2021-01-06 18:18:05,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:05,409 INFO L225 Difference]: With dead ends: 15324 [2021-01-06 18:18:05,409 INFO L226 Difference]: Without dead ends: 8457 [2021-01-06 18:18:05,416 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 [2021-01-06 18:18:05,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8457 states. [2021-01-06 18:18:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8457 to 8457. [2021-01-06 18:18:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8457 states. [2021-01-06 18:18:06,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8457 states to 8457 states and 15583 transitions. [2021-01-06 18:18:06,019 INFO L78 Accepts]: Start accepts. Automaton has 8457 states and 15583 transitions. Word has length 92 [2021-01-06 18:18:06,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:06,020 INFO L481 AbstractCegarLoop]: Abstraction has 8457 states and 15583 transitions. [2021-01-06 18:18:06,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:18:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand 8457 states and 15583 transitions. [2021-01-06 18:18:06,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 18:18:06,025 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:06,025 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] [2021-01-06 18:18:06,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 18:18:06,025 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]=== [2021-01-06 18:18:06,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:06,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1416599279, now seen corresponding path program 1 times [2021-01-06 18:18:06,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:06,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889512904] [2021-01-06 18:18:06,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:06,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889512904] [2021-01-06 18:18:06,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:06,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:18:06,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998000320] [2021-01-06 18:18:06,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:18:06,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:06,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:18:06,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:18:06,125 INFO L87 Difference]: Start difference. First operand 8457 states and 15583 transitions. Second operand 6 states. [2021-01-06 18:18:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:09,000 INFO L93 Difference]: Finished difference Result 24128 states and 44214 transitions. [2021-01-06 18:18:09,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 18:18:09,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2021-01-06 18:18:09,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:09,029 INFO L225 Difference]: With dead ends: 24128 [2021-01-06 18:18:09,030 INFO L226 Difference]: Without dead ends: 17287 [2021-01-06 18:18:09,045 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-06 18:18:09,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17287 states. [2021-01-06 18:18:09,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17287 to 10217. [2021-01-06 18:18:09,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10217 states. [2021-01-06 18:18:09,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10217 states to 10217 states and 18867 transitions. [2021-01-06 18:18:09,756 INFO L78 Accepts]: Start accepts. Automaton has 10217 states and 18867 transitions. Word has length 94 [2021-01-06 18:18:09,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:09,756 INFO L481 AbstractCegarLoop]: Abstraction has 10217 states and 18867 transitions. [2021-01-06 18:18:09,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:18:09,756 INFO L276 IsEmpty]: Start isEmpty. Operand 10217 states and 18867 transitions. [2021-01-06 18:18:09,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 18:18:09,758 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:09,759 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] [2021-01-06 18:18:09,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 18:18:09,759 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]=== [2021-01-06 18:18:09,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:09,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1731906929, now seen corresponding path program 1 times [2021-01-06 18:18:09,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:09,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863912494] [2021-01-06 18:18:09,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:09,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863912494] [2021-01-06 18:18:09,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:09,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:18:09,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837178401] [2021-01-06 18:18:09,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:18:09,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:09,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:18:09,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:18:09,919 INFO L87 Difference]: Start difference. First operand 10217 states and 18867 transitions. Second operand 5 states. [2021-01-06 18:18:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:10,729 INFO L93 Difference]: Finished difference Result 15881 states and 29332 transitions. [2021-01-06 18:18:10,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:18:10,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2021-01-06 18:18:10,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:10,755 INFO L225 Difference]: With dead ends: 15881 [2021-01-06 18:18:10,755 INFO L226 Difference]: Without dead ends: 15868 [2021-01-06 18:18:10,759 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 [2021-01-06 18:18:10,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15868 states. [2021-01-06 18:18:11,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15868 to 10229. [2021-01-06 18:18:11,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2021-01-06 18:18:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 18879 transitions. [2021-01-06 18:18:11,391 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 18879 transitions. Word has length 94 [2021-01-06 18:18:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:11,392 INFO L481 AbstractCegarLoop]: Abstraction has 10229 states and 18879 transitions. [2021-01-06 18:18:11,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:18:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 18879 transitions. [2021-01-06 18:18:11,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 18:18:11,394 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:11,394 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] [2021-01-06 18:18:11,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 18:18:11,394 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]=== [2021-01-06 18:18:11,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:11,395 INFO L82 PathProgramCache]: Analyzing trace with hash 603738836, now seen corresponding path program 1 times [2021-01-06 18:18:11,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:11,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290815058] [2021-01-06 18:18:11,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:11,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290815058] [2021-01-06 18:18:11,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:11,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:18:11,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586142553] [2021-01-06 18:18:11,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:18:11,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:11,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:18:11,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:18:11,523 INFO L87 Difference]: Start difference. First operand 10229 states and 18879 transitions. Second operand 6 states. [2021-01-06 18:18:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:12,254 INFO L93 Difference]: Finished difference Result 10246 states and 18895 transitions. [2021-01-06 18:18:12,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:18:12,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2021-01-06 18:18:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:12,267 INFO L225 Difference]: With dead ends: 10246 [2021-01-06 18:18:12,268 INFO L226 Difference]: Without dead ends: 10233 [2021-01-06 18:18:12,271 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 18:18:12,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10233 states. [2021-01-06 18:18:12,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10233 to 10229. [2021-01-06 18:18:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2021-01-06 18:18:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 18871 transitions. [2021-01-06 18:18:13,004 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 18871 transitions. Word has length 96 [2021-01-06 18:18:13,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:13,005 INFO L481 AbstractCegarLoop]: Abstraction has 10229 states and 18871 transitions. [2021-01-06 18:18:13,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:18:13,005 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 18871 transitions. [2021-01-06 18:18:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-01-06 18:18:13,007 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:13,007 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] [2021-01-06 18:18:13,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 18:18:13,008 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]=== [2021-01-06 18:18:13,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:13,008 INFO L82 PathProgramCache]: Analyzing trace with hash 228968715, now seen corresponding path program 1 times [2021-01-06 18:18:13,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:13,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958085392] [2021-01-06 18:18:13,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:13,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958085392] [2021-01-06 18:18:13,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:13,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:18:13,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565948399] [2021-01-06 18:18:13,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:18:13,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:13,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:18:13,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:18:13,119 INFO L87 Difference]: Start difference. First operand 10229 states and 18871 transitions. Second operand 5 states. [2021-01-06 18:18:14,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:14,667 INFO L93 Difference]: Finished difference Result 25034 states and 46151 transitions. [2021-01-06 18:18:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:18:14,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2021-01-06 18:18:14,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:14,688 INFO L225 Difference]: With dead ends: 25034 [2021-01-06 18:18:14,688 INFO L226 Difference]: Without dead ends: 16489 [2021-01-06 18:18:14,698 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 [2021-01-06 18:18:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16489 states. [2021-01-06 18:18:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16489 to 10229. [2021-01-06 18:18:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2021-01-06 18:18:15,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 18863 transitions. [2021-01-06 18:18:15,362 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 18863 transitions. Word has length 103 [2021-01-06 18:18:15,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:15,363 INFO L481 AbstractCegarLoop]: Abstraction has 10229 states and 18863 transitions. [2021-01-06 18:18:15,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:18:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 18863 transitions. [2021-01-06 18:18:15,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-06 18:18:15,366 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:15,366 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] [2021-01-06 18:18:15,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 18:18:15,366 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]=== [2021-01-06 18:18:15,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:15,367 INFO L82 PathProgramCache]: Analyzing trace with hash 835179443, now seen corresponding path program 1 times [2021-01-06 18:18:15,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:15,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521755666] [2021-01-06 18:18:15,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:15,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521755666] [2021-01-06 18:18:15,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:15,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:18:15,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220922924] [2021-01-06 18:18:15,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:18:15,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:15,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:18:15,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:18:15,454 INFO L87 Difference]: Start difference. First operand 10229 states and 18863 transitions. Second operand 5 states. [2021-01-06 18:18:16,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:16,961 INFO L93 Difference]: Finished difference Result 24447 states and 45280 transitions. [2021-01-06 18:18:16,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:18:16,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2021-01-06 18:18:16,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:16,984 INFO L225 Difference]: With dead ends: 24447 [2021-01-06 18:18:16,985 INFO L226 Difference]: Without dead ends: 15726 [2021-01-06 18:18:16,993 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:18:17,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15726 states. [2021-01-06 18:18:17,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15726 to 10229. [2021-01-06 18:18:17,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2021-01-06 18:18:17,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 18751 transitions. [2021-01-06 18:18:17,618 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 18751 transitions. Word has length 107 [2021-01-06 18:18:17,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:17,618 INFO L481 AbstractCegarLoop]: Abstraction has 10229 states and 18751 transitions. [2021-01-06 18:18:17,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:18:17,618 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 18751 transitions. [2021-01-06 18:18:17,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-01-06 18:18:17,621 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:17,621 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] [2021-01-06 18:18:17,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 18:18:17,621 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]=== [2021-01-06 18:18:17,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:17,622 INFO L82 PathProgramCache]: Analyzing trace with hash -575663173, now seen corresponding path program 1 times [2021-01-06 18:18:17,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:17,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471006566] [2021-01-06 18:18:17,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:17,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:17,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471006566] [2021-01-06 18:18:17,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:17,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:18:17,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628439685] [2021-01-06 18:18:17,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:18:17,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:17,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:18:17,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:18:17,763 INFO L87 Difference]: Start difference. First operand 10229 states and 18751 transitions. Second operand 6 states. [2021-01-06 18:18:19,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:19,483 INFO L93 Difference]: Finished difference Result 23088 states and 42357 transitions. [2021-01-06 18:18:19,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 18:18:19,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2021-01-06 18:18:19,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:19,503 INFO L225 Difference]: With dead ends: 23088 [2021-01-06 18:18:19,504 INFO L226 Difference]: Without dead ends: 16272 [2021-01-06 18:18:19,510 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 [2021-01-06 18:18:19,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16272 states. [2021-01-06 18:18:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16272 to 10213. [2021-01-06 18:18:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10213 states. [2021-01-06 18:18:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10213 states to 10213 states and 18719 transitions. [2021-01-06 18:18:20,117 INFO L78 Accepts]: Start accepts. Automaton has 10213 states and 18719 transitions. Word has length 108 [2021-01-06 18:18:20,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:20,117 INFO L481 AbstractCegarLoop]: Abstraction has 10213 states and 18719 transitions. [2021-01-06 18:18:20,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:18:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 10213 states and 18719 transitions. [2021-01-06 18:18:20,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-01-06 18:18:20,120 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:20,120 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] [2021-01-06 18:18:20,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 18:18:20,120 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]=== [2021-01-06 18:18:20,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:20,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1342586293, now seen corresponding path program 1 times [2021-01-06 18:18:20,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:20,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333988712] [2021-01-06 18:18:20,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:20,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333988712] [2021-01-06 18:18:20,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:20,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:18:20,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779242551] [2021-01-06 18:18:20,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:18:20,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:20,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:18:20,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:18:20,208 INFO L87 Difference]: Start difference. First operand 10213 states and 18719 transitions. Second operand 5 states. [2021-01-06 18:18:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:21,680 INFO L93 Difference]: Finished difference Result 27775 states and 51070 transitions. [2021-01-06 18:18:21,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 18:18:21,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2021-01-06 18:18:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:21,706 INFO L225 Difference]: With dead ends: 27775 [2021-01-06 18:18:21,706 INFO L226 Difference]: Without dead ends: 20971 [2021-01-06 18:18:21,715 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 [2021-01-06 18:18:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20971 states. [2021-01-06 18:18:22,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20971 to 10096. [2021-01-06 18:18:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10096 states. [2021-01-06 18:18:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10096 states to 10096 states and 18504 transitions. [2021-01-06 18:18:22,468 INFO L78 Accepts]: Start accepts. Automaton has 10096 states and 18504 transitions. Word has length 110 [2021-01-06 18:18:22,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:22,468 INFO L481 AbstractCegarLoop]: Abstraction has 10096 states and 18504 transitions. [2021-01-06 18:18:22,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:18:22,468 INFO L276 IsEmpty]: Start isEmpty. Operand 10096 states and 18504 transitions. [2021-01-06 18:18:22,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-01-06 18:18:22,471 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:22,471 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] [2021-01-06 18:18:22,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 18:18:22,471 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]=== [2021-01-06 18:18:22,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:22,472 INFO L82 PathProgramCache]: Analyzing trace with hash -354058162, now seen corresponding path program 1 times [2021-01-06 18:18:22,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:22,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708609786] [2021-01-06 18:18:22,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:22,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708609786] [2021-01-06 18:18:22,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:22,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:18:22,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906892209] [2021-01-06 18:18:22,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:18:22,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:22,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:18:22,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:18:22,584 INFO L87 Difference]: Start difference. First operand 10096 states and 18504 transitions. Second operand 5 states. [2021-01-06 18:18:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:23,863 INFO L93 Difference]: Finished difference Result 22776 states and 41589 transitions. [2021-01-06 18:18:23,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 18:18:23,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2021-01-06 18:18:23,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:23,883 INFO L225 Difference]: With dead ends: 22776 [2021-01-06 18:18:23,884 INFO L226 Difference]: Without dead ends: 16306 [2021-01-06 18:18:23,891 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 [2021-01-06 18:18:23,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16306 states. [2021-01-06 18:18:24,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16306 to 10113. [2021-01-06 18:18:24,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10113 states. [2021-01-06 18:18:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10113 states to 10113 states and 18519 transitions. [2021-01-06 18:18:24,742 INFO L78 Accepts]: Start accepts. Automaton has 10113 states and 18519 transitions. Word has length 111 [2021-01-06 18:18:24,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:24,743 INFO L481 AbstractCegarLoop]: Abstraction has 10113 states and 18519 transitions. [2021-01-06 18:18:24,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:18:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 10113 states and 18519 transitions. [2021-01-06 18:18:24,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 18:18:24,745 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:24,745 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] [2021-01-06 18:18:24,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 18:18:24,746 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]=== [2021-01-06 18:18:24,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:24,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1941695361, now seen corresponding path program 1 times [2021-01-06 18:18:24,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:24,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400943027] [2021-01-06 18:18:24,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:24,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400943027] [2021-01-06 18:18:24,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:24,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:18:24,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262036460] [2021-01-06 18:18:24,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:18:24,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:24,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:18:24,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:18:24,843 INFO L87 Difference]: Start difference. First operand 10113 states and 18519 transitions. Second operand 6 states. [2021-01-06 18:18:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:25,575 INFO L93 Difference]: Finished difference Result 16947 states and 30939 transitions. [2021-01-06 18:18:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:18:25,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2021-01-06 18:18:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:25,589 INFO L225 Difference]: With dead ends: 16947 [2021-01-06 18:18:25,590 INFO L226 Difference]: Without dead ends: 10126 [2021-01-06 18:18:25,597 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 18:18:25,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10126 states. [2021-01-06 18:18:26,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10126 to 10113. [2021-01-06 18:18:26,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10113 states. [2021-01-06 18:18:26,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10113 states to 10113 states and 18417 transitions. [2021-01-06 18:18:26,292 INFO L78 Accepts]: Start accepts. Automaton has 10113 states and 18417 transitions. Word has length 118 [2021-01-06 18:18:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:26,292 INFO L481 AbstractCegarLoop]: Abstraction has 10113 states and 18417 transitions. [2021-01-06 18:18:26,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:18:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 10113 states and 18417 transitions. [2021-01-06 18:18:26,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-01-06 18:18:26,294 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:26,295 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, 1] [2021-01-06 18:18:26,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 18:18:26,295 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]=== [2021-01-06 18:18:26,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:26,295 INFO L82 PathProgramCache]: Analyzing trace with hash -108167085, now seen corresponding path program 1 times [2021-01-06 18:18:26,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:26,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224505534] [2021-01-06 18:18:26,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:26,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224505534] [2021-01-06 18:18:26,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:26,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:18:26,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359854416] [2021-01-06 18:18:26,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 18:18:26,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:26,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 18:18:26,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:18:26,445 INFO L87 Difference]: Start difference. First operand 10113 states and 18417 transitions. Second operand 7 states. [2021-01-06 18:18:31,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:31,308 INFO L93 Difference]: Finished difference Result 32197 states and 58499 transitions. [2021-01-06 18:18:31,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 18:18:31,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2021-01-06 18:18:31,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:31,346 INFO L225 Difference]: With dead ends: 32197 [2021-01-06 18:18:31,346 INFO L226 Difference]: Without dead ends: 25752 [2021-01-06 18:18:31,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2021-01-06 18:18:31,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25752 states. [2021-01-06 18:18:32,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25752 to 10569. [2021-01-06 18:18:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10569 states. [2021-01-06 18:18:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10569 states to 10569 states and 19169 transitions. [2021-01-06 18:18:32,263 INFO L78 Accepts]: Start accepts. Automaton has 10569 states and 19169 transitions. Word has length 119 [2021-01-06 18:18:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:32,263 INFO L481 AbstractCegarLoop]: Abstraction has 10569 states and 19169 transitions. [2021-01-06 18:18:32,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 18:18:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 10569 states and 19169 transitions. [2021-01-06 18:18:32,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-01-06 18:18:32,265 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:32,266 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, 1] [2021-01-06 18:18:32,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 18:18:32,266 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]=== [2021-01-06 18:18:32,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:32,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1705490833, now seen corresponding path program 1 times [2021-01-06 18:18:32,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:32,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444208962] [2021-01-06 18:18:32,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:32,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444208962] [2021-01-06 18:18:32,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:32,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:18:32,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319025640] [2021-01-06 18:18:32,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:18:32,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:32,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:18:32,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:18:32,349 INFO L87 Difference]: Start difference. First operand 10569 states and 19169 transitions. Second operand 5 states. [2021-01-06 18:18:35,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:35,820 INFO L93 Difference]: Finished difference Result 44322 states and 78967 transitions. [2021-01-06 18:18:35,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:18:35,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2021-01-06 18:18:35,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:35,865 INFO L225 Difference]: With dead ends: 44322 [2021-01-06 18:18:35,865 INFO L226 Difference]: Without dead ends: 37417 [2021-01-06 18:18:35,875 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 [2021-01-06 18:18:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37417 states. [2021-01-06 18:18:37,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37417 to 13114. [2021-01-06 18:18:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13114 states. [2021-01-06 18:18:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13114 states to 13114 states and 23163 transitions. [2021-01-06 18:18:37,086 INFO L78 Accepts]: Start accepts. Automaton has 13114 states and 23163 transitions. Word has length 119 [2021-01-06 18:18:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:37,087 INFO L481 AbstractCegarLoop]: Abstraction has 13114 states and 23163 transitions. [2021-01-06 18:18:37,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:18:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 13114 states and 23163 transitions. [2021-01-06 18:18:37,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-01-06 18:18:37,090 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:37,090 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, 1] [2021-01-06 18:18:37,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 18:18:37,091 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]=== [2021-01-06 18:18:37,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:37,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1471738225, now seen corresponding path program 1 times [2021-01-06 18:18:37,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:37,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380031765] [2021-01-06 18:18:37,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:37,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380031765] [2021-01-06 18:18:37,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:37,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 18:18:37,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849169632] [2021-01-06 18:18:37,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 18:18:37,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:37,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 18:18:37,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:18:37,229 INFO L87 Difference]: Start difference. First operand 13114 states and 23163 transitions. Second operand 7 states. [2021-01-06 18:18:39,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:39,559 INFO L93 Difference]: Finished difference Result 21160 states and 37609 transitions. [2021-01-06 18:18:39,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:18:39,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2021-01-06 18:18:39,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:39,587 INFO L225 Difference]: With dead ends: 21160 [2021-01-06 18:18:39,587 INFO L226 Difference]: Without dead ends: 21147 [2021-01-06 18:18:39,593 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-01-06 18:18:39,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21147 states. [2021-01-06 18:18:40,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21147 to 13135. [2021-01-06 18:18:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13135 states. [2021-01-06 18:18:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13135 states to 13135 states and 23177 transitions. [2021-01-06 18:18:40,885 INFO L78 Accepts]: Start accepts. Automaton has 13135 states and 23177 transitions. Word has length 119 [2021-01-06 18:18:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:40,885 INFO L481 AbstractCegarLoop]: Abstraction has 13135 states and 23177 transitions. [2021-01-06 18:18:40,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 18:18:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 13135 states and 23177 transitions. [2021-01-06 18:18:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-01-06 18:18:40,888 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:40,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:18:40,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 18:18:40,889 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]=== [2021-01-06 18:18:40,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:40,889 INFO L82 PathProgramCache]: Analyzing trace with hash -536210861, now seen corresponding path program 1 times [2021-01-06 18:18:40,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:40,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321268601] [2021-01-06 18:18:40,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:40,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:40,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321268601] [2021-01-06 18:18:40,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:40,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 18:18:40,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010034439] [2021-01-06 18:18:40,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 18:18:40,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:40,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 18:18:40,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:18:40,997 INFO L87 Difference]: Start difference. First operand 13135 states and 23177 transitions. Second operand 7 states. [2021-01-06 18:18:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:47,067 INFO L93 Difference]: Finished difference Result 72622 states and 130146 transitions. [2021-01-06 18:18:47,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 18:18:47,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 135 [2021-01-06 18:18:47,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:47,147 INFO L225 Difference]: With dead ends: 72622 [2021-01-06 18:18:47,148 INFO L226 Difference]: Without dead ends: 61322 [2021-01-06 18:18:47,162 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-01-06 18:18:47,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61322 states. [2021-01-06 18:18:50,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61322 to 25625. [2021-01-06 18:18:50,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25625 states. [2021-01-06 18:18:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25625 states to 25625 states and 45338 transitions. [2021-01-06 18:18:50,092 INFO L78 Accepts]: Start accepts. Automaton has 25625 states and 45338 transitions. Word has length 135 [2021-01-06 18:18:50,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:50,093 INFO L481 AbstractCegarLoop]: Abstraction has 25625 states and 45338 transitions. [2021-01-06 18:18:50,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 18:18:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 25625 states and 45338 transitions. [2021-01-06 18:18:50,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-01-06 18:18:50,098 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:50,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:18:50,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 18:18:50,098 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:18:50,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:50,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1491540264, now seen corresponding path program 1 times [2021-01-06 18:18:50,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:50,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669157615] [2021-01-06 18:18:50,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:50,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669157615] [2021-01-06 18:18:50,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:50,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:18:50,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235852987] [2021-01-06 18:18:50,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:18:50,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:50,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:18:50,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:18:50,168 INFO L87 Difference]: Start difference. First operand 25625 states and 45338 transitions. Second operand 3 states. [2021-01-06 18:18:54,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:54,647 INFO L93 Difference]: Finished difference Result 61804 states and 109389 transitions. [2021-01-06 18:18:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:18:54,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2021-01-06 18:18:54,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:54,704 INFO L225 Difference]: With dead ends: 61804 [2021-01-06 18:18:54,704 INFO L226 Difference]: Without dead ends: 38889 [2021-01-06 18:18:54,725 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 [2021-01-06 18:18:54,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38889 states. [2021-01-06 18:18:57,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38889 to 25049. [2021-01-06 18:18:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25049 states. [2021-01-06 18:18:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25049 states to 25049 states and 44127 transitions. [2021-01-06 18:18:57,419 INFO L78 Accepts]: Start accepts. Automaton has 25049 states and 44127 transitions. Word has length 136 [2021-01-06 18:18:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:57,424 INFO L481 AbstractCegarLoop]: Abstraction has 25049 states and 44127 transitions. [2021-01-06 18:18:57,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:18:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand 25049 states and 44127 transitions. [2021-01-06 18:18:57,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-01-06 18:18:57,431 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:57,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:18:57,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-01-06 18:18:57,431 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:18:57,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:57,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1135670072, now seen corresponding path program 1 times [2021-01-06 18:18:57,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:57,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187417327] [2021-01-06 18:18:57,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:18:57,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187417327] [2021-01-06 18:18:57,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:57,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:18:57,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961137397] [2021-01-06 18:18:57,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:18:57,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:57,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:18:57,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:18:57,506 INFO L87 Difference]: Start difference. First operand 25049 states and 44127 transitions. Second operand 5 states. [2021-01-06 18:19:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:02,018 INFO L93 Difference]: Finished difference Result 59162 states and 102162 transitions. [2021-01-06 18:19:02,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:19:02,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2021-01-06 18:19:02,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:02,061 INFO L225 Difference]: With dead ends: 59162 [2021-01-06 18:19:02,062 INFO L226 Difference]: Without dead ends: 34529 [2021-01-06 18:19:02,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:19:02,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34529 states. [2021-01-06 18:19:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34529 to 25136. [2021-01-06 18:19:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25136 states. [2021-01-06 18:19:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25136 states to 25136 states and 44214 transitions. [2021-01-06 18:19:05,176 INFO L78 Accepts]: Start accepts. Automaton has 25136 states and 44214 transitions. Word has length 148 [2021-01-06 18:19:05,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:05,176 INFO L481 AbstractCegarLoop]: Abstraction has 25136 states and 44214 transitions. [2021-01-06 18:19:05,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:19:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 25136 states and 44214 transitions. [2021-01-06 18:19:05,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 18:19:05,183 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:05,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:05,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-01-06 18:19:05,183 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:05,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:05,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1370117975, now seen corresponding path program 1 times [2021-01-06 18:19:05,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:05,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658772190] [2021-01-06 18:19:05,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:05,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658772190] [2021-01-06 18:19:05,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:05,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:19:05,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910159698] [2021-01-06 18:19:05,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:19:05,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:05,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:19:05,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:05,277 INFO L87 Difference]: Start difference. First operand 25136 states and 44214 transitions. Second operand 4 states. [2021-01-06 18:19:10,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:10,085 INFO L93 Difference]: Finished difference Result 60570 states and 105964 transitions. [2021-01-06 18:19:10,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:19:10,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 18:19:10,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:10,130 INFO L225 Difference]: With dead ends: 60570 [2021-01-06 18:19:10,130 INFO L226 Difference]: Without dead ends: 35500 [2021-01-06 18:19:10,145 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 [2021-01-06 18:19:10,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35500 states. [2021-01-06 18:19:12,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35500 to 18039. [2021-01-06 18:19:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18039 states. [2021-01-06 18:19:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18039 states to 18039 states and 31345 transitions. [2021-01-06 18:19:12,406 INFO L78 Accepts]: Start accepts. Automaton has 18039 states and 31345 transitions. Word has length 149 [2021-01-06 18:19:12,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:12,406 INFO L481 AbstractCegarLoop]: Abstraction has 18039 states and 31345 transitions. [2021-01-06 18:19:12,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:19:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand 18039 states and 31345 transitions. [2021-01-06 18:19:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-01-06 18:19:12,409 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:12,410 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:12,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-01-06 18:19:12,410 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:12,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:12,410 INFO L82 PathProgramCache]: Analyzing trace with hash -916874883, now seen corresponding path program 1 times [2021-01-06 18:19:12,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:12,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392629058] [2021-01-06 18:19:12,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:12,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:12,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392629058] [2021-01-06 18:19:12,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:12,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:19:12,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314484246] [2021-01-06 18:19:12,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:19:12,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:12,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:19:12,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:19:12,512 INFO L87 Difference]: Start difference. First operand 18039 states and 31345 transitions. Second operand 6 states. [2021-01-06 18:19:19,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:19,607 INFO L93 Difference]: Finished difference Result 62953 states and 111053 transitions. [2021-01-06 18:19:19,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 18:19:19,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2021-01-06 18:19:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:19,660 INFO L225 Difference]: With dead ends: 62953 [2021-01-06 18:19:19,660 INFO L226 Difference]: Without dead ends: 45046 [2021-01-06 18:19:19,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-01-06 18:19:19,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45046 states. [2021-01-06 18:19:22,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45046 to 28937. [2021-01-06 18:19:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28937 states. [2021-01-06 18:19:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28937 states to 28937 states and 51207 transitions. [2021-01-06 18:19:22,971 INFO L78 Accepts]: Start accepts. Automaton has 28937 states and 51207 transitions. Word has length 170 [2021-01-06 18:19:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:22,971 INFO L481 AbstractCegarLoop]: Abstraction has 28937 states and 51207 transitions. [2021-01-06 18:19:22,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:19:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 28937 states and 51207 transitions. [2021-01-06 18:19:22,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-01-06 18:19:22,977 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:22,977 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:22,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-01-06 18:19:22,978 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:22,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:22,978 INFO L82 PathProgramCache]: Analyzing trace with hash -920903109, now seen corresponding path program 1 times [2021-01-06 18:19:22,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:22,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427920847] [2021-01-06 18:19:22,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 18:19:23,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427920847] [2021-01-06 18:19:23,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:23,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 18:19:23,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769487512] [2021-01-06 18:19:23,058 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:19:23,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:23,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:19:23,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:19:23,059 INFO L87 Difference]: Start difference. First operand 28937 states and 51207 transitions. Second operand 3 states. [2021-01-06 18:19:25,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:25,708 INFO L93 Difference]: Finished difference Result 54367 states and 97051 transitions. [2021-01-06 18:19:25,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:19:25,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2021-01-06 18:19:25,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:25,742 INFO L225 Difference]: With dead ends: 54367 [2021-01-06 18:19:25,743 INFO L226 Difference]: Without dead ends: 25678 [2021-01-06 18:19:25,757 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 [2021-01-06 18:19:25,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25678 states. [2021-01-06 18:19:28,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25678 to 25665. [2021-01-06 18:19:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25665 states. [2021-01-06 18:19:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25665 states to 25665 states and 46146 transitions. [2021-01-06 18:19:28,237 INFO L78 Accepts]: Start accepts. Automaton has 25665 states and 46146 transitions. Word has length 170 [2021-01-06 18:19:28,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:28,238 INFO L481 AbstractCegarLoop]: Abstraction has 25665 states and 46146 transitions. [2021-01-06 18:19:28,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:19:28,238 INFO L276 IsEmpty]: Start isEmpty. Operand 25665 states and 46146 transitions. [2021-01-06 18:19:28,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 18:19:28,244 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:28,250 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:28,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-01-06 18:19:28,250 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:28,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:28,252 INFO L82 PathProgramCache]: Analyzing trace with hash -770625473, now seen corresponding path program 1 times [2021-01-06 18:19:28,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:28,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570491538] [2021-01-06 18:19:28,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 18:19:28,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570491538] [2021-01-06 18:19:28,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:28,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:19:28,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081649285] [2021-01-06 18:19:28,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:19:28,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:28,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:19:28,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:19:28,360 INFO L87 Difference]: Start difference. First operand 25665 states and 46146 transitions. Second operand 5 states. [2021-01-06 18:19:33,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:33,419 INFO L93 Difference]: Finished difference Result 76680 states and 138041 transitions. [2021-01-06 18:19:33,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:19:33,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2021-01-06 18:19:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:33,480 INFO L225 Difference]: With dead ends: 76680 [2021-01-06 18:19:33,480 INFO L226 Difference]: Without dead ends: 51241 [2021-01-06 18:19:33,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:19:33,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51241 states. [2021-01-06 18:19:38,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51241 to 51241. [2021-01-06 18:19:38,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51241 states. [2021-01-06 18:19:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51241 states to 51241 states and 92162 transitions. [2021-01-06 18:19:39,008 INFO L78 Accepts]: Start accepts. Automaton has 51241 states and 92162 transitions. Word has length 171 [2021-01-06 18:19:39,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:39,009 INFO L481 AbstractCegarLoop]: Abstraction has 51241 states and 92162 transitions. [2021-01-06 18:19:39,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:19:39,009 INFO L276 IsEmpty]: Start isEmpty. Operand 51241 states and 92162 transitions. [2021-01-06 18:19:39,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 18:19:39,019 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:39,020 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:39,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-01-06 18:19:39,020 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:39,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:39,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1248662472, now seen corresponding path program 1 times [2021-01-06 18:19:39,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:39,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139252184] [2021-01-06 18:19:39,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:39,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139252184] [2021-01-06 18:19:39,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:39,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:19:39,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922672388] [2021-01-06 18:19:39,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:19:39,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:39,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:19:39,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:19:39,142 INFO L87 Difference]: Start difference. First operand 51241 states and 92162 transitions. Second operand 6 states. [2021-01-06 18:19:51,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:51,262 INFO L93 Difference]: Finished difference Result 151691 states and 273444 transitions. [2021-01-06 18:19:51,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 18:19:51,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2021-01-06 18:19:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:51,448 INFO L225 Difference]: With dead ends: 151691 [2021-01-06 18:19:51,448 INFO L226 Difference]: Without dead ends: 100650 [2021-01-06 18:19:51,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-01-06 18:19:51,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100650 states. [2021-01-06 18:19:58,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100650 to 73047. [2021-01-06 18:19:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73047 states. [2021-01-06 18:19:59,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73047 states to 73047 states and 132002 transitions. [2021-01-06 18:19:59,101 INFO L78 Accepts]: Start accepts. Automaton has 73047 states and 132002 transitions. Word has length 171 [2021-01-06 18:19:59,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:59,102 INFO L481 AbstractCegarLoop]: Abstraction has 73047 states and 132002 transitions. [2021-01-06 18:19:59,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:19:59,102 INFO L276 IsEmpty]: Start isEmpty. Operand 73047 states and 132002 transitions. [2021-01-06 18:19:59,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-01-06 18:19:59,116 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:59,116 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:59,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-01-06 18:19:59,116 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:59,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:59,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1824312048, now seen corresponding path program 1 times [2021-01-06 18:19:59,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:59,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786833668] [2021-01-06 18:19:59,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 18:19:59,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786833668] [2021-01-06 18:19:59,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:59,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:19:59,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386059711] [2021-01-06 18:19:59,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:19:59,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:59,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:19:59,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:19:59,208 INFO L87 Difference]: Start difference. First operand 73047 states and 132002 transitions. Second operand 5 states. [2021-01-06 18:20:12,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:20:12,910 INFO L93 Difference]: Finished difference Result 218537 states and 395214 transitions. [2021-01-06 18:20:12,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:20:12,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2021-01-06 18:20:12,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:20:13,178 INFO L225 Difference]: With dead ends: 218537 [2021-01-06 18:20:13,179 INFO L226 Difference]: Without dead ends: 145936 [2021-01-06 18:20:13,426 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:20:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145936 states. [2021-01-06 18:20:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145936 to 145932. [2021-01-06 18:20:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145932 states. [2021-01-06 18:20:27,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145932 states to 145932 states and 263734 transitions. [2021-01-06 18:20:27,701 INFO L78 Accepts]: Start accepts. Automaton has 145932 states and 263734 transitions. Word has length 172 [2021-01-06 18:20:27,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:20:27,701 INFO L481 AbstractCegarLoop]: Abstraction has 145932 states and 263734 transitions. [2021-01-06 18:20:27,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:20:27,702 INFO L276 IsEmpty]: Start isEmpty. Operand 145932 states and 263734 transitions. [2021-01-06 18:20:27,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-01-06 18:20:27,729 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:20:27,729 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:20:27,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-01-06 18:20:27,729 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:20:27,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:20:27,730 INFO L82 PathProgramCache]: Analyzing trace with hash -954889173, now seen corresponding path program 1 times [2021-01-06 18:20:27,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:20:27,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991108769] [2021-01-06 18:20:27,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:20:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:20:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 18:20:28,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991108769] [2021-01-06 18:20:28,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:20:28,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:20:28,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85375037] [2021-01-06 18:20:28,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:20:28,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:20:28,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:20:28,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:20:28,186 INFO L87 Difference]: Start difference. First operand 145932 states and 263734 transitions. Second operand 6 states. [2021-01-06 18:20:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:20:55,478 INFO L93 Difference]: Finished difference Result 402838 states and 723892 transitions. [2021-01-06 18:20:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 18:20:55,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2021-01-06 18:20:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:20:56,037 INFO L225 Difference]: With dead ends: 402838 [2021-01-06 18:20:56,037 INFO L226 Difference]: Without dead ends: 257736 [2021-01-06 18:20:56,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-01-06 18:20:56,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257736 states.