/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_product17.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 18:17:07,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 18:17:07,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 18:17:07,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 18:17:07,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 18:17:07,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 18:17:07,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 18:17:07,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 18:17:07,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 18:17:07,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 18:17:07,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 18:17:07,506 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 18:17:07,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 18:17:07,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 18:17:07,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 18:17:07,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 18:17:07,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 18:17:07,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 18:17:07,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 18:17:07,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 18:17:07,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 18:17:07,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 18:17:07,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 18:17:07,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 18:17:07,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 18:17:07,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 18:17:07,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 18:17:07,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 18:17:07,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 18:17:07,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 18:17:07,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 18:17:07,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 18:17:07,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 18:17:07,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 18:17:07,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 18:17:07,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 18:17:07,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 18:17:07,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 18:17:07,572 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 18:17:07,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 18:17:07,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 18:17:07,576 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:07,630 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 18:17:07,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 18:17:07,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 18:17:07,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 18:17:07,637 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 18:17:07,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 18:17:07,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 18:17:07,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 18:17:07,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 18:17:07,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 18:17:07,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 18:17:07,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 18:17:07,640 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 18:17:07,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 18:17:07,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 18:17:07,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 18:17:07,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 18:17:07,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 18:17:07,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 18:17:07,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 18:17:07,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 18:17:07,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 18:17:07,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 18:17:07,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 18:17:07,643 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 18:17:07,643 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:08,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 18:17:08,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 18:17:08,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 18:17:08,128 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 18:17:08,129 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 18:17:08,131 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec1_product17.cil.c [2021-01-06 18:17:08,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/125b81b79/bf778e6964cb47d7b80e9ac225d9eac5/FLAG69b66ad29 [2021-01-06 18:17:09,070 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 18:17:09,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec1_product17.cil.c [2021-01-06 18:17:09,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/125b81b79/bf778e6964cb47d7b80e9ac225d9eac5/FLAG69b66ad29 [2021-01-06 18:17:09,237 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/125b81b79/bf778e6964cb47d7b80e9ac225d9eac5 [2021-01-06 18:17:09,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 18:17:09,244 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 18:17:09,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 18:17:09,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 18:17:09,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 18:17:09,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 06:17:09" (1/1) ... [2021-01-06 18:17:09,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2bebde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:17:09, skipping insertion in model container [2021-01-06 18:17:09,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 06:17:09" (1/1) ... [2021-01-06 18:17:09,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 18:17:09,377 INFO L178 MainTranslator]: Built tables and reachable declarations 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~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[~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~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~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~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~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~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[~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~2,] left hand side expression in assignment: lhs: VariableLHS[~excep~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~cf~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_15~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_16~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~1,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~1,] left hand side expression in assignment: lhs: VariableLHS[~excep~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~2,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~new~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_18~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~2,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_20~0,] left hand side expression in assignment: lhs: VariableLHS[~next~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_21~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~3,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~count,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_22~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mem_23~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_24~0,] 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[~__cil_tmp4~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~4,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] [2021-01-06 18:17:09,861 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_product17.cil.c[27146,27159] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~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~8,] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~weight~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~weight~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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~9,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~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~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] 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___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~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___1~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___0~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[~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[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] 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___8~0,] 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___7~0,] 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___6~0,] 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___5~0,] 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[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] 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~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~2,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp18~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp19~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp20~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp24~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp25~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp26~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~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[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~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[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] 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~13,] left hand side expression in assignment: lhs: VariableLHS[~floor~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~3,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~5,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~5,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] 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[~nd~0,] 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[~retValue_acc~21,] 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[~retValue_acc~21,] 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~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~maxLength~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] 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~10,] left hand side expression in assignment: lhs: VariableLHS[~action~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~origin~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] [2021-01-06 18:17:10,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 18:17:10,253 INFO L203 MainTranslator]: Completed pre-run 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~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[~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~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~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~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~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~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[~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~2,] left hand side expression in assignment: lhs: VariableLHS[~excep~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~cf~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_15~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_16~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~1,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~1,] left hand side expression in assignment: lhs: VariableLHS[~excep~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~2,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~new~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_18~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~2,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_20~0,] left hand side expression in assignment: lhs: VariableLHS[~next~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_21~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~3,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~count,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_22~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mem_23~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_24~0,] 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[~__cil_tmp4~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~4,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] [2021-01-06 18:17:10,322 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_product17.cil.c[27146,27159] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~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~8,] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~weight~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~weight~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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~9,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~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~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] 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___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~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___1~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___0~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[~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[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] 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___8~0,] 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___7~0,] 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___6~0,] 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___5~0,] 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[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] 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~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~2,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp18~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp19~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp20~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp24~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp25~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp26~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~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[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~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[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] 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~13,] left hand side expression in assignment: lhs: VariableLHS[~floor~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~3,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~5,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~5,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] 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[~nd~0,] 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[~retValue_acc~21,] 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[~retValue_acc~21,] 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~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~maxLength~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] 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~10,] left hand side expression in assignment: lhs: VariableLHS[~action~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~origin~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] [2021-01-06 18:17:10,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 18:17:10,565 INFO L208 MainTranslator]: Completed translation [2021-01-06 18:17:10,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:17:10 WrapperNode [2021-01-06 18:17:10,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 18:17:10,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 18:17:10,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 18:17:10,570 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 18:17:10,581 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:10" (1/1) ... [2021-01-06 18:17:10,651 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:10" (1/1) ... [2021-01-06 18:17:10,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 18:17:10,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 18:17:10,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 18:17:10,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 18:17:10,827 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:10" (1/1) ... [2021-01-06 18:17:10,827 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:10" (1/1) ... [2021-01-06 18:17:10,844 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:10" (1/1) ... [2021-01-06 18:17:10,845 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:10" (1/1) ... [2021-01-06 18:17:10,923 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:10" (1/1) ... [2021-01-06 18:17:10,997 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:10" (1/1) ... [2021-01-06 18:17:11,021 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:10" (1/1) ... [2021-01-06 18:17:11,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 18:17:11,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 18:17:11,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 18:17:11,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 18:17:11,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:17:10" (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:11,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 18:17:11,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 18:17:11,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 18:17:11,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 18:17:16,338 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 18:17:16,339 INFO L299 CfgBuilder]: Removed 541 assume(true) statements. [2021-01-06 18:17:16,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 06:17:16 BoogieIcfgContainer [2021-01-06 18:17:16,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 18:17:16,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 18:17:16,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 18:17:16,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 18:17:16,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 06:17:09" (1/3) ... [2021-01-06 18:17:16,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b32480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 06:17:16, skipping insertion in model container [2021-01-06 18:17:16,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:17:10" (2/3) ... [2021-01-06 18:17:16,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b32480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 06:17:16, skipping insertion in model container [2021-01-06 18:17:16,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 06:17:16" (3/3) ... [2021-01-06 18:17:16,355 INFO L111 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product17.cil.c [2021-01-06 18:17:16,362 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 18:17:16,371 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2021-01-06 18:17:16,393 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-01-06 18:17:16,448 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 18:17:16,448 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 18:17:16,449 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 18:17:16,449 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 18:17:16,449 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 18:17:16,449 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 18:17:16,449 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 18:17:16,449 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 18:17:16,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states. [2021-01-06 18:17:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 18:17:16,538 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:16,542 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] [2021-01-06 18:17:16,543 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:16,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:16,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1455721413, now seen corresponding path program 1 times [2021-01-06 18:17:16,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:16,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537367289] [2021-01-06 18:17:16,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:16,975 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:16,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537367289] [2021-01-06 18:17:16,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:16,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:16,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753942845] [2021-01-06 18:17:16,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:17:16,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:16,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:17:16,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:17:17,002 INFO L87 Difference]: Start difference. First operand 2403 states. Second operand 3 states. [2021-01-06 18:17:17,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:17,297 INFO L93 Difference]: Finished difference Result 7129 states and 13475 transitions. [2021-01-06 18:17:17,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:17:17,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2021-01-06 18:17:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:17,359 INFO L225 Difference]: With dead ends: 7129 [2021-01-06 18:17:17,359 INFO L226 Difference]: Without dead ends: 4731 [2021-01-06 18:17:17,374 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:17,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2021-01-06 18:17:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 2399. [2021-01-06 18:17:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2399 states. [2021-01-06 18:17:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 4522 transitions. [2021-01-06 18:17:17,603 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 4522 transitions. Word has length 47 [2021-01-06 18:17:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:17,603 INFO L481 AbstractCegarLoop]: Abstraction has 2399 states and 4522 transitions. [2021-01-06 18:17:17,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:17:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 4522 transitions. [2021-01-06 18:17:17,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 18:17:17,607 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:17,608 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] [2021-01-06 18:17:17,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 18:17:17,610 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:17,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:17,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1074641241, now seen corresponding path program 1 times [2021-01-06 18:17:17,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:17,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179108141] [2021-01-06 18:17:17,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:17,786 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:17,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179108141] [2021-01-06 18:17:17,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:17,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:17,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766867219] [2021-01-06 18:17:17,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:17,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:17,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:17,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:17,790 INFO L87 Difference]: Start difference. First operand 2399 states and 4522 transitions. Second operand 4 states. [2021-01-06 18:17:18,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:18,211 INFO L93 Difference]: Finished difference Result 9350 states and 17643 transitions. [2021-01-06 18:17:18,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:18,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2021-01-06 18:17:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:18,257 INFO L225 Difference]: With dead ends: 9350 [2021-01-06 18:17:18,257 INFO L226 Difference]: Without dead ends: 6973 [2021-01-06 18:17:18,265 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:18,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6973 states. [2021-01-06 18:17:18,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6973 to 2375. [2021-01-06 18:17:18,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2021-01-06 18:17:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 4469 transitions. [2021-01-06 18:17:18,395 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 4469 transitions. Word has length 54 [2021-01-06 18:17:18,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:18,396 INFO L481 AbstractCegarLoop]: Abstraction has 2375 states and 4469 transitions. [2021-01-06 18:17:18,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:18,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 4469 transitions. [2021-01-06 18:17:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-06 18:17:18,400 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:18,400 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] [2021-01-06 18:17:18,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 18:17:18,401 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:18,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:18,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1947975109, now seen corresponding path program 1 times [2021-01-06 18:17:18,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:18,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349360242] [2021-01-06 18:17:18,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:18,563 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:18,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349360242] [2021-01-06 18:17:18,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:18,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:18,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851484836] [2021-01-06 18:17:18,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:18,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:18,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:18,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:18,567 INFO L87 Difference]: Start difference. First operand 2375 states and 4469 transitions. Second operand 4 states. [2021-01-06 18:17:18,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:18,944 INFO L93 Difference]: Finished difference Result 7033 states and 13258 transitions. [2021-01-06 18:17:18,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:18,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2021-01-06 18:17:18,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:18,971 INFO L225 Difference]: With dead ends: 7033 [2021-01-06 18:17:18,971 INFO L226 Difference]: Without dead ends: 4680 [2021-01-06 18:17:18,978 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:18,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2021-01-06 18:17:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 2375. [2021-01-06 18:17:19,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2021-01-06 18:17:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 4463 transitions. [2021-01-06 18:17:19,080 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 4463 transitions. Word has length 55 [2021-01-06 18:17:19,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:19,087 INFO L481 AbstractCegarLoop]: Abstraction has 2375 states and 4463 transitions. [2021-01-06 18:17:19,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 4463 transitions. [2021-01-06 18:17:19,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 18:17:19,091 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:19,091 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] [2021-01-06 18:17:19,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 18:17:19,092 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:19,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:19,092 INFO L82 PathProgramCache]: Analyzing trace with hash 57770452, now seen corresponding path program 1 times [2021-01-06 18:17:19,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:19,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229289550] [2021-01-06 18:17:19,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:19,264 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:19,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229289550] [2021-01-06 18:17:19,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:19,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:19,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291099542] [2021-01-06 18:17:19,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:19,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:19,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:19,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:19,267 INFO L87 Difference]: Start difference. First operand 2375 states and 4463 transitions. Second operand 4 states. [2021-01-06 18:17:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:19,696 INFO L93 Difference]: Finished difference Result 7033 states and 13246 transitions. [2021-01-06 18:17:19,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:19,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2021-01-06 18:17:19,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:19,725 INFO L225 Difference]: With dead ends: 7033 [2021-01-06 18:17:19,725 INFO L226 Difference]: Without dead ends: 4680 [2021-01-06 18:17:19,731 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:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2021-01-06 18:17:19,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 2375. [2021-01-06 18:17:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2021-01-06 18:17:19,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 4457 transitions. [2021-01-06 18:17:19,840 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 4457 transitions. Word has length 57 [2021-01-06 18:17:19,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:19,842 INFO L481 AbstractCegarLoop]: Abstraction has 2375 states and 4457 transitions. [2021-01-06 18:17:19,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:19,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 4457 transitions. [2021-01-06 18:17:19,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 18:17:19,846 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:19,847 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] [2021-01-06 18:17:19,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 18:17:19,847 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:19,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:19,848 INFO L82 PathProgramCache]: Analyzing trace with hash -964365009, now seen corresponding path program 1 times [2021-01-06 18:17:19,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:19,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19113853] [2021-01-06 18:17:19,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:19,990 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:19,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19113853] [2021-01-06 18:17:19,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:19,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:19,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988682593] [2021-01-06 18:17:19,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:19,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:19,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:19,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:19,997 INFO L87 Difference]: Start difference. First operand 2375 states and 4457 transitions. Second operand 4 states. [2021-01-06 18:17:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:20,649 INFO L93 Difference]: Finished difference Result 11625 states and 21900 transitions. [2021-01-06 18:17:20,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:20,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-01-06 18:17:20,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:20,697 INFO L225 Difference]: With dead ends: 11625 [2021-01-06 18:17:20,697 INFO L226 Difference]: Without dead ends: 9272 [2021-01-06 18:17:20,704 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:20,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9272 states. [2021-01-06 18:17:20,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9272 to 2375. [2021-01-06 18:17:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2021-01-06 18:17:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 4456 transitions. [2021-01-06 18:17:20,866 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 4456 transitions. Word has length 59 [2021-01-06 18:17:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:20,867 INFO L481 AbstractCegarLoop]: Abstraction has 2375 states and 4456 transitions. [2021-01-06 18:17:20,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 4456 transitions. [2021-01-06 18:17:20,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-06 18:17:20,870 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:20,870 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:20,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 18:17:20,871 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:20,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:20,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1558672916, now seen corresponding path program 1 times [2021-01-06 18:17:20,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:20,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692040278] [2021-01-06 18:17:20,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:20,978 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:20,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692040278] [2021-01-06 18:17:20,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:20,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:20,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561407754] [2021-01-06 18:17:20,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:20,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:20,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:20,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:20,981 INFO L87 Difference]: Start difference. First operand 2375 states and 4456 transitions. Second operand 4 states. [2021-01-06 18:17:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:21,341 INFO L93 Difference]: Finished difference Result 7033 states and 13233 transitions. [2021-01-06 18:17:21,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:21,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2021-01-06 18:17:21,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:21,358 INFO L225 Difference]: With dead ends: 7033 [2021-01-06 18:17:21,358 INFO L226 Difference]: Without dead ends: 4680 [2021-01-06 18:17:21,364 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:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2021-01-06 18:17:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 2375. [2021-01-06 18:17:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2021-01-06 18:17:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 4450 transitions. [2021-01-06 18:17:21,593 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 4450 transitions. Word has length 60 [2021-01-06 18:17:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:21,594 INFO L481 AbstractCegarLoop]: Abstraction has 2375 states and 4450 transitions. [2021-01-06 18:17:21,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 4450 transitions. [2021-01-06 18:17:21,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 18:17:21,596 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:21,597 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] [2021-01-06 18:17:21,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 18:17:21,597 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:21,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:21,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1375070420, now seen corresponding path program 1 times [2021-01-06 18:17:21,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:21,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870249336] [2021-01-06 18:17:21,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:21,703 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:21,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870249336] [2021-01-06 18:17:21,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:21,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:21,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039080014] [2021-01-06 18:17:21,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:21,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:21,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:21,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:21,708 INFO L87 Difference]: Start difference. First operand 2375 states and 4450 transitions. Second operand 4 states. [2021-01-06 18:17:22,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:22,044 INFO L93 Difference]: Finished difference Result 7033 states and 13221 transitions. [2021-01-06 18:17:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:22,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2021-01-06 18:17:22,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:22,060 INFO L225 Difference]: With dead ends: 7033 [2021-01-06 18:17:22,060 INFO L226 Difference]: Without dead ends: 4680 [2021-01-06 18:17:22,067 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:22,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2021-01-06 18:17:22,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 2375. [2021-01-06 18:17:22,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2021-01-06 18:17:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 4444 transitions. [2021-01-06 18:17:22,194 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 4444 transitions. Word has length 61 [2021-01-06 18:17:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:22,194 INFO L481 AbstractCegarLoop]: Abstraction has 2375 states and 4444 transitions. [2021-01-06 18:17:22,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 4444 transitions. [2021-01-06 18:17:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 18:17:22,197 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:22,197 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:22,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 18:17:22,198 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:22,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:22,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1110006503, now seen corresponding path program 1 times [2021-01-06 18:17:22,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:22,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789205266] [2021-01-06 18:17:22,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:22,266 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:22,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789205266] [2021-01-06 18:17:22,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:22,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:22,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179449580] [2021-01-06 18:17:22,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:22,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:22,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:22,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:22,268 INFO L87 Difference]: Start difference. First operand 2375 states and 4444 transitions. Second operand 4 states. [2021-01-06 18:17:22,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:22,726 INFO L93 Difference]: Finished difference Result 9308 states and 17509 transitions. [2021-01-06 18:17:22,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:22,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2021-01-06 18:17:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:22,748 INFO L225 Difference]: With dead ends: 9308 [2021-01-06 18:17:22,749 INFO L226 Difference]: Without dead ends: 6961 [2021-01-06 18:17:22,756 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:22,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6961 states. [2021-01-06 18:17:22,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6961 to 2377. [2021-01-06 18:17:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2021-01-06 18:17:22,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 4445 transitions. [2021-01-06 18:17:22,941 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 4445 transitions. Word has length 62 [2021-01-06 18:17:22,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:22,942 INFO L481 AbstractCegarLoop]: Abstraction has 2377 states and 4445 transitions. [2021-01-06 18:17:22,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 4445 transitions. [2021-01-06 18:17:22,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 18:17:22,946 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:22,946 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] [2021-01-06 18:17:22,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 18:17:22,946 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:22,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:22,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1949245111, now seen corresponding path program 1 times [2021-01-06 18:17:22,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:22,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774666736] [2021-01-06 18:17:22,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:23,023 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:23,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774666736] [2021-01-06 18:17:23,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:23,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:23,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795795223] [2021-01-06 18:17:23,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:23,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:23,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:23,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:23,027 INFO L87 Difference]: Start difference. First operand 2377 states and 4445 transitions. Second operand 4 states. [2021-01-06 18:17:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:23,518 INFO L93 Difference]: Finished difference Result 9300 states and 17489 transitions. [2021-01-06 18:17:23,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:23,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2021-01-06 18:17:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:23,539 INFO L225 Difference]: With dead ends: 9300 [2021-01-06 18:17:23,539 INFO L226 Difference]: Without dead ends: 6956 [2021-01-06 18:17:23,548 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:23,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6956 states. [2021-01-06 18:17:23,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6956 to 2382. [2021-01-06 18:17:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2382 states. [2021-01-06 18:17:23,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 4453 transitions. [2021-01-06 18:17:23,731 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 4453 transitions. Word has length 63 [2021-01-06 18:17:23,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:23,735 INFO L481 AbstractCegarLoop]: Abstraction has 2382 states and 4453 transitions. [2021-01-06 18:17:23,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 4453 transitions. [2021-01-06 18:17:23,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 18:17:23,744 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:23,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] [2021-01-06 18:17:23,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 18:17:23,745 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:23,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:23,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1919514994, now seen corresponding path program 1 times [2021-01-06 18:17:23,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:23,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911153839] [2021-01-06 18:17:23,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:23,828 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:23,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911153839] [2021-01-06 18:17:23,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:23,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:23,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704739380] [2021-01-06 18:17:23,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:17:23,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:23,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:17:23,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:17:23,831 INFO L87 Difference]: Start difference. First operand 2382 states and 4453 transitions. Second operand 3 states. [2021-01-06 18:17:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:23,962 INFO L93 Difference]: Finished difference Result 4721 states and 8848 transitions. [2021-01-06 18:17:23,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:17:23,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2021-01-06 18:17:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:23,969 INFO L225 Difference]: With dead ends: 4721 [2021-01-06 18:17:23,969 INFO L226 Difference]: Without dead ends: 2376 [2021-01-06 18:17:23,974 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:23,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2021-01-06 18:17:24,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 2376. [2021-01-06 18:17:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2376 states. [2021-01-06 18:17:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 4441 transitions. [2021-01-06 18:17:24,080 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 4441 transitions. Word has length 64 [2021-01-06 18:17:24,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:24,080 INFO L481 AbstractCegarLoop]: Abstraction has 2376 states and 4441 transitions. [2021-01-06 18:17:24,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:17:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 4441 transitions. [2021-01-06 18:17:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 18:17:24,086 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:24,087 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:24,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 18:17:24,087 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:24,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:24,088 INFO L82 PathProgramCache]: Analyzing trace with hash 67853513, now seen corresponding path program 1 times [2021-01-06 18:17:24,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:24,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925905910] [2021-01-06 18:17:24,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:24,177 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:24,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925905910] [2021-01-06 18:17:24,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:24,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:24,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066402354] [2021-01-06 18:17:24,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:24,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:24,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:24,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:24,181 INFO L87 Difference]: Start difference. First operand 2376 states and 4441 transitions. Second operand 5 states. [2021-01-06 18:17:24,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:24,373 INFO L93 Difference]: Finished difference Result 4665 states and 8761 transitions. [2021-01-06 18:17:24,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:17:24,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2021-01-06 18:17:24,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:24,380 INFO L225 Difference]: With dead ends: 4665 [2021-01-06 18:17:24,380 INFO L226 Difference]: Without dead ends: 2363 [2021-01-06 18:17:24,384 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 18:17:24,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2021-01-06 18:17:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2363. [2021-01-06 18:17:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2021-01-06 18:17:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 4419 transitions. [2021-01-06 18:17:24,490 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 4419 transitions. Word has length 66 [2021-01-06 18:17:24,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:24,490 INFO L481 AbstractCegarLoop]: Abstraction has 2363 states and 4419 transitions. [2021-01-06 18:17:24,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 4419 transitions. [2021-01-06 18:17:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 18:17:24,493 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:24,493 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:24,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 18:17:24,494 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:24,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:24,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2130935477, now seen corresponding path program 1 times [2021-01-06 18:17:24,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:24,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280719719] [2021-01-06 18:17:24,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:24,586 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:24,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280719719] [2021-01-06 18:17:24,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:24,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:24,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14069360] [2021-01-06 18:17:24,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:24,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:24,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:24,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:24,588 INFO L87 Difference]: Start difference. First operand 2363 states and 4419 transitions. Second operand 5 states. [2021-01-06 18:17:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:24,752 INFO L93 Difference]: Finished difference Result 4659 states and 8750 transitions. [2021-01-06 18:17:24,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:24,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2021-01-06 18:17:24,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:24,767 INFO L225 Difference]: With dead ends: 4659 [2021-01-06 18:17:24,768 INFO L226 Difference]: Without dead ends: 2357 [2021-01-06 18:17:24,772 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:24,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2021-01-06 18:17:24,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2357. [2021-01-06 18:17:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2357 states. [2021-01-06 18:17:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 4410 transitions. [2021-01-06 18:17:24,886 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 4410 transitions. Word has length 69 [2021-01-06 18:17:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:24,888 INFO L481 AbstractCegarLoop]: Abstraction has 2357 states and 4410 transitions. [2021-01-06 18:17:24,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 4410 transitions. [2021-01-06 18:17:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 18:17:24,891 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:24,891 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:24,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 18:17:24,891 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:24,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:24,892 INFO L82 PathProgramCache]: Analyzing trace with hash -872318155, now seen corresponding path program 1 times [2021-01-06 18:17:24,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:24,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949952336] [2021-01-06 18:17:24,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:24,980 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:24,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949952336] [2021-01-06 18:17:24,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:24,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:24,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005715769] [2021-01-06 18:17:24,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:24,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:24,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:24,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:24,983 INFO L87 Difference]: Start difference. First operand 2357 states and 4410 transitions. Second operand 4 states. [2021-01-06 18:17:25,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:25,132 INFO L93 Difference]: Finished difference Result 4653 states and 8741 transitions. [2021-01-06 18:17:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:17:25,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-01-06 18:17:25,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:25,141 INFO L225 Difference]: With dead ends: 4653 [2021-01-06 18:17:25,141 INFO L226 Difference]: Without dead ends: 2343 [2021-01-06 18:17:25,151 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:25,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2021-01-06 18:17:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2021-01-06 18:17:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2343 states. [2021-01-06 18:17:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 4389 transitions. [2021-01-06 18:17:25,260 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 4389 transitions. Word has length 69 [2021-01-06 18:17:25,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:25,260 INFO L481 AbstractCegarLoop]: Abstraction has 2343 states and 4389 transitions. [2021-01-06 18:17:25,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 4389 transitions. [2021-01-06 18:17:25,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 18:17:25,263 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:25,264 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] [2021-01-06 18:17:25,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 18:17:25,264 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:25,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:25,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1896232798, now seen corresponding path program 1 times [2021-01-06 18:17:25,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:25,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334747758] [2021-01-06 18:17:25,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:25,373 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:25,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334747758] [2021-01-06 18:17:25,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:25,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:17:25,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518608315] [2021-01-06 18:17:25,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:17:25,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:25,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:17:25,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:17:25,375 INFO L87 Difference]: Start difference. First operand 2343 states and 4389 transitions. Second operand 6 states. [2021-01-06 18:17:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:25,655 INFO L93 Difference]: Finished difference Result 4653 states and 8736 transitions. [2021-01-06 18:17:25,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:17:25,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2021-01-06 18:17:25,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:25,664 INFO L225 Difference]: With dead ends: 4653 [2021-01-06 18:17:25,665 INFO L226 Difference]: Without dead ends: 2363 [2021-01-06 18:17:25,669 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:25,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2021-01-06 18:17:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2343. [2021-01-06 18:17:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2343 states. [2021-01-06 18:17:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 4388 transitions. [2021-01-06 18:17:25,838 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 4388 transitions. Word has length 70 [2021-01-06 18:17:25,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:25,838 INFO L481 AbstractCegarLoop]: Abstraction has 2343 states and 4388 transitions. [2021-01-06 18:17:25,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:17:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 4388 transitions. [2021-01-06 18:17:25,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 18:17:25,841 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:25,841 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:25,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 18:17:25,842 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:25,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:25,842 INFO L82 PathProgramCache]: Analyzing trace with hash -700534802, now seen corresponding path program 1 times [2021-01-06 18:17:25,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:25,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52277053] [2021-01-06 18:17:25,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:25,933 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:25,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52277053] [2021-01-06 18:17:25,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:25,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:17:25,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782664907] [2021-01-06 18:17:25,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:17:25,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:25,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:17:25,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:17:25,935 INFO L87 Difference]: Start difference. First operand 2343 states and 4388 transitions. Second operand 6 states. [2021-01-06 18:17:26,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:26,191 INFO L93 Difference]: Finished difference Result 4643 states and 8717 transitions. [2021-01-06 18:17:26,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:17:26,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2021-01-06 18:17:26,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:26,198 INFO L225 Difference]: With dead ends: 4643 [2021-01-06 18:17:26,198 INFO L226 Difference]: Without dead ends: 2358 [2021-01-06 18:17:26,203 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:26,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2021-01-06 18:17:26,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 2343. [2021-01-06 18:17:26,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2343 states. [2021-01-06 18:17:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 4387 transitions. [2021-01-06 18:17:26,317 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 4387 transitions. Word has length 71 [2021-01-06 18:17:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:26,318 INFO L481 AbstractCegarLoop]: Abstraction has 2343 states and 4387 transitions. [2021-01-06 18:17:26,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:17:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 4387 transitions. [2021-01-06 18:17:26,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 18:17:26,321 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:26,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:17:26,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 18:17:26,321 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:26,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:26,322 INFO L82 PathProgramCache]: Analyzing trace with hash -583370291, now seen corresponding path program 1 times [2021-01-06 18:17:26,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:26,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809796011] [2021-01-06 18:17:26,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:26,405 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:26,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809796011] [2021-01-06 18:17:26,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:26,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:26,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913944857] [2021-01-06 18:17:26,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:26,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:26,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:26,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:26,407 INFO L87 Difference]: Start difference. First operand 2343 states and 4387 transitions. Second operand 5 states. [2021-01-06 18:17:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:28,193 INFO L93 Difference]: Finished difference Result 9329 states and 17495 transitions. [2021-01-06 18:17:28,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:17:28,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2021-01-06 18:17:28,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:28,208 INFO L225 Difference]: With dead ends: 9329 [2021-01-06 18:17:28,208 INFO L226 Difference]: Without dead ends: 7059 [2021-01-06 18:17:28,213 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:28,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7059 states. [2021-01-06 18:17:28,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7059 to 2347. [2021-01-06 18:17:28,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2347 states. [2021-01-06 18:17:28,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 4391 transitions. [2021-01-06 18:17:28,365 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 4391 transitions. Word has length 72 [2021-01-06 18:17:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:28,365 INFO L481 AbstractCegarLoop]: Abstraction has 2347 states and 4391 transitions. [2021-01-06 18:17:28,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:28,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 4391 transitions. [2021-01-06 18:17:28,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 18:17:28,368 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:28,368 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:28,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 18:17:28,369 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:28,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:28,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1999793285, now seen corresponding path program 1 times [2021-01-06 18:17:28,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:28,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19475595] [2021-01-06 18:17:28,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:28,449 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:28,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19475595] [2021-01-06 18:17:28,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:28,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:28,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315463400] [2021-01-06 18:17:28,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:28,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:28,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:28,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:28,452 INFO L87 Difference]: Start difference. First operand 2347 states and 4391 transitions. Second operand 4 states. [2021-01-06 18:17:30,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:30,010 INFO L93 Difference]: Finished difference Result 6769 states and 12648 transitions. [2021-01-06 18:17:30,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:30,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-01-06 18:17:30,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:30,025 INFO L225 Difference]: With dead ends: 6769 [2021-01-06 18:17:30,026 INFO L226 Difference]: Without dead ends: 4482 [2021-01-06 18:17:30,030 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:30,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4482 states. [2021-01-06 18:17:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4482 to 3206. [2021-01-06 18:17:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3206 states. [2021-01-06 18:17:30,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3206 states to 3206 states and 5944 transitions. [2021-01-06 18:17:30,213 INFO L78 Accepts]: Start accepts. Automaton has 3206 states and 5944 transitions. Word has length 73 [2021-01-06 18:17:30,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:30,214 INFO L481 AbstractCegarLoop]: Abstraction has 3206 states and 5944 transitions. [2021-01-06 18:17:30,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:30,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3206 states and 5944 transitions. [2021-01-06 18:17:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 18:17:30,216 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:30,216 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:30,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 18:17:30,216 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:30,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:30,217 INFO L82 PathProgramCache]: Analyzing trace with hash 858880739, now seen corresponding path program 1 times [2021-01-06 18:17:30,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:30,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591877209] [2021-01-06 18:17:30,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:30,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:30,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591877209] [2021-01-06 18:17:30,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:30,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:30,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858811878] [2021-01-06 18:17:30,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:30,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:30,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:30,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:30,321 INFO L87 Difference]: Start difference. First operand 3206 states and 5944 transitions. Second operand 5 states. [2021-01-06 18:17:31,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:31,917 INFO L93 Difference]: Finished difference Result 22983 states and 42901 transitions. [2021-01-06 18:17:31,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:17:31,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2021-01-06 18:17:31,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:31,951 INFO L225 Difference]: With dead ends: 22983 [2021-01-06 18:17:31,951 INFO L226 Difference]: Without dead ends: 19846 [2021-01-06 18:17:31,962 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:17:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19846 states. [2021-01-06 18:17:32,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19846 to 5885. [2021-01-06 18:17:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5885 states. [2021-01-06 18:17:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5885 states to 5885 states and 10964 transitions. [2021-01-06 18:17:32,400 INFO L78 Accepts]: Start accepts. Automaton has 5885 states and 10964 transitions. Word has length 75 [2021-01-06 18:17:32,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:32,401 INFO L481 AbstractCegarLoop]: Abstraction has 5885 states and 10964 transitions. [2021-01-06 18:17:32,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:32,401 INFO L276 IsEmpty]: Start isEmpty. Operand 5885 states and 10964 transitions. [2021-01-06 18:17:32,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 18:17:32,403 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:32,403 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:32,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 18:17:32,404 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:32,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:32,404 INFO L82 PathProgramCache]: Analyzing trace with hash 724867233, now seen corresponding path program 1 times [2021-01-06 18:17:32,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:32,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925361855] [2021-01-06 18:17:32,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:32,474 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,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925361855] [2021-01-06 18:17:32,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:32,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:32,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68053949] [2021-01-06 18:17:32,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:32,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:32,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:32,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:32,476 INFO L87 Difference]: Start difference. First operand 5885 states and 10964 transitions. Second operand 4 states. [2021-01-06 18:17:33,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:33,127 INFO L93 Difference]: Finished difference Result 14344 states and 26716 transitions. [2021-01-06 18:17:33,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:33,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 18:17:33,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:33,149 INFO L225 Difference]: With dead ends: 14344 [2021-01-06 18:17:33,150 INFO L226 Difference]: Without dead ends: 11836 [2021-01-06 18:17:33,157 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:33,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11836 states. [2021-01-06 18:17:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11836 to 8142. [2021-01-06 18:17:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8142 states. [2021-01-06 18:17:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8142 states to 8142 states and 15167 transitions. [2021-01-06 18:17:33,653 INFO L78 Accepts]: Start accepts. Automaton has 8142 states and 15167 transitions. Word has length 75 [2021-01-06 18:17:33,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:33,653 INFO L481 AbstractCegarLoop]: Abstraction has 8142 states and 15167 transitions. [2021-01-06 18:17:33,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:33,653 INFO L276 IsEmpty]: Start isEmpty. Operand 8142 states and 15167 transitions. [2021-01-06 18:17:33,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 18:17:33,655 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:33,656 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:33,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 18:17:33,656 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:33,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:33,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1193328725, now seen corresponding path program 1 times [2021-01-06 18:17:33,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:33,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916891002] [2021-01-06 18:17:33,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:33,722 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,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916891002] [2021-01-06 18:17:33,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:33,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:33,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661021401] [2021-01-06 18:17:33,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:33,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:33,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:33,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:33,725 INFO L87 Difference]: Start difference. First operand 8142 states and 15167 transitions. Second operand 4 states. [2021-01-06 18:17:34,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:34,573 INFO L93 Difference]: Finished difference Result 16856 states and 31303 transitions. [2021-01-06 18:17:34,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:34,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2021-01-06 18:17:34,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:34,592 INFO L225 Difference]: With dead ends: 16856 [2021-01-06 18:17:34,593 INFO L226 Difference]: Without dead ends: 12280 [2021-01-06 18:17:34,601 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:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12280 states. [2021-01-06 18:17:35,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12280 to 8152. [2021-01-06 18:17:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8152 states. [2021-01-06 18:17:35,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8152 states to 8152 states and 15173 transitions. [2021-01-06 18:17:35,083 INFO L78 Accepts]: Start accepts. Automaton has 8152 states and 15173 transitions. Word has length 77 [2021-01-06 18:17:35,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:35,084 INFO L481 AbstractCegarLoop]: Abstraction has 8152 states and 15173 transitions. [2021-01-06 18:17:35,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:35,084 INFO L276 IsEmpty]: Start isEmpty. Operand 8152 states and 15173 transitions. [2021-01-06 18:17:35,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-06 18:17:35,087 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:35,087 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] [2021-01-06 18:17:35,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 18:17:35,087 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:35,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:35,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1202050348, now seen corresponding path program 1 times [2021-01-06 18:17:35,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:35,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078927561] [2021-01-06 18:17:35,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:35,174 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,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078927561] [2021-01-06 18:17:35,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:35,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:17:35,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819177832] [2021-01-06 18:17:35,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 18:17:35,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:35,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 18:17:35,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:17:35,179 INFO L87 Difference]: Start difference. First operand 8152 states and 15173 transitions. Second operand 7 states. [2021-01-06 18:17:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:36,110 INFO L93 Difference]: Finished difference Result 17266 states and 32100 transitions. [2021-01-06 18:17:36,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 18:17:36,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2021-01-06 18:17:36,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:36,132 INFO L225 Difference]: With dead ends: 17266 [2021-01-06 18:17:36,132 INFO L226 Difference]: Without dead ends: 12511 [2021-01-06 18:17:36,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-01-06 18:17:36,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12511 states. [2021-01-06 18:17:36,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12511 to 8156. [2021-01-06 18:17:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8156 states. [2021-01-06 18:17:36,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8156 states to 8156 states and 15171 transitions. [2021-01-06 18:17:36,798 INFO L78 Accepts]: Start accepts. Automaton has 8156 states and 15171 transitions. Word has length 83 [2021-01-06 18:17:36,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:36,798 INFO L481 AbstractCegarLoop]: Abstraction has 8156 states and 15171 transitions. [2021-01-06 18:17:36,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 18:17:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 8156 states and 15171 transitions. [2021-01-06 18:17:36,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-06 18:17:36,802 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:36,802 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] [2021-01-06 18:17:36,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 18:17:36,803 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:36,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:36,803 INFO L82 PathProgramCache]: Analyzing trace with hash -983195630, now seen corresponding path program 1 times [2021-01-06 18:17:36,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:36,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328000361] [2021-01-06 18:17:36,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:36,897 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,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328000361] [2021-01-06 18:17:36,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:36,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:36,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661590822] [2021-01-06 18:17:36,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:36,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:36,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:36,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:36,904 INFO L87 Difference]: Start difference. First operand 8156 states and 15171 transitions. Second operand 5 states. [2021-01-06 18:17:37,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:37,626 INFO L93 Difference]: Finished difference Result 12731 states and 23682 transitions. [2021-01-06 18:17:37,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:17:37,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2021-01-06 18:17:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:37,641 INFO L225 Difference]: With dead ends: 12731 [2021-01-06 18:17:37,641 INFO L226 Difference]: Without dead ends: 8175 [2021-01-06 18:17:37,649 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:17:37,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8175 states. [2021-01-06 18:17:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8175 to 8156. [2021-01-06 18:17:38,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8156 states. [2021-01-06 18:17:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8156 states to 8156 states and 15156 transitions. [2021-01-06 18:17:38,104 INFO L78 Accepts]: Start accepts. Automaton has 8156 states and 15156 transitions. Word has length 83 [2021-01-06 18:17:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:38,105 INFO L481 AbstractCegarLoop]: Abstraction has 8156 states and 15156 transitions. [2021-01-06 18:17:38,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 8156 states and 15156 transitions. [2021-01-06 18:17:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-06 18:17:38,107 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:38,108 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] [2021-01-06 18:17:38,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 18:17:38,108 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:38,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:38,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1570001644, now seen corresponding path program 1 times [2021-01-06 18:17:38,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:38,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847411015] [2021-01-06 18:17:38,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:38,193 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,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847411015] [2021-01-06 18:17:38,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:38,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:38,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567562742] [2021-01-06 18:17:38,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:17:38,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:38,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:17:38,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:17:38,195 INFO L87 Difference]: Start difference. First operand 8156 states and 15156 transitions. Second operand 3 states. [2021-01-06 18:17:38,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:38,725 INFO L93 Difference]: Finished difference Result 14701 states and 27337 transitions. [2021-01-06 18:17:38,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:17:38,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2021-01-06 18:17:38,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:38,740 INFO L225 Difference]: With dead ends: 14701 [2021-01-06 18:17:38,740 INFO L226 Difference]: Without dead ends: 8134 [2021-01-06 18:17:38,752 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:38,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8134 states. [2021-01-06 18:17:39,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8134 to 8134. [2021-01-06 18:17:39,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8134 states. [2021-01-06 18:17:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8134 states to 8134 states and 15114 transitions. [2021-01-06 18:17:39,136 INFO L78 Accepts]: Start accepts. Automaton has 8134 states and 15114 transitions. Word has length 83 [2021-01-06 18:17:39,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:39,137 INFO L481 AbstractCegarLoop]: Abstraction has 8134 states and 15114 transitions. [2021-01-06 18:17:39,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:17:39,137 INFO L276 IsEmpty]: Start isEmpty. Operand 8134 states and 15114 transitions. [2021-01-06 18:17:39,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 18:17:39,140 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:39,140 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] [2021-01-06 18:17:39,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 18:17:39,140 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:39,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:39,141 INFO L82 PathProgramCache]: Analyzing trace with hash -120789210, now seen corresponding path program 1 times [2021-01-06 18:17:39,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:39,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374783198] [2021-01-06 18:17:39,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:39,218 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,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374783198] [2021-01-06 18:17:39,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:39,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:39,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687330851] [2021-01-06 18:17:39,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:39,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:39,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:39,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:39,220 INFO L87 Difference]: Start difference. First operand 8134 states and 15114 transitions. Second operand 5 states. [2021-01-06 18:17:40,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:40,768 INFO L93 Difference]: Finished difference Result 32472 states and 59977 transitions. [2021-01-06 18:17:40,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:17:40,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2021-01-06 18:17:40,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:40,812 INFO L225 Difference]: With dead ends: 32472 [2021-01-06 18:17:40,812 INFO L226 Difference]: Without dead ends: 27947 [2021-01-06 18:17:40,825 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:17:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27947 states. [2021-01-06 18:17:41,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27947 to 9856. [2021-01-06 18:17:41,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9856 states. [2021-01-06 18:17:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9856 states to 9856 states and 18092 transitions. [2021-01-06 18:17:41,457 INFO L78 Accepts]: Start accepts. Automaton has 9856 states and 18092 transitions. Word has length 85 [2021-01-06 18:17:41,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:41,457 INFO L481 AbstractCegarLoop]: Abstraction has 9856 states and 18092 transitions. [2021-01-06 18:17:41,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:41,457 INFO L276 IsEmpty]: Start isEmpty. Operand 9856 states and 18092 transitions. [2021-01-06 18:17:41,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 18:17:41,460 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:41,461 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] [2021-01-06 18:17:41,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 18:17:41,461 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:17:41,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:41,462 INFO L82 PathProgramCache]: Analyzing trace with hash -436096860, now seen corresponding path program 1 times [2021-01-06 18:17:41,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:41,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286785203] [2021-01-06 18:17:41,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:41,575 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,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286785203] [2021-01-06 18:17:41,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:41,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:41,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459296980] [2021-01-06 18:17:41,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:41,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:41,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:41,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:41,577 INFO L87 Difference]: Start difference. First operand 9856 states and 18092 transitions. Second operand 5 states. [2021-01-06 18:17:42,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:42,479 INFO L93 Difference]: Finished difference Result 16300 states and 29957 transitions. [2021-01-06 18:17:42,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:42,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2021-01-06 18:17:42,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:42,500 INFO L225 Difference]: With dead ends: 16300 [2021-01-06 18:17:42,500 INFO L226 Difference]: Without dead ends: 16287 [2021-01-06 18:17:42,504 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:17:42,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16287 states. [2021-01-06 18:17:43,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16287 to 9874. [2021-01-06 18:17:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9874 states. [2021-01-06 18:17:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 18110 transitions. [2021-01-06 18:17:43,116 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 18110 transitions. Word has length 85 [2021-01-06 18:17:43,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:43,116 INFO L481 AbstractCegarLoop]: Abstraction has 9874 states and 18110 transitions. [2021-01-06 18:17:43,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 18110 transitions. [2021-01-06 18:17:43,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 18:17:43,119 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:43,119 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] [2021-01-06 18:17:43,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 18:17:43,120 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:17:43,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:43,120 INFO L82 PathProgramCache]: Analyzing trace with hash 513050185, now seen corresponding path program 1 times [2021-01-06 18:17:43,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:43,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212764890] [2021-01-06 18:17:43,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:43,188 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:43,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212764890] [2021-01-06 18:17:43,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:43,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:43,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745862724] [2021-01-06 18:17:43,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:43,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:43,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:43,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:43,190 INFO L87 Difference]: Start difference. First operand 9874 states and 18110 transitions. Second operand 4 states. [2021-01-06 18:17:43,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:43,828 INFO L93 Difference]: Finished difference Result 9893 states and 18128 transitions. [2021-01-06 18:17:43,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:17:43,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 18:17:43,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:43,840 INFO L225 Difference]: With dead ends: 9893 [2021-01-06 18:17:43,841 INFO L226 Difference]: Without dead ends: 9880 [2021-01-06 18:17:43,844 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:43,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9880 states. [2021-01-06 18:17:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9880 to 9874. [2021-01-06 18:17:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9874 states. [2021-01-06 18:17:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 18100 transitions. [2021-01-06 18:17:44,382 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 18100 transitions. Word has length 87 [2021-01-06 18:17:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:44,382 INFO L481 AbstractCegarLoop]: Abstraction has 9874 states and 18100 transitions. [2021-01-06 18:17:44,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 18100 transitions. [2021-01-06 18:17:44,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 18:17:44,386 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:44,386 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:17:44,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 18:17:44,386 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:17:44,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:44,387 INFO L82 PathProgramCache]: Analyzing trace with hash 227413835, now seen corresponding path program 1 times [2021-01-06 18:17:44,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:44,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543363203] [2021-01-06 18:17:44,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:44,468 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,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543363203] [2021-01-06 18:17:44,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:44,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:44,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258099831] [2021-01-06 18:17:44,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:44,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:44,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:44,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:44,471 INFO L87 Difference]: Start difference. First operand 9874 states and 18100 transitions. Second operand 5 states. [2021-01-06 18:17:45,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:45,926 INFO L93 Difference]: Finished difference Result 23395 states and 42697 transitions. [2021-01-06 18:17:45,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:17:45,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2021-01-06 18:17:45,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:45,945 INFO L225 Difference]: With dead ends: 23395 [2021-01-06 18:17:45,946 INFO L226 Difference]: Without dead ends: 15372 [2021-01-06 18:17:45,954 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:45,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15372 states. [2021-01-06 18:17:46,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15372 to 9874. [2021-01-06 18:17:46,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9874 states. [2021-01-06 18:17:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 18090 transitions. [2021-01-06 18:17:46,546 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 18090 transitions. Word has length 94 [2021-01-06 18:17:46,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:46,546 INFO L481 AbstractCegarLoop]: Abstraction has 9874 states and 18090 transitions. [2021-01-06 18:17:46,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 18090 transitions. [2021-01-06 18:17:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 18:17:46,548 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:46,549 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] [2021-01-06 18:17:46,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 18:17:46,549 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:17:46,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:46,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1535745843, now seen corresponding path program 1 times [2021-01-06 18:17:46,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:46,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526534617] [2021-01-06 18:17:46,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:46,619 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:46,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526534617] [2021-01-06 18:17:46,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:46,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:46,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716994107] [2021-01-06 18:17:46,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:46,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:46,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:46,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:46,621 INFO L87 Difference]: Start difference. First operand 9874 states and 18090 transitions. Second operand 5 states. [2021-01-06 18:17:48,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:48,084 INFO L93 Difference]: Finished difference Result 23292 states and 42551 transitions. [2021-01-06 18:17:48,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:17:48,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2021-01-06 18:17:48,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:48,102 INFO L225 Difference]: With dead ends: 23292 [2021-01-06 18:17:48,102 INFO L226 Difference]: Without dead ends: 14931 [2021-01-06 18:17:48,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:17:48,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14931 states. [2021-01-06 18:17:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14931 to 9874. [2021-01-06 18:17:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9874 states. [2021-01-06 18:17:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 17894 transitions. [2021-01-06 18:17:48,637 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 17894 transitions. Word has length 98 [2021-01-06 18:17:48,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:48,637 INFO L481 AbstractCegarLoop]: Abstraction has 9874 states and 17894 transitions. [2021-01-06 18:17:48,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:48,637 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 17894 transitions. [2021-01-06 18:17:48,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 18:17:48,640 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:48,641 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] [2021-01-06 18:17:48,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 18:17:48,641 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:17:48,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:48,641 INFO L82 PathProgramCache]: Analyzing trace with hash -327430288, now seen corresponding path program 1 times [2021-01-06 18:17:48,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:48,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257580411] [2021-01-06 18:17:48,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:48,851 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,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257580411] [2021-01-06 18:17:48,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:48,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:48,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059122985] [2021-01-06 18:17:48,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:17:48,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:48,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:17:48,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:17:48,854 INFO L87 Difference]: Start difference. First operand 9874 states and 17894 transitions. Second operand 6 states. [2021-01-06 18:17:51,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:51,493 INFO L93 Difference]: Finished difference Result 28964 states and 52541 transitions. [2021-01-06 18:17:51,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 18:17:51,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2021-01-06 18:17:51,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:51,525 INFO L225 Difference]: With dead ends: 28964 [2021-01-06 18:17:51,525 INFO L226 Difference]: Without dead ends: 23069 [2021-01-06 18:17:51,536 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:17:51,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23069 states. [2021-01-06 18:17:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23069 to 12572. [2021-01-06 18:17:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12572 states. [2021-01-06 18:17:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12572 states to 12572 states and 22813 transitions. [2021-01-06 18:17:52,415 INFO L78 Accepts]: Start accepts. Automaton has 12572 states and 22813 transitions. Word has length 99 [2021-01-06 18:17:52,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:52,415 INFO L481 AbstractCegarLoop]: Abstraction has 12572 states and 22813 transitions. [2021-01-06 18:17:52,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:17:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 12572 states and 22813 transitions. [2021-01-06 18:17:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 18:17:52,418 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:52,419 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] [2021-01-06 18:17:52,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 18:17:52,419 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:17:52,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:52,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1691001428, now seen corresponding path program 1 times [2021-01-06 18:17:52,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:52,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382262469] [2021-01-06 18:17:52,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:52,526 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,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382262469] [2021-01-06 18:17:52,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:52,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:52,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219000091] [2021-01-06 18:17:52,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:17:52,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:52,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:17:52,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:17:52,528 INFO L87 Difference]: Start difference. First operand 12572 states and 22813 transitions. Second operand 6 states. [2021-01-06 18:17:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:55,387 INFO L93 Difference]: Finished difference Result 39515 states and 71704 transitions. [2021-01-06 18:17:55,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 18:17:55,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2021-01-06 18:17:55,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:55,425 INFO L225 Difference]: With dead ends: 39515 [2021-01-06 18:17:55,426 INFO L226 Difference]: Without dead ends: 28668 [2021-01-06 18:17:55,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-01-06 18:17:55,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28668 states. [2021-01-06 18:17:56,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28668 to 17398. [2021-01-06 18:17:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17398 states. [2021-01-06 18:17:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17398 states to 17398 states and 31331 transitions. [2021-01-06 18:17:56,683 INFO L78 Accepts]: Start accepts. Automaton has 17398 states and 31331 transitions. Word has length 99 [2021-01-06 18:17:56,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:56,683 INFO L481 AbstractCegarLoop]: Abstraction has 17398 states and 31331 transitions. [2021-01-06 18:17:56,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:17:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand 17398 states and 31331 transitions. [2021-01-06 18:17:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 18:17:56,686 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:56,686 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] [2021-01-06 18:17:56,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 18:17:56,686 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:17:56,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:56,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1915253328, now seen corresponding path program 1 times [2021-01-06 18:17:56,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:56,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554870150] [2021-01-06 18:17:56,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:56,750 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,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554870150] [2021-01-06 18:17:56,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:56,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 18:17:56,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060685084] [2021-01-06 18:17:56,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:17:56,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:56,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:17:56,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:17:56,753 INFO L87 Difference]: Start difference. First operand 17398 states and 31331 transitions. Second operand 3 states. [2021-01-06 18:17:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:57,820 INFO L93 Difference]: Finished difference Result 28803 states and 52069 transitions. [2021-01-06 18:17:57,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:17:57,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2021-01-06 18:17:57,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:57,839 INFO L225 Difference]: With dead ends: 28803 [2021-01-06 18:17:57,840 INFO L226 Difference]: Without dead ends: 15009 [2021-01-06 18:17:57,852 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:17:57,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15009 states. [2021-01-06 18:17:58,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15009 to 14996. [2021-01-06 18:17:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14996 states. [2021-01-06 18:17:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14996 states to 14996 states and 27335 transitions. [2021-01-06 18:17:58,682 INFO L78 Accepts]: Start accepts. Automaton has 14996 states and 27335 transitions. Word has length 99 [2021-01-06 18:17:58,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:58,682 INFO L481 AbstractCegarLoop]: Abstraction has 14996 states and 27335 transitions. [2021-01-06 18:17:58,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:17:58,682 INFO L276 IsEmpty]: Start isEmpty. Operand 14996 states and 27335 transitions. [2021-01-06 18:17:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 18:17:58,684 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:58,684 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] [2021-01-06 18:17:58,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 18:17:58,685 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:17:58,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:58,685 INFO L82 PathProgramCache]: Analyzing trace with hash 121151173, now seen corresponding path program 1 times [2021-01-06 18:17:58,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:58,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583233829] [2021-01-06 18:17:58,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:58,765 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:58,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583233829] [2021-01-06 18:17:58,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:58,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:58,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731323686] [2021-01-06 18:17:58,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:58,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:58,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:58,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:58,767 INFO L87 Difference]: Start difference. First operand 14996 states and 27335 transitions. Second operand 5 states. [2021-01-06 18:18:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:00,473 INFO L93 Difference]: Finished difference Result 43282 states and 78920 transitions. [2021-01-06 18:18:00,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 18:18:00,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2021-01-06 18:18:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:00,514 INFO L225 Difference]: With dead ends: 43282 [2021-01-06 18:18:00,514 INFO L226 Difference]: Without dead ends: 29903 [2021-01-06 18:18:00,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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:00,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29903 states. [2021-01-06 18:18:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29903 to 29903. [2021-01-06 18:18:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29903 states. [2021-01-06 18:18:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29903 states to 29903 states and 54538 transitions. [2021-01-06 18:18:02,290 INFO L78 Accepts]: Start accepts. Automaton has 29903 states and 54538 transitions. Word has length 100 [2021-01-06 18:18:02,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:02,290 INFO L481 AbstractCegarLoop]: Abstraction has 29903 states and 54538 transitions. [2021-01-06 18:18:02,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:18:02,290 INFO L276 IsEmpty]: Start isEmpty. Operand 29903 states and 54538 transitions. [2021-01-06 18:18:02,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 18:18:02,295 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:02,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] [2021-01-06 18:18:02,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 18:18:02,295 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:02,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:02,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1102571056, now seen corresponding path program 1 times [2021-01-06 18:18:02,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:02,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625084721] [2021-01-06 18:18:02,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:02,356 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:02,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625084721] [2021-01-06 18:18:02,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:02,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:18:02,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515678706] [2021-01-06 18:18:02,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:18:02,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:02,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:18:02,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:18:02,358 INFO L87 Difference]: Start difference. First operand 29903 states and 54538 transitions. Second operand 5 states. [2021-01-06 18:18:04,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:04,072 INFO L93 Difference]: Finished difference Result 56599 states and 103157 transitions. [2021-01-06 18:18:04,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 18:18:04,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2021-01-06 18:18:04,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:04,109 INFO L225 Difference]: With dead ends: 56599 [2021-01-06 18:18:04,109 INFO L226 Difference]: Without dead ends: 28304 [2021-01-06 18:18:04,129 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:04,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28304 states. [2021-01-06 18:18:05,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28304 to 28304. [2021-01-06 18:18:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28304 states. [2021-01-06 18:18:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28304 states to 28304 states and 51580 transitions. [2021-01-06 18:18:06,009 INFO L78 Accepts]: Start accepts. Automaton has 28304 states and 51580 transitions. Word has length 101 [2021-01-06 18:18:06,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:06,009 INFO L481 AbstractCegarLoop]: Abstraction has 28304 states and 51580 transitions. [2021-01-06 18:18:06,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:18:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 28304 states and 51580 transitions. [2021-01-06 18:18:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-01-06 18:18:06,012 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:06,012 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] [2021-01-06 18:18:06,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 18:18:06,012 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:06,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:06,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1844770336, now seen corresponding path program 1 times [2021-01-06 18:18:06,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:06,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677547254] [2021-01-06 18:18:06,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:06,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:06,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677547254] [2021-01-06 18:18:06,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:06,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:18:06,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718056426] [2021-01-06 18:18:06,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:18:06,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:06,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:18:06,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:18:06,119 INFO L87 Difference]: Start difference. First operand 28304 states and 51580 transitions. Second operand 5 states. [2021-01-06 18:18:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:09,830 INFO L93 Difference]: Finished difference Result 77917 states and 142208 transitions. [2021-01-06 18:18:09,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:18:09,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2021-01-06 18:18:09,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:09,913 INFO L225 Difference]: With dead ends: 77917 [2021-01-06 18:18:09,914 INFO L226 Difference]: Without dead ends: 54867 [2021-01-06 18:18:09,937 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:10,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54867 states. [2021-01-06 18:18:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54867 to 28304. [2021-01-06 18:18:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28304 states. [2021-01-06 18:18:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28304 states to 28304 states and 51566 transitions. [2021-01-06 18:18:12,339 INFO L78 Accepts]: Start accepts. Automaton has 28304 states and 51566 transitions. Word has length 102 [2021-01-06 18:18:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:12,339 INFO L481 AbstractCegarLoop]: Abstraction has 28304 states and 51566 transitions. [2021-01-06 18:18:12,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:18:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 28304 states and 51566 transitions. [2021-01-06 18:18:12,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-01-06 18:18:12,342 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:12,342 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:12,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 18:18:12,343 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:12,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:12,343 INFO L82 PathProgramCache]: Analyzing trace with hash 368376399, now seen corresponding path program 1 times [2021-01-06 18:18:12,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:12,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478929964] [2021-01-06 18:18:12,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:12,418 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:12,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478929964] [2021-01-06 18:18:12,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:12,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:18:12,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418476400] [2021-01-06 18:18:12,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:18:12,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:12,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:18:12,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:18:12,420 INFO L87 Difference]: Start difference. First operand 28304 states and 51566 transitions. Second operand 5 states. [2021-01-06 18:18:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:14,472 INFO L93 Difference]: Finished difference Result 51590 states and 93768 transitions. [2021-01-06 18:18:14,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:18:14,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2021-01-06 18:18:14,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:14,512 INFO L225 Difference]: With dead ends: 51590 [2021-01-06 18:18:14,512 INFO L226 Difference]: Without dead ends: 28319 [2021-01-06 18:18:14,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:18:14,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28319 states. [2021-01-06 18:18:16,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28319 to 28304. [2021-01-06 18:18:16,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28304 states. [2021-01-06 18:18:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28304 states to 28304 states and 51262 transitions. [2021-01-06 18:18:16,689 INFO L78 Accepts]: Start accepts. Automaton has 28304 states and 51262 transitions. Word has length 103 [2021-01-06 18:18:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:16,689 INFO L481 AbstractCegarLoop]: Abstraction has 28304 states and 51262 transitions. [2021-01-06 18:18:16,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:18:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 28304 states and 51262 transitions. [2021-01-06 18:18:16,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-01-06 18:18:16,692 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:16,692 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] [2021-01-06 18:18:16,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 18:18:16,692 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:16,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:16,693 INFO L82 PathProgramCache]: Analyzing trace with hash -78814164, now seen corresponding path program 1 times [2021-01-06 18:18:16,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:16,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541015780] [2021-01-06 18:18:16,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:16,966 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:16,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541015780] [2021-01-06 18:18:16,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:16,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 18:18:16,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187666624] [2021-01-06 18:18:16,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 18:18:16,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:16,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 18:18:16,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:18:16,970 INFO L87 Difference]: Start difference. First operand 28304 states and 51262 transitions. Second operand 7 states. [2021-01-06 18:18:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:20,227 INFO L93 Difference]: Finished difference Result 48476 states and 88340 transitions. [2021-01-06 18:18:20,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 18:18:20,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2021-01-06 18:18:20,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:20,290 INFO L225 Difference]: With dead ends: 48476 [2021-01-06 18:18:20,290 INFO L226 Difference]: Without dead ends: 48461 [2021-01-06 18:18:20,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-01-06 18:18:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48461 states. [2021-01-06 18:18:22,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48461 to 28370. [2021-01-06 18:18:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28370 states. [2021-01-06 18:18:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28370 states to 28370 states and 51306 transitions. [2021-01-06 18:18:22,313 INFO L78 Accepts]: Start accepts. Automaton has 28370 states and 51306 transitions. Word has length 104 [2021-01-06 18:18:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:22,314 INFO L481 AbstractCegarLoop]: Abstraction has 28370 states and 51306 transitions. [2021-01-06 18:18:22,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 18:18:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 28370 states and 51306 transitions. [2021-01-06 18:18:22,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 18:18:22,317 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:22,317 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 18:18:22,317 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:22,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:22,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1288856304, now seen corresponding path program 1 times [2021-01-06 18:18:22,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:22,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946640186] [2021-01-06 18:18:22,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:22,407 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,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946640186] [2021-01-06 18:18:22,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:22,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:18:22,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815089942] [2021-01-06 18:18:22,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:18:22,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:22,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:18:22,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:18:22,409 INFO L87 Difference]: Start difference. First operand 28370 states and 51306 transitions. Second operand 5 states. [2021-01-06 18:18:32,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:32,249 INFO L93 Difference]: Finished difference Result 178930 states and 327864 transitions. [2021-01-06 18:18:32,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:18:32,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2021-01-06 18:18:32,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:32,541 INFO L225 Difference]: With dead ends: 178930 [2021-01-06 18:18:32,541 INFO L226 Difference]: Without dead ends: 152203 [2021-01-06 18:18:32,787 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:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152203 states. [2021-01-06 18:18:37,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152203 to 56739. [2021-01-06 18:18:37,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56739 states. [2021-01-06 18:18:37,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56739 states to 56739 states and 102607 transitions. [2021-01-06 18:18:37,707 INFO L78 Accepts]: Start accepts. Automaton has 56739 states and 102607 transitions. Word has length 120 [2021-01-06 18:18:37,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:37,707 INFO L481 AbstractCegarLoop]: Abstraction has 56739 states and 102607 transitions. [2021-01-06 18:18:37,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:18:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand 56739 states and 102607 transitions. [2021-01-06 18:18:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 18:18:37,714 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:37,714 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] [2021-01-06 18:18:37,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 18:18:37,715 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:37,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:37,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2055408800, now seen corresponding path program 1 times [2021-01-06 18:18:37,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:37,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703703322] [2021-01-06 18:18:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:37,785 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,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703703322] [2021-01-06 18:18:37,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:37,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:18:37,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778333118] [2021-01-06 18:18:37,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:18:37,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:37,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:18:37,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:18:37,787 INFO L87 Difference]: Start difference. First operand 56739 states and 102607 transitions. Second operand 3 states. [2021-01-06 18:18:44,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:44,960 INFO L93 Difference]: Finished difference Result 150167 states and 271735 transitions. [2021-01-06 18:18:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:18:44,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2021-01-06 18:18:44,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:45,113 INFO L225 Difference]: With dead ends: 150167 [2021-01-06 18:18:45,113 INFO L226 Difference]: Without dead ends: 96414 [2021-01-06 18:18:45,157 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:45,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96414 states. [2021-01-06 18:18:49,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96414 to 55575. [2021-01-06 18:18:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55575 states. [2021-01-06 18:18:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55575 states to 55575 states and 100309 transitions. [2021-01-06 18:18:49,736 INFO L78 Accepts]: Start accepts. Automaton has 55575 states and 100309 transitions. Word has length 121 [2021-01-06 18:18:49,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:49,736 INFO L481 AbstractCegarLoop]: Abstraction has 55575 states and 100309 transitions. [2021-01-06 18:18:49,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:18:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 55575 states and 100309 transitions. [2021-01-06 18:18:49,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 18:18:49,742 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:49,742 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] [2021-01-06 18:18:49,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 18:18:49,742 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:49,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:49,743 INFO L82 PathProgramCache]: Analyzing trace with hash 289184614, now seen corresponding path program 1 times [2021-01-06 18:18:49,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:49,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751826910] [2021-01-06 18:18:49,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:49,810 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:49,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751826910] [2021-01-06 18:18:49,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:49,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:18:49,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272505885] [2021-01-06 18:18:49,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:18:49,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:49,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:18:49,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:18:49,812 INFO L87 Difference]: Start difference. First operand 55575 states and 100309 transitions. Second operand 5 states. [2021-01-06 18:18:53,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:53,804 INFO L93 Difference]: Finished difference Result 83265 states and 150331 transitions. [2021-01-06 18:18:53,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 18:18:53,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2021-01-06 18:18:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:53,898 INFO L225 Difference]: With dead ends: 83265 [2021-01-06 18:18:53,898 INFO L226 Difference]: Without dead ends: 55174 [2021-01-06 18:18:53,920 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:53,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55174 states. [2021-01-06 18:18:58,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55174 to 55174. [2021-01-06 18:18:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55174 states. [2021-01-06 18:18:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55174 states to 55174 states and 99641 transitions. [2021-01-06 18:18:58,112 INFO L78 Accepts]: Start accepts. Automaton has 55174 states and 99641 transitions. Word has length 121 [2021-01-06 18:18:58,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:58,112 INFO L481 AbstractCegarLoop]: Abstraction has 55174 states and 99641 transitions. [2021-01-06 18:18:58,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:18:58,112 INFO L276 IsEmpty]: Start isEmpty. Operand 55174 states and 99641 transitions. [2021-01-06 18:18:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-01-06 18:18:58,118 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:58,119 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] [2021-01-06 18:18:58,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 18:18:58,119 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:58,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:58,119 INFO L82 PathProgramCache]: Analyzing trace with hash 525203587, now seen corresponding path program 1 times [2021-01-06 18:18:58,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:58,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832630101] [2021-01-06 18:18:58,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:58,184 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:58,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832630101] [2021-01-06 18:18:58,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:58,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:18:58,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946814683] [2021-01-06 18:18:58,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:18:58,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:58,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:18:58,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:18:58,186 INFO L87 Difference]: Start difference. First operand 55174 states and 99641 transitions. Second operand 4 states. [2021-01-06 18:19:03,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:03,833 INFO L93 Difference]: Finished difference Result 120837 states and 215336 transitions. [2021-01-06 18:19:03,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:19:03,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2021-01-06 18:19:03,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:03,932 INFO L225 Difference]: With dead ends: 120837 [2021-01-06 18:19:03,932 INFO L226 Difference]: Without dead ends: 65870 [2021-01-06 18:19:03,961 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:19:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65870 states. [2021-01-06 18:19:08,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65870 to 55352. [2021-01-06 18:19:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55352 states. [2021-01-06 18:19:08,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55352 states to 55352 states and 99819 transitions. [2021-01-06 18:19:08,262 INFO L78 Accepts]: Start accepts. Automaton has 55352 states and 99819 transitions. Word has length 139 [2021-01-06 18:19:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:08,263 INFO L481 AbstractCegarLoop]: Abstraction has 55352 states and 99819 transitions. [2021-01-06 18:19:08,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:19:08,263 INFO L276 IsEmpty]: Start isEmpty. Operand 55352 states and 99819 transitions. [2021-01-06 18:19:08,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-01-06 18:19:08,270 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:08,271 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] [2021-01-06 18:19:08,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 18:19:08,271 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:19:08,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:08,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1932469078, now seen corresponding path program 1 times [2021-01-06 18:19:08,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:08,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738822604] [2021-01-06 18:19:08,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:08,342 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:08,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738822604] [2021-01-06 18:19:08,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:08,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:19:08,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314848092] [2021-01-06 18:19:08,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:19:08,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:08,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:19:08,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:08,344 INFO L87 Difference]: Start difference. First operand 55352 states and 99819 transitions. Second operand 4 states. [2021-01-06 18:19:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:12,388 INFO L93 Difference]: Finished difference Result 101142 states and 181727 transitions. [2021-01-06 18:19:12,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:19:12,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2021-01-06 18:19:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:12,467 INFO L225 Difference]: With dead ends: 101142 [2021-01-06 18:19:12,467 INFO L226 Difference]: Without dead ends: 55367 [2021-01-06 18:19:12,496 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:19:12,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55367 states. [2021-01-06 18:19:16,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55367 to 55272. [2021-01-06 18:19:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55272 states. [2021-01-06 18:19:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55272 states to 55272 states and 99650 transitions. [2021-01-06 18:19:16,703 INFO L78 Accepts]: Start accepts. Automaton has 55272 states and 99650 transitions. Word has length 139 [2021-01-06 18:19:16,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:16,703 INFO L481 AbstractCegarLoop]: Abstraction has 55272 states and 99650 transitions. [2021-01-06 18:19:16,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:19:16,703 INFO L276 IsEmpty]: Start isEmpty. Operand 55272 states and 99650 transitions. [2021-01-06 18:19:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-06 18:19:16,710 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:16,710 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] [2021-01-06 18:19:16,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 18:19:16,711 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:19:16,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:16,711 INFO L82 PathProgramCache]: Analyzing trace with hash 688705767, now seen corresponding path program 1 times [2021-01-06 18:19:16,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:16,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102330407] [2021-01-06 18:19:16,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:16,777 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:16,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102330407] [2021-01-06 18:19:16,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:16,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:19:16,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885240930] [2021-01-06 18:19:16,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:19:16,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:16,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:19:16,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:16,779 INFO L87 Difference]: Start difference. First operand 55272 states and 99650 transitions. Second operand 4 states. [2021-01-06 18:19:23,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:23,821 INFO L93 Difference]: Finished difference Result 144238 states and 259402 transitions. [2021-01-06 18:19:23,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:19:23,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2021-01-06 18:19:23,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:23,973 INFO L225 Difference]: With dead ends: 144238 [2021-01-06 18:19:23,973 INFO L226 Difference]: Without dead ends: 89023 [2021-01-06 18:19:24,022 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:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89023 states. [2021-01-06 18:19:28,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89023 to 44860. [2021-01-06 18:19:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44860 states. [2021-01-06 18:19:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44860 states to 44860 states and 80508 transitions. [2021-01-06 18:19:28,185 INFO L78 Accepts]: Start accepts. Automaton has 44860 states and 80508 transitions. Word has length 140 [2021-01-06 18:19:28,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:28,185 INFO L481 AbstractCegarLoop]: Abstraction has 44860 states and 80508 transitions. [2021-01-06 18:19:28,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:19:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 44860 states and 80508 transitions. [2021-01-06 18:19:28,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-01-06 18:19:28,188 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:28,188 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] [2021-01-06 18:19:28,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-01-06 18:19:28,188 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:19:28,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:28,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1837779196, now seen corresponding path program 1 times [2021-01-06 18:19:28,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:28,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252183408] [2021-01-06 18:19:28,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:28,272 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:28,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252183408] [2021-01-06 18:19:28,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:28,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:19:28,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160245809] [2021-01-06 18:19:28,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:19:28,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:28,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:19:28,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:19:28,275 INFO L87 Difference]: Start difference. First operand 44860 states and 80508 transitions. Second operand 6 states. [2021-01-06 18:19:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:36,950 INFO L93 Difference]: Finished difference Result 166685 states and 301803 transitions. [2021-01-06 18:19:36,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 18:19:36,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2021-01-06 18:19:36,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:37,355 INFO L225 Difference]: With dead ends: 166685 [2021-01-06 18:19:37,355 INFO L226 Difference]: Without dead ends: 121950 [2021-01-06 18:19:37,398 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-06 18:19:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121950 states. [2021-01-06 18:19:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121950 to 43971. [2021-01-06 18:19:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43971 states. [2021-01-06 18:19:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43971 states to 43971 states and 78990 transitions. [2021-01-06 18:19:41,688 INFO L78 Accepts]: Start accepts. Automaton has 43971 states and 78990 transitions. Word has length 141 [2021-01-06 18:19:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:41,688 INFO L481 AbstractCegarLoop]: Abstraction has 43971 states and 78990 transitions. [2021-01-06 18:19:41,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:19:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 43971 states and 78990 transitions. [2021-01-06 18:19:41,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-01-06 18:19:41,691 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:41,692 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] [2021-01-06 18:19:41,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-01-06 18:19:41,692 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:41,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:41,692 INFO L82 PathProgramCache]: Analyzing trace with hash 568295975, now seen corresponding path program 1 times [2021-01-06 18:19:41,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:41,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140215541] [2021-01-06 18:19:41,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:41,769 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:41,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140215541] [2021-01-06 18:19:41,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:41,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:19:41,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619955929] [2021-01-06 18:19:41,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:19:41,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:41,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:19:41,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:41,772 INFO L87 Difference]: Start difference. First operand 43971 states and 78990 transitions. Second operand 4 states.