/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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 20:52:48,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 20:52:48,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 20:52:48,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 20:52:48,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 20:52:48,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 20:52:48,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 20:52:48,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 20:52:48,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 20:52:48,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 20:52:48,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 20:52:48,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 20:52:48,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 20:52:48,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 20:52:48,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 20:52:48,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 20:52:48,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 20:52:48,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 20:52:48,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 20:52:48,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 20:52:48,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 20:52:48,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 20:52:48,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 20:52:48,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 20:52:48,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 20:52:48,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 20:52:48,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 20:52:48,740 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 20:52:48,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 20:52:48,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 20:52:48,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 20:52:48,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 20:52:48,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 20:52:48,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 20:52:48,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 20:52:48,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 20:52:48,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 20:52:48,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 20:52:48,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 20:52:48,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 20:52:48,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 20:52:48,767 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 20:52:48,818 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 20:52:48,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 20:52:48,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 20:52:48,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 20:52:48,824 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 20:52:48,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 20:52:48,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 20:52:48,825 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 20:52:48,825 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 20:52:48,825 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 20:52:48,827 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 20:52:48,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 20:52:48,827 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 20:52:48,828 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 20:52:48,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 20:52:48,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 20:52:48,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 20:52:48,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:52:48,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 20:52:48,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 20:52:48,830 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 20:52:48,830 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 20:52:48,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 20:52:48,831 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 20:52:48,831 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 20:52:48,832 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 20:52:49,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 20:52:49,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 20:52:49,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 20:52:49,272 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 20:52:49,273 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 20:52:49,274 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2021-01-06 20:52:49,364 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ac4f6fd4b/742074e2b695459d9c8741ebdc3c873f/FLAG3c8aa419b [2021-01-06 20:52:50,070 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 20:52:50,070 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2021-01-06 20:52:50,083 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ac4f6fd4b/742074e2b695459d9c8741ebdc3c873f/FLAG3c8aa419b [2021-01-06 20:52:50,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ac4f6fd4b/742074e2b695459d9c8741ebdc3c873f [2021-01-06 20:52:50,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 20:52:50,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 20:52:50,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 20:52:50,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 20:52:50,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 20:52:50,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:52:50" (1/1) ... [2021-01-06 20:52:50,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70b212c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:52:50, skipping insertion in model container [2021-01-06 20:52:50,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:52:50" (1/1) ... [2021-01-06 20:52:50,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 20:52:50,445 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1394~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_2202~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_1532~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~1,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__return_1599~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~2,] [2021-01-06 20:52:50,686 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[6715,6728] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~__return_1834~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_4~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~3,] [2021-01-06 20:52:50,708 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[9402,9415] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~3,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~3,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~__return_2011~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_5~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~4,] [2021-01-06 20:52:50,719 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10493,10506] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~__return_2169~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_6~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~5,] [2021-01-06 20:52:50,730 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11099,11112] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~3,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~3,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~4,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~4,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~__return_1751~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_7~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~6,] [2021-01-06 20:52:50,756 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12518,12531] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~__return_1900~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_8~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~7,] [2021-01-06 20:52:50,767 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13124,13137] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~5,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~5,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~__return_2089~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_9~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~8,] [2021-01-06 20:52:50,783 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14053,14066] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~__return_2235~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~__return_2136~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_10~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~9,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~6,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~__return_2044~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_11~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~10,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~__return_1963~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_12~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~11,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~4,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~7,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~3,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~__return_1867~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_13~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~12,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~3,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~__return_1798~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_14~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~13,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~8,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~__return_1690~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_15~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~14,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~__return_1467~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_16~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~15,] [2021-01-06 20:52:50,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:52:50,863 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1394~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_2202~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_1532~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~1,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__return_1599~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~2,] [2021-01-06 20:52:50,946 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[6715,6728] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~__return_1834~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_4~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~3,] [2021-01-06 20:52:50,975 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[9402,9415] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~3,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~3,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~__return_2011~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_5~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~4,] [2021-01-06 20:52:50,983 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10493,10506] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~__return_2169~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_6~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~5,] [2021-01-06 20:52:50,987 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11099,11112] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~3,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~3,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~4,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~4,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~__return_1751~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_7~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~6,] [2021-01-06 20:52:50,995 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12518,12531] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~__return_1900~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_8~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~7,] [2021-01-06 20:52:51,000 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13124,13137] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~5,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~5,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~__return_2089~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_9~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~8,] [2021-01-06 20:52:51,006 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14053,14066] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~__return_2235~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~__return_2136~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_10~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~9,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~6,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~__return_2044~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_11~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~10,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~__return_1963~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_12~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~11,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~4,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~7,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~3,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~__return_1867~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_13~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~12,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~3,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~__return_1798~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_14~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~13,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~8,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~__return_1690~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_15~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~14,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~__return_1467~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_16~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~15,] [2021-01-06 20:52:51,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:52:51,148 INFO L208 MainTranslator]: Completed translation [2021-01-06 20:52:51,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:52:51 WrapperNode [2021-01-06 20:52:51,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 20:52:51,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 20:52:51,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 20:52:51,150 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 20:52:51,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:52:51" (1/1) ... [2021-01-06 20:52:51,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:52:51" (1/1) ... [2021-01-06 20:52:51,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 20:52:51,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 20:52:51,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 20:52:51,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 20:52:51,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:52:51" (1/1) ... [2021-01-06 20:52:51,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:52:51" (1/1) ... [2021-01-06 20:52:51,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:52:51" (1/1) ... [2021-01-06 20:52:51,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:52:51" (1/1) ... [2021-01-06 20:52:51,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:52:51" (1/1) ... [2021-01-06 20:52:51,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:52:51" (1/1) ... [2021-01-06 20:52:51,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:52:51" (1/1) ... [2021-01-06 20:52:51,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 20:52:51,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 20:52:51,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 20:52:51,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 20:52:51,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:52:51" (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 20:52:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 20:52:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 20:52:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 20:52:51,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 20:52:52,651 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 20:52:52,652 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 20:52:52,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:52:52 BoogieIcfgContainer [2021-01-06 20:52:52,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 20:52:52,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 20:52:52,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 20:52:52,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 20:52:52,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 08:52:50" (1/3) ... [2021-01-06 20:52:52,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26656040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:52:52, skipping insertion in model container [2021-01-06 20:52:52,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:52:51" (2/3) ... [2021-01-06 20:52:52,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26656040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:52:52, skipping insertion in model container [2021-01-06 20:52:52,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:52:52" (3/3) ... [2021-01-06 20:52:52,663 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2021-01-06 20:52:52,670 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 20:52:52,675 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2021-01-06 20:52:52,695 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-01-06 20:52:52,724 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 20:52:52,725 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 20:52:52,725 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 20:52:52,725 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 20:52:52,725 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 20:52:52,725 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 20:52:52,725 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 20:52:52,726 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 20:52:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2021-01-06 20:52:52,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-06 20:52:52,762 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:52:52,763 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] [2021-01-06 20:52:52,763 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:52:52,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:52:52,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1899747950, now seen corresponding path program 1 times [2021-01-06 20:52:52,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:52:52,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997899831] [2021-01-06 20:52:52,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:52:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:52:53,195 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 20:52:53,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997899831] [2021-01-06 20:52:53,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:52:53,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:52:53,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634746880] [2021-01-06 20:52:53,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:52:53,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:52:53,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:52:53,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:52:53,221 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 5 states. [2021-01-06 20:52:53,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:52:53,550 INFO L93 Difference]: Finished difference Result 422 states and 704 transitions. [2021-01-06 20:52:53,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:52:53,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2021-01-06 20:52:53,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:52:53,566 INFO L225 Difference]: With dead ends: 422 [2021-01-06 20:52:53,567 INFO L226 Difference]: Without dead ends: 258 [2021-01-06 20:52:53,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 20:52:53,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-01-06 20:52:53,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 234. [2021-01-06 20:52:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 20:52:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 307 transitions. [2021-01-06 20:52:53,644 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 307 transitions. Word has length 46 [2021-01-06 20:52:53,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:52:53,645 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 307 transitions. [2021-01-06 20:52:53,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:52:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 307 transitions. [2021-01-06 20:52:53,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 20:52:53,648 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:52:53,648 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 20:52:53,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 20:52:53,649 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:52:53,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:52:53,650 INFO L82 PathProgramCache]: Analyzing trace with hash -121525429, now seen corresponding path program 1 times [2021-01-06 20:52:53,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:52:53,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390719622] [2021-01-06 20:52:53,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:52:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:52:53,884 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 20:52:53,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390719622] [2021-01-06 20:52:53,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:52:53,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:52:53,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583669035] [2021-01-06 20:52:53,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:52:53,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:52:53,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:52:53,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:52:53,890 INFO L87 Difference]: Start difference. First operand 234 states and 307 transitions. Second operand 5 states. [2021-01-06 20:52:54,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:52:54,140 INFO L93 Difference]: Finished difference Result 417 states and 560 transitions. [2021-01-06 20:52:54,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:52:54,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2021-01-06 20:52:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:52:54,144 INFO L225 Difference]: With dead ends: 417 [2021-01-06 20:52:54,144 INFO L226 Difference]: Without dead ends: 224 [2021-01-06 20:52:54,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 20:52:54,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-01-06 20:52:54,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2021-01-06 20:52:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2021-01-06 20:52:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 293 transitions. [2021-01-06 20:52:54,173 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 293 transitions. Word has length 47 [2021-01-06 20:52:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:52:54,174 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 293 transitions. [2021-01-06 20:52:54,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:52:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 293 transitions. [2021-01-06 20:52:54,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 20:52:54,176 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:52:54,177 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] [2021-01-06 20:52:54,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 20:52:54,177 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:52:54,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:52:54,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1668920151, now seen corresponding path program 1 times [2021-01-06 20:52:54,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:52:54,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477692006] [2021-01-06 20:52:54,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:52:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:52:54,318 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 20:52:54,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477692006] [2021-01-06 20:52:54,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:52:54,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:52:54,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295799958] [2021-01-06 20:52:54,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:52:54,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:52:54,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:52:54,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:52:54,323 INFO L87 Difference]: Start difference. First operand 224 states and 293 transitions. Second operand 5 states. [2021-01-06 20:52:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:52:54,480 INFO L93 Difference]: Finished difference Result 407 states and 544 transitions. [2021-01-06 20:52:54,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:52:54,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2021-01-06 20:52:54,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:52:54,482 INFO L225 Difference]: With dead ends: 407 [2021-01-06 20:52:54,483 INFO L226 Difference]: Without dead ends: 216 [2021-01-06 20:52:54,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 20:52:54,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-01-06 20:52:54,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2021-01-06 20:52:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2021-01-06 20:52:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 282 transitions. [2021-01-06 20:52:54,504 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 282 transitions. Word has length 48 [2021-01-06 20:52:54,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:52:54,506 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 282 transitions. [2021-01-06 20:52:54,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:52:54,507 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 282 transitions. [2021-01-06 20:52:54,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 20:52:54,511 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:52:54,511 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] [2021-01-06 20:52:54,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 20:52:54,512 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:52:54,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:52:54,513 INFO L82 PathProgramCache]: Analyzing trace with hash -453133940, now seen corresponding path program 1 times [2021-01-06 20:52:54,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:52:54,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771905040] [2021-01-06 20:52:54,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:52:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:52:54,794 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 20:52:54,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771905040] [2021-01-06 20:52:54,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:52:54,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:52:54,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799771507] [2021-01-06 20:52:54,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:52:54,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:52:54,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:52:54,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:52:54,797 INFO L87 Difference]: Start difference. First operand 216 states and 282 transitions. Second operand 9 states. [2021-01-06 20:52:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:52:55,450 INFO L93 Difference]: Finished difference Result 531 states and 735 transitions. [2021-01-06 20:52:55,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 20:52:55,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2021-01-06 20:52:55,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:52:55,455 INFO L225 Difference]: With dead ends: 531 [2021-01-06 20:52:55,455 INFO L226 Difference]: Without dead ends: 526 [2021-01-06 20:52:55,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2021-01-06 20:52:55,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-01-06 20:52:55,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 216. [2021-01-06 20:52:55,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2021-01-06 20:52:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 281 transitions. [2021-01-06 20:52:55,482 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 281 transitions. Word has length 49 [2021-01-06 20:52:55,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:52:55,482 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 281 transitions. [2021-01-06 20:52:55,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:52:55,482 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 281 transitions. [2021-01-06 20:52:55,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 20:52:55,484 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:52:55,484 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] [2021-01-06 20:52:55,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 20:52:55,485 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:52:55,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:52:55,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1459063162, now seen corresponding path program 1 times [2021-01-06 20:52:55,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:52:55,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206371988] [2021-01-06 20:52:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:52:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:52:55,639 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 20:52:55,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206371988] [2021-01-06 20:52:55,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:52:55,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:52:55,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117416240] [2021-01-06 20:52:55,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:52:55,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:52:55,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:52:55,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:52:55,643 INFO L87 Difference]: Start difference. First operand 216 states and 281 transitions. Second operand 9 states. [2021-01-06 20:52:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:52:56,529 INFO L93 Difference]: Finished difference Result 623 states and 870 transitions. [2021-01-06 20:52:56,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 20:52:56,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2021-01-06 20:52:56,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:52:56,533 INFO L225 Difference]: With dead ends: 623 [2021-01-06 20:52:56,533 INFO L226 Difference]: Without dead ends: 522 [2021-01-06 20:52:56,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2021-01-06 20:52:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-01-06 20:52:56,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 216. [2021-01-06 20:52:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2021-01-06 20:52:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 280 transitions. [2021-01-06 20:52:56,558 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 280 transitions. Word has length 49 [2021-01-06 20:52:56,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:52:56,559 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 280 transitions. [2021-01-06 20:52:56,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:52:56,559 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 280 transitions. [2021-01-06 20:52:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 20:52:56,560 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:52:56,560 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] [2021-01-06 20:52:56,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 20:52:56,561 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:52:56,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:52:56,562 INFO L82 PathProgramCache]: Analyzing trace with hash 8857914, now seen corresponding path program 1 times [2021-01-06 20:52:56,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:52:56,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221911482] [2021-01-06 20:52:56,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:52:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:52:56,690 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 20:52:56,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221911482] [2021-01-06 20:52:56,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:52:56,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 20:52:56,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961729356] [2021-01-06 20:52:56,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 20:52:56,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:52:56,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 20:52:56,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-01-06 20:52:56,693 INFO L87 Difference]: Start difference. First operand 216 states and 280 transitions. Second operand 8 states. [2021-01-06 20:52:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:52:57,068 INFO L93 Difference]: Finished difference Result 460 states and 615 transitions. [2021-01-06 20:52:57,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 20:52:57,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2021-01-06 20:52:57,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:52:57,071 INFO L225 Difference]: With dead ends: 460 [2021-01-06 20:52:57,071 INFO L226 Difference]: Without dead ends: 336 [2021-01-06 20:52:57,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-01-06 20:52:57,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-01-06 20:52:57,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 216. [2021-01-06 20:52:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2021-01-06 20:52:57,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 279 transitions. [2021-01-06 20:52:57,095 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 279 transitions. Word has length 49 [2021-01-06 20:52:57,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:52:57,095 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 279 transitions. [2021-01-06 20:52:57,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 20:52:57,095 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 279 transitions. [2021-01-06 20:52:57,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 20:52:57,096 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:52:57,096 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] [2021-01-06 20:52:57,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 20:52:57,097 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:52:57,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:52:57,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1308237609, now seen corresponding path program 1 times [2021-01-06 20:52:57,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:52:57,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403210763] [2021-01-06 20:52:57,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:52:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:52:57,659 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 20:52:57,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403210763] [2021-01-06 20:52:57,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:52:57,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-01-06 20:52:57,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972980132] [2021-01-06 20:52:57,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 20:52:57,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:52:57,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 20:52:57,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:52:57,662 INFO L87 Difference]: Start difference. First operand 216 states and 279 transitions. Second operand 19 states. [2021-01-06 20:52:57,812 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2021-01-06 20:52:58,353 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2021-01-06 20:52:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:52:59,673 INFO L93 Difference]: Finished difference Result 404 states and 530 transitions. [2021-01-06 20:52:59,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 20:52:59,674 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2021-01-06 20:52:59,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:52:59,677 INFO L225 Difference]: With dead ends: 404 [2021-01-06 20:52:59,677 INFO L226 Difference]: Without dead ends: 400 [2021-01-06 20:52:59,678 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=250, Invalid=1082, Unknown=0, NotChecked=0, Total=1332 [2021-01-06 20:52:59,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-01-06 20:52:59,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 220. [2021-01-06 20:52:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2021-01-06 20:52:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 285 transitions. [2021-01-06 20:52:59,703 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 285 transitions. Word has length 51 [2021-01-06 20:52:59,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:52:59,703 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 285 transitions. [2021-01-06 20:52:59,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 20:52:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 285 transitions. [2021-01-06 20:52:59,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 20:52:59,704 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:52:59,704 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] [2021-01-06 20:52:59,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 20:52:59,705 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:52:59,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:52:59,705 INFO L82 PathProgramCache]: Analyzing trace with hash 766441193, now seen corresponding path program 1 times [2021-01-06 20:52:59,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:52:59,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979937807] [2021-01-06 20:52:59,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:52:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:00,248 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 20:53:00,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979937807] [2021-01-06 20:53:00,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:00,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-01-06 20:53:00,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647505268] [2021-01-06 20:53:00,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 20:53:00,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:00,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 20:53:00,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:53:00,251 INFO L87 Difference]: Start difference. First operand 220 states and 285 transitions. Second operand 19 states. [2021-01-06 20:53:00,439 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-01-06 20:53:02,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:02,330 INFO L93 Difference]: Finished difference Result 473 states and 644 transitions. [2021-01-06 20:53:02,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-06 20:53:02,331 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2021-01-06 20:53:02,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:02,334 INFO L225 Difference]: With dead ends: 473 [2021-01-06 20:53:02,334 INFO L226 Difference]: Without dead ends: 385 [2021-01-06 20:53:02,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 20:53:02,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-01-06 20:53:02,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 226. [2021-01-06 20:53:02,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2021-01-06 20:53:02,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 293 transitions. [2021-01-06 20:53:02,359 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 293 transitions. Word has length 51 [2021-01-06 20:53:02,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:02,360 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 293 transitions. [2021-01-06 20:53:02,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 20:53:02,360 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 293 transitions. [2021-01-06 20:53:02,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 20:53:02,361 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:02,361 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] [2021-01-06 20:53:02,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 20:53:02,362 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:02,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:02,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1014075955, now seen corresponding path program 1 times [2021-01-06 20:53:02,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:02,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656738429] [2021-01-06 20:53:02,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:02,961 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 20:53:02,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656738429] [2021-01-06 20:53:02,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:02,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-01-06 20:53:02,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644854216] [2021-01-06 20:53:02,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 20:53:02,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:02,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 20:53:02,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:53:02,964 INFO L87 Difference]: Start difference. First operand 226 states and 293 transitions. Second operand 19 states. [2021-01-06 20:53:03,206 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2021-01-06 20:53:03,969 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2021-01-06 20:53:04,131 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2021-01-06 20:53:04,299 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2021-01-06 20:53:04,653 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2021-01-06 20:53:06,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:06,108 INFO L93 Difference]: Finished difference Result 504 states and 696 transitions. [2021-01-06 20:53:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-06 20:53:06,109 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2021-01-06 20:53:06,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:06,113 INFO L225 Difference]: With dead ends: 504 [2021-01-06 20:53:06,113 INFO L226 Difference]: Without dead ends: 498 [2021-01-06 20:53:06,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=306, Invalid=1026, Unknown=0, NotChecked=0, Total=1332 [2021-01-06 20:53:06,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-01-06 20:53:06,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 226. [2021-01-06 20:53:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2021-01-06 20:53:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 292 transitions. [2021-01-06 20:53:06,141 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 292 transitions. Word has length 51 [2021-01-06 20:53:06,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:06,141 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 292 transitions. [2021-01-06 20:53:06,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 20:53:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 292 transitions. [2021-01-06 20:53:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 20:53:06,142 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:06,142 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] [2021-01-06 20:53:06,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 20:53:06,143 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:06,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:06,144 INFO L82 PathProgramCache]: Analyzing trace with hash -480854780, now seen corresponding path program 1 times [2021-01-06 20:53:06,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:06,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191557470] [2021-01-06 20:53:06,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:06,501 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 20:53:06,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191557470] [2021-01-06 20:53:06,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:06,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 20:53:06,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635581168] [2021-01-06 20:53:06,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 20:53:06,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:06,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 20:53:06,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-01-06 20:53:06,504 INFO L87 Difference]: Start difference. First operand 226 states and 292 transitions. Second operand 11 states. [2021-01-06 20:53:07,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:07,345 INFO L93 Difference]: Finished difference Result 434 states and 592 transitions. [2021-01-06 20:53:07,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 20:53:07,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2021-01-06 20:53:07,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:07,347 INFO L225 Difference]: With dead ends: 434 [2021-01-06 20:53:07,348 INFO L226 Difference]: Without dead ends: 349 [2021-01-06 20:53:07,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-01-06 20:53:07,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-01-06 20:53:07,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 225. [2021-01-06 20:53:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2021-01-06 20:53:07,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 290 transitions. [2021-01-06 20:53:07,377 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 290 transitions. Word has length 51 [2021-01-06 20:53:07,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:07,377 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 290 transitions. [2021-01-06 20:53:07,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 20:53:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 290 transitions. [2021-01-06 20:53:07,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 20:53:07,378 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:07,379 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] [2021-01-06 20:53:07,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 20:53:07,379 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:07,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:07,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1185149594, now seen corresponding path program 1 times [2021-01-06 20:53:07,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:07,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410691221] [2021-01-06 20:53:07,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:07,503 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 20:53:07,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410691221] [2021-01-06 20:53:07,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:07,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:53:07,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281104434] [2021-01-06 20:53:07,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:53:07,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:07,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:53:07,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:53:07,505 INFO L87 Difference]: Start difference. First operand 225 states and 290 transitions. Second operand 9 states. [2021-01-06 20:53:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:08,053 INFO L93 Difference]: Finished difference Result 360 states and 472 transitions. [2021-01-06 20:53:08,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 20:53:08,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2021-01-06 20:53:08,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:08,056 INFO L225 Difference]: With dead ends: 360 [2021-01-06 20:53:08,057 INFO L226 Difference]: Without dead ends: 353 [2021-01-06 20:53:08,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-01-06 20:53:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-01-06 20:53:08,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 225. [2021-01-06 20:53:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2021-01-06 20:53:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 288 transitions. [2021-01-06 20:53:08,085 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 288 transitions. Word has length 52 [2021-01-06 20:53:08,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:08,085 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 288 transitions. [2021-01-06 20:53:08,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:53:08,085 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 288 transitions. [2021-01-06 20:53:08,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 20:53:08,086 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:08,086 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] [2021-01-06 20:53:08,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 20:53:08,086 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:08,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:08,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1721906586, now seen corresponding path program 1 times [2021-01-06 20:53:08,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:08,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524555419] [2021-01-06 20:53:08,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:08,240 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 20:53:08,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524555419] [2021-01-06 20:53:08,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:08,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 20:53:08,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061506044] [2021-01-06 20:53:08,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 20:53:08,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:08,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 20:53:08,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-01-06 20:53:08,243 INFO L87 Difference]: Start difference. First operand 225 states and 288 transitions. Second operand 10 states. [2021-01-06 20:53:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:09,358 INFO L93 Difference]: Finished difference Result 564 states and 775 transitions. [2021-01-06 20:53:09,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 20:53:09,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2021-01-06 20:53:09,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:09,362 INFO L225 Difference]: With dead ends: 564 [2021-01-06 20:53:09,362 INFO L226 Difference]: Without dead ends: 462 [2021-01-06 20:53:09,363 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2021-01-06 20:53:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-01-06 20:53:09,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 225. [2021-01-06 20:53:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2021-01-06 20:53:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 287 transitions. [2021-01-06 20:53:09,394 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 287 transitions. Word has length 52 [2021-01-06 20:53:09,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:09,395 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 287 transitions. [2021-01-06 20:53:09,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 20:53:09,395 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 287 transitions. [2021-01-06 20:53:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 20:53:09,396 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:09,396 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] [2021-01-06 20:53:09,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 20:53:09,396 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:09,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:09,397 INFO L82 PathProgramCache]: Analyzing trace with hash -314743810, now seen corresponding path program 1 times [2021-01-06 20:53:09,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:09,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238370069] [2021-01-06 20:53:09,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:10,113 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 20:53:10,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238370069] [2021-01-06 20:53:10,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:10,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-01-06 20:53:10,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728158154] [2021-01-06 20:53:10,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 20:53:10,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:10,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 20:53:10,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-01-06 20:53:10,116 INFO L87 Difference]: Start difference. First operand 225 states and 287 transitions. Second operand 16 states. [2021-01-06 20:53:10,251 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2021-01-06 20:53:10,726 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2021-01-06 20:53:10,989 WARN L197 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2021-01-06 20:53:11,284 WARN L197 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2021-01-06 20:53:11,575 WARN L197 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2021-01-06 20:53:12,008 WARN L197 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2021-01-06 20:53:12,295 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2021-01-06 20:53:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:13,255 INFO L93 Difference]: Finished difference Result 616 states and 848 transitions. [2021-01-06 20:53:13,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 20:53:13,256 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2021-01-06 20:53:13,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:13,259 INFO L225 Difference]: With dead ends: 616 [2021-01-06 20:53:13,259 INFO L226 Difference]: Without dead ends: 600 [2021-01-06 20:53:13,260 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2021-01-06 20:53:13,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2021-01-06 20:53:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 217. [2021-01-06 20:53:13,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2021-01-06 20:53:13,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 277 transitions. [2021-01-06 20:53:13,297 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 277 transitions. Word has length 52 [2021-01-06 20:53:13,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:13,297 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 277 transitions. [2021-01-06 20:53:13,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 20:53:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 277 transitions. [2021-01-06 20:53:13,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 20:53:13,298 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:13,298 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] [2021-01-06 20:53:13,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 20:53:13,299 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:13,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:13,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1294616090, now seen corresponding path program 1 times [2021-01-06 20:53:13,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:13,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228733350] [2021-01-06 20:53:13,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:13,472 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 20:53:13,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228733350] [2021-01-06 20:53:13,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:13,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 20:53:13,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367862734] [2021-01-06 20:53:13,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 20:53:13,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:13,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 20:53:13,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-06 20:53:13,475 INFO L87 Difference]: Start difference. First operand 217 states and 277 transitions. Second operand 11 states. [2021-01-06 20:53:15,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:15,565 INFO L93 Difference]: Finished difference Result 1003 states and 1421 transitions. [2021-01-06 20:53:15,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 20:53:15,566 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2021-01-06 20:53:15,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:15,570 INFO L225 Difference]: With dead ends: 1003 [2021-01-06 20:53:15,570 INFO L226 Difference]: Without dead ends: 996 [2021-01-06 20:53:15,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2021-01-06 20:53:15,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2021-01-06 20:53:15,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 217. [2021-01-06 20:53:15,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2021-01-06 20:53:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 276 transitions. [2021-01-06 20:53:15,618 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 276 transitions. Word has length 52 [2021-01-06 20:53:15,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:15,618 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 276 transitions. [2021-01-06 20:53:15,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 20:53:15,618 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 276 transitions. [2021-01-06 20:53:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 20:53:15,619 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:15,619 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] [2021-01-06 20:53:15,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 20:53:15,619 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:15,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:15,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1671010270, now seen corresponding path program 1 times [2021-01-06 20:53:15,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:15,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858453027] [2021-01-06 20:53:15,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:16,022 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 20:53:16,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858453027] [2021-01-06 20:53:16,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:16,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-01-06 20:53:16,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462407835] [2021-01-06 20:53:16,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 20:53:16,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:16,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 20:53:16,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-01-06 20:53:16,026 INFO L87 Difference]: Start difference. First operand 217 states and 276 transitions. Second operand 15 states. [2021-01-06 20:53:17,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:17,215 INFO L93 Difference]: Finished difference Result 441 states and 590 transitions. [2021-01-06 20:53:17,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 20:53:17,215 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2021-01-06 20:53:17,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:17,217 INFO L225 Difference]: With dead ends: 441 [2021-01-06 20:53:17,217 INFO L226 Difference]: Without dead ends: 353 [2021-01-06 20:53:17,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2021-01-06 20:53:17,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-01-06 20:53:17,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 211. [2021-01-06 20:53:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2021-01-06 20:53:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 268 transitions. [2021-01-06 20:53:17,273 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 268 transitions. Word has length 52 [2021-01-06 20:53:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:17,273 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 268 transitions. [2021-01-06 20:53:17,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 20:53:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 268 transitions. [2021-01-06 20:53:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 20:53:17,282 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:17,282 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] [2021-01-06 20:53:17,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 20:53:17,282 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:17,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:17,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1834026902, now seen corresponding path program 1 times [2021-01-06 20:53:17,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:17,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223971592] [2021-01-06 20:53:17,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:17,691 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 20:53:17,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223971592] [2021-01-06 20:53:17,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:17,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 20:53:17,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296621756] [2021-01-06 20:53:17,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 20:53:17,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:17,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 20:53:17,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-01-06 20:53:17,693 INFO L87 Difference]: Start difference. First operand 211 states and 268 transitions. Second operand 13 states. [2021-01-06 20:53:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:19,102 INFO L93 Difference]: Finished difference Result 879 states and 1246 transitions. [2021-01-06 20:53:19,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 20:53:19,104 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2021-01-06 20:53:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:19,108 INFO L225 Difference]: With dead ends: 879 [2021-01-06 20:53:19,108 INFO L226 Difference]: Without dead ends: 847 [2021-01-06 20:53:19,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2021-01-06 20:53:19,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2021-01-06 20:53:19,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 179. [2021-01-06 20:53:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2021-01-06 20:53:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 233 transitions. [2021-01-06 20:53:19,150 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 233 transitions. Word has length 52 [2021-01-06 20:53:19,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:19,151 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 233 transitions. [2021-01-06 20:53:19,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 20:53:19,151 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 233 transitions. [2021-01-06 20:53:19,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 20:53:19,151 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:19,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:19,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 20:53:19,152 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:19,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:19,152 INFO L82 PathProgramCache]: Analyzing trace with hash -988369889, now seen corresponding path program 1 times [2021-01-06 20:53:19,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:19,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834123451] [2021-01-06 20:53:19,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:19,257 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 20:53:19,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834123451] [2021-01-06 20:53:19,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:19,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:53:19,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569218195] [2021-01-06 20:53:19,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:53:19,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:19,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:53:19,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:53:19,259 INFO L87 Difference]: Start difference. First operand 179 states and 233 transitions. Second operand 9 states. [2021-01-06 20:53:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:19,798 INFO L93 Difference]: Finished difference Result 328 states and 450 transitions. [2021-01-06 20:53:19,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 20:53:19,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2021-01-06 20:53:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:19,801 INFO L225 Difference]: With dead ends: 328 [2021-01-06 20:53:19,801 INFO L226 Difference]: Without dead ends: 226 [2021-01-06 20:53:19,802 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2021-01-06 20:53:19,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-01-06 20:53:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 179. [2021-01-06 20:53:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2021-01-06 20:53:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 232 transitions. [2021-01-06 20:53:19,840 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 232 transitions. Word has length 53 [2021-01-06 20:53:19,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:19,841 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 232 transitions. [2021-01-06 20:53:19,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:53:19,841 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 232 transitions. [2021-01-06 20:53:19,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 20:53:19,842 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:19,842 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:19,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 20:53:19,842 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:19,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:19,843 INFO L82 PathProgramCache]: Analyzing trace with hash 653628022, now seen corresponding path program 1 times [2021-01-06 20:53:19,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:19,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172723464] [2021-01-06 20:53:19,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:20,346 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 20:53:20,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172723464] [2021-01-06 20:53:20,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:20,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-01-06 20:53:20,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35801354] [2021-01-06 20:53:20,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 20:53:20,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:20,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 20:53:20,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-01-06 20:53:20,353 INFO L87 Difference]: Start difference. First operand 179 states and 232 transitions. Second operand 18 states. [2021-01-06 20:53:20,523 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2021-01-06 20:53:21,133 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-01-06 20:53:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:22,258 INFO L93 Difference]: Finished difference Result 303 states and 404 transitions. [2021-01-06 20:53:22,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 20:53:22,259 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2021-01-06 20:53:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:22,261 INFO L225 Difference]: With dead ends: 303 [2021-01-06 20:53:22,261 INFO L226 Difference]: Without dead ends: 295 [2021-01-06 20:53:22,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=239, Invalid=951, Unknown=0, NotChecked=0, Total=1190 [2021-01-06 20:53:22,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-01-06 20:53:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 179. [2021-01-06 20:53:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2021-01-06 20:53:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 231 transitions. [2021-01-06 20:53:22,314 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 231 transitions. Word has length 54 [2021-01-06 20:53:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:22,315 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 231 transitions. [2021-01-06 20:53:22,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 20:53:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 231 transitions. [2021-01-06 20:53:22,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 20:53:22,315 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:22,316 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 20:53:22,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 20:53:22,316 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:22,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:22,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1899159370, now seen corresponding path program 1 times [2021-01-06 20:53:22,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:22,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355907624] [2021-01-06 20:53:22,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:22,825 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 20:53:22,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355907624] [2021-01-06 20:53:22,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:22,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-01-06 20:53:22,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140047332] [2021-01-06 20:53:22,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 20:53:22,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:22,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 20:53:22,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-01-06 20:53:22,827 INFO L87 Difference]: Start difference. First operand 179 states and 231 transitions. Second operand 18 states. [2021-01-06 20:53:23,014 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2021-01-06 20:53:23,588 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2021-01-06 20:53:24,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:24,744 INFO L93 Difference]: Finished difference Result 373 states and 515 transitions. [2021-01-06 20:53:24,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 20:53:24,745 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2021-01-06 20:53:24,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:24,746 INFO L225 Difference]: With dead ends: 373 [2021-01-06 20:53:24,746 INFO L226 Difference]: Without dead ends: 367 [2021-01-06 20:53:24,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=200, Invalid=856, Unknown=0, NotChecked=0, Total=1056 [2021-01-06 20:53:24,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-01-06 20:53:24,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 185. [2021-01-06 20:53:24,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2021-01-06 20:53:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 239 transitions. [2021-01-06 20:53:24,789 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 239 transitions. Word has length 54 [2021-01-06 20:53:24,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:24,789 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 239 transitions. [2021-01-06 20:53:24,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 20:53:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 239 transitions. [2021-01-06 20:53:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-06 20:53:24,790 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:24,790 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 20:53:24,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 20:53:24,791 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:24,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:24,791 INFO L82 PathProgramCache]: Analyzing trace with hash 2098262835, now seen corresponding path program 1 times [2021-01-06 20:53:24,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:24,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186522047] [2021-01-06 20:53:24,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:25,099 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 20:53:25,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186522047] [2021-01-06 20:53:25,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:25,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 20:53:25,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716767816] [2021-01-06 20:53:25,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 20:53:25,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:25,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 20:53:25,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-01-06 20:53:25,101 INFO L87 Difference]: Start difference. First operand 185 states and 239 transitions. Second operand 12 states. [2021-01-06 20:53:26,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:26,175 INFO L93 Difference]: Finished difference Result 485 states and 674 transitions. [2021-01-06 20:53:26,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 20:53:26,176 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2021-01-06 20:53:26,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:26,180 INFO L225 Difference]: With dead ends: 485 [2021-01-06 20:53:26,180 INFO L226 Difference]: Without dead ends: 479 [2021-01-06 20:53:26,183 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2021-01-06 20:53:26,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-01-06 20:53:26,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 173. [2021-01-06 20:53:26,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2021-01-06 20:53:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 224 transitions. [2021-01-06 20:53:26,233 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 224 transitions. Word has length 55 [2021-01-06 20:53:26,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:26,233 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 224 transitions. [2021-01-06 20:53:26,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 20:53:26,234 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 224 transitions. [2021-01-06 20:53:26,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-06 20:53:26,234 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:26,234 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 20:53:26,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 20:53:26,234 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:26,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:26,235 INFO L82 PathProgramCache]: Analyzing trace with hash -220748721, now seen corresponding path program 1 times [2021-01-06 20:53:26,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:26,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913536063] [2021-01-06 20:53:26,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:26,853 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 20:53:26,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913536063] [2021-01-06 20:53:26,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:26,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 20:53:26,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995183883] [2021-01-06 20:53:26,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 20:53:26,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:26,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 20:53:26,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-01-06 20:53:26,856 INFO L87 Difference]: Start difference. First operand 173 states and 224 transitions. Second operand 14 states. [2021-01-06 20:53:27,488 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2021-01-06 20:53:27,636 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2021-01-06 20:53:27,772 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2021-01-06 20:53:28,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:28,495 INFO L93 Difference]: Finished difference Result 451 states and 638 transitions. [2021-01-06 20:53:28,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 20:53:28,496 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2021-01-06 20:53:28,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:28,498 INFO L225 Difference]: With dead ends: 451 [2021-01-06 20:53:28,498 INFO L226 Difference]: Without dead ends: 439 [2021-01-06 20:53:28,498 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2021-01-06 20:53:28,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-01-06 20:53:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 161. [2021-01-06 20:53:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2021-01-06 20:53:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 212 transitions. [2021-01-06 20:53:28,546 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 212 transitions. Word has length 55 [2021-01-06 20:53:28,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:28,547 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 212 transitions. [2021-01-06 20:53:28,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 20:53:28,547 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 212 transitions. [2021-01-06 20:53:28,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 20:53:28,548 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:28,548 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 20:53:28,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 20:53:28,548 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:28,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:28,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1406506919, now seen corresponding path program 1 times [2021-01-06 20:53:28,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:28,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223157071] [2021-01-06 20:53:28,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:28,605 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 20:53:28,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223157071] [2021-01-06 20:53:28,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:28,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:53:28,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5029699] [2021-01-06 20:53:28,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:53:28,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:28,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:53:28,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:53:28,607 INFO L87 Difference]: Start difference. First operand 161 states and 212 transitions. Second operand 3 states. [2021-01-06 20:53:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:28,720 INFO L93 Difference]: Finished difference Result 321 states and 452 transitions. [2021-01-06 20:53:28,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:53:28,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 20:53:28,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:28,723 INFO L225 Difference]: With dead ends: 321 [2021-01-06 20:53:28,723 INFO L226 Difference]: Without dead ends: 237 [2021-01-06 20:53:28,723 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 20:53:28,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-01-06 20:53:28,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2021-01-06 20:53:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2021-01-06 20:53:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 321 transitions. [2021-01-06 20:53:28,821 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 321 transitions. Word has length 72 [2021-01-06 20:53:28,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:28,822 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 321 transitions. [2021-01-06 20:53:28,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:53:28,822 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 321 transitions. [2021-01-06 20:53:28,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 20:53:28,823 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:28,823 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] [2021-01-06 20:53:28,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 20:53:28,823 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:28,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:28,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1673936966, now seen corresponding path program 1 times [2021-01-06 20:53:28,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:28,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232854851] [2021-01-06 20:53:28,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:28,904 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 20:53:28,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232854851] [2021-01-06 20:53:28,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:28,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:53:28,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559811881] [2021-01-06 20:53:28,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:53:28,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:28,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:53:28,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:53:28,906 INFO L87 Difference]: Start difference. First operand 235 states and 321 transitions. Second operand 5 states. [2021-01-06 20:53:29,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:29,258 INFO L93 Difference]: Finished difference Result 725 states and 1055 transitions. [2021-01-06 20:53:29,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:53:29,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2021-01-06 20:53:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:29,261 INFO L225 Difference]: With dead ends: 725 [2021-01-06 20:53:29,262 INFO L226 Difference]: Without dead ends: 567 [2021-01-06 20:53:29,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:53:29,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-01-06 20:53:29,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 317. [2021-01-06 20:53:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2021-01-06 20:53:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 446 transitions. [2021-01-06 20:53:29,406 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 446 transitions. Word has length 74 [2021-01-06 20:53:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:29,406 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 446 transitions. [2021-01-06 20:53:29,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:53:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 446 transitions. [2021-01-06 20:53:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 20:53:29,407 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:29,408 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] [2021-01-06 20:53:29,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 20:53:29,408 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:29,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:29,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1695280855, now seen corresponding path program 1 times [2021-01-06 20:53:29,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:29,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807124514] [2021-01-06 20:53:29,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:29,460 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 20:53:29,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807124514] [2021-01-06 20:53:29,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:29,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:53:29,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176891857] [2021-01-06 20:53:29,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:53:29,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:29,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:53:29,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:53:29,462 INFO L87 Difference]: Start difference. First operand 317 states and 446 transitions. Second operand 3 states. [2021-01-06 20:53:29,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:29,723 INFO L93 Difference]: Finished difference Result 723 states and 1059 transitions. [2021-01-06 20:53:29,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:53:29,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 20:53:29,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:29,726 INFO L225 Difference]: With dead ends: 723 [2021-01-06 20:53:29,726 INFO L226 Difference]: Without dead ends: 483 [2021-01-06 20:53:29,727 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 20:53:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2021-01-06 20:53:29,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 481. [2021-01-06 20:53:29,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2021-01-06 20:53:29,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 688 transitions. [2021-01-06 20:53:29,895 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 688 transitions. Word has length 74 [2021-01-06 20:53:29,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:29,895 INFO L481 AbstractCegarLoop]: Abstraction has 481 states and 688 transitions. [2021-01-06 20:53:29,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:53:29,895 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 688 transitions. [2021-01-06 20:53:29,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 20:53:29,896 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:29,896 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] [2021-01-06 20:53:29,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 20:53:29,897 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:29,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:29,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1859946120, now seen corresponding path program 1 times [2021-01-06 20:53:29,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:29,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829346411] [2021-01-06 20:53:29,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:29,946 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 20:53:29,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829346411] [2021-01-06 20:53:29,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:29,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:53:29,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572497562] [2021-01-06 20:53:29,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:53:29,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:29,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:53:29,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:53:29,948 INFO L87 Difference]: Start difference. First operand 481 states and 688 transitions. Second operand 3 states. [2021-01-06 20:53:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:30,394 INFO L93 Difference]: Finished difference Result 1229 states and 1794 transitions. [2021-01-06 20:53:30,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:53:30,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 20:53:30,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:30,402 INFO L225 Difference]: With dead ends: 1229 [2021-01-06 20:53:30,402 INFO L226 Difference]: Without dead ends: 825 [2021-01-06 20:53:30,408 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 20:53:30,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2021-01-06 20:53:30,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 813. [2021-01-06 20:53:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2021-01-06 20:53:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1157 transitions. [2021-01-06 20:53:30,816 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1157 transitions. Word has length 74 [2021-01-06 20:53:30,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:30,816 INFO L481 AbstractCegarLoop]: Abstraction has 813 states and 1157 transitions. [2021-01-06 20:53:30,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:53:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1157 transitions. [2021-01-06 20:53:30,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 20:53:30,818 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:30,818 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] [2021-01-06 20:53:30,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 20:53:30,818 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:30,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:30,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1889765056, now seen corresponding path program 1 times [2021-01-06 20:53:30,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:30,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65916255] [2021-01-06 20:53:30,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:30,903 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 20:53:30,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65916255] [2021-01-06 20:53:30,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:30,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:53:30,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546038442] [2021-01-06 20:53:30,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:53:30,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:30,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:53:30,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:53:30,905 INFO L87 Difference]: Start difference. First operand 813 states and 1157 transitions. Second operand 5 states. [2021-01-06 20:53:31,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:31,637 INFO L93 Difference]: Finished difference Result 2193 states and 3163 transitions. [2021-01-06 20:53:31,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:53:31,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2021-01-06 20:53:31,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:31,646 INFO L225 Difference]: With dead ends: 2193 [2021-01-06 20:53:31,646 INFO L226 Difference]: Without dead ends: 1755 [2021-01-06 20:53:31,647 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:53:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2021-01-06 20:53:32,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1261. [2021-01-06 20:53:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1261 states. [2021-01-06 20:53:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1807 transitions. [2021-01-06 20:53:32,212 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1807 transitions. Word has length 74 [2021-01-06 20:53:32,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:32,212 INFO L481 AbstractCegarLoop]: Abstraction has 1261 states and 1807 transitions. [2021-01-06 20:53:32,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:53:32,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1807 transitions. [2021-01-06 20:53:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 20:53:32,214 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:32,214 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 20:53:32,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 20:53:32,215 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:32,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:32,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1073266559, now seen corresponding path program 1 times [2021-01-06 20:53:32,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:32,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342361647] [2021-01-06 20:53:32,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:32,269 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 20:53:32,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342361647] [2021-01-06 20:53:32,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:32,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:53:32,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118401293] [2021-01-06 20:53:32,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:53:32,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:32,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:53:32,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:53:32,272 INFO L87 Difference]: Start difference. First operand 1261 states and 1807 transitions. Second operand 3 states. [2021-01-06 20:53:33,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:33,085 INFO L93 Difference]: Finished difference Result 3501 states and 5029 transitions. [2021-01-06 20:53:33,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:53:33,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2021-01-06 20:53:33,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:33,095 INFO L225 Difference]: With dead ends: 3501 [2021-01-06 20:53:33,095 INFO L226 Difference]: Without dead ends: 2317 [2021-01-06 20:53:33,096 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 20:53:33,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2021-01-06 20:53:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2187. [2021-01-06 20:53:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2187 states. [2021-01-06 20:53:34,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 3113 transitions. [2021-01-06 20:53:34,027 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 3113 transitions. Word has length 75 [2021-01-06 20:53:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:34,027 INFO L481 AbstractCegarLoop]: Abstraction has 2187 states and 3113 transitions. [2021-01-06 20:53:34,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:53:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3113 transitions. [2021-01-06 20:53:34,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 20:53:34,029 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:34,029 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:34,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 20:53:34,029 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:34,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:34,030 INFO L82 PathProgramCache]: Analyzing trace with hash -391890934, now seen corresponding path program 1 times [2021-01-06 20:53:34,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:34,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805946440] [2021-01-06 20:53:34,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:34,100 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 20:53:34,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805946440] [2021-01-06 20:53:34,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:34,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:53:34,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814763183] [2021-01-06 20:53:34,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:53:34,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:34,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:53:34,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:53:34,105 INFO L87 Difference]: Start difference. First operand 2187 states and 3113 transitions. Second operand 3 states. [2021-01-06 20:53:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:35,755 INFO L93 Difference]: Finished difference Result 6151 states and 8723 transitions. [2021-01-06 20:53:35,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:53:35,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2021-01-06 20:53:35,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:35,769 INFO L225 Difference]: With dead ends: 6151 [2021-01-06 20:53:35,770 INFO L226 Difference]: Without dead ends: 4041 [2021-01-06 20:53:35,772 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 20:53:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4041 states. [2021-01-06 20:53:37,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4041 to 3783. [2021-01-06 20:53:37,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3783 states. [2021-01-06 20:53:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3783 states to 3783 states and 5309 transitions. [2021-01-06 20:53:37,115 INFO L78 Accepts]: Start accepts. Automaton has 3783 states and 5309 transitions. Word has length 76 [2021-01-06 20:53:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:37,115 INFO L481 AbstractCegarLoop]: Abstraction has 3783 states and 5309 transitions. [2021-01-06 20:53:37,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:53:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3783 states and 5309 transitions. [2021-01-06 20:53:37,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 20:53:37,117 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:37,117 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 20:53:37,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 20:53:37,117 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:37,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:37,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1183434290, now seen corresponding path program 1 times [2021-01-06 20:53:37,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:37,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897366149] [2021-01-06 20:53:37,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:37,271 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 20:53:37,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897366149] [2021-01-06 20:53:37,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:37,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 20:53:37,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469862513] [2021-01-06 20:53:37,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 20:53:37,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:37,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 20:53:37,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 20:53:37,273 INFO L87 Difference]: Start difference. First operand 3783 states and 5309 transitions. Second operand 6 states. [2021-01-06 20:53:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:39,884 INFO L93 Difference]: Finished difference Result 6603 states and 9149 transitions. [2021-01-06 20:53:39,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 20:53:39,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2021-01-06 20:53:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:39,911 INFO L225 Difference]: With dead ends: 6603 [2021-01-06 20:53:39,912 INFO L226 Difference]: Without dead ends: 6601 [2021-01-06 20:53:39,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:53:39,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6601 states. [2021-01-06 20:53:41,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6601 to 3927. [2021-01-06 20:53:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3927 states. [2021-01-06 20:53:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3927 states to 3927 states and 5421 transitions. [2021-01-06 20:53:41,488 INFO L78 Accepts]: Start accepts. Automaton has 3927 states and 5421 transitions. Word has length 77 [2021-01-06 20:53:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:41,488 INFO L481 AbstractCegarLoop]: Abstraction has 3927 states and 5421 transitions. [2021-01-06 20:53:41,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 20:53:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3927 states and 5421 transitions. [2021-01-06 20:53:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 20:53:41,489 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:41,490 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 20:53:41,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 20:53:41,490 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:41,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:41,490 INFO L82 PathProgramCache]: Analyzing trace with hash -696816699, now seen corresponding path program 1 times [2021-01-06 20:53:41,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:41,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233472567] [2021-01-06 20:53:41,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:41,595 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 20:53:41,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233472567] [2021-01-06 20:53:41,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:41,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:53:41,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708102318] [2021-01-06 20:53:41,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:53:41,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:41,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:53:41,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:53:41,597 INFO L87 Difference]: Start difference. First operand 3927 states and 5421 transitions. Second operand 5 states. [2021-01-06 20:53:43,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:43,929 INFO L93 Difference]: Finished difference Result 7855 states and 10889 transitions. [2021-01-06 20:53:43,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:53:43,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2021-01-06 20:53:43,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:43,946 INFO L225 Difference]: With dead ends: 7855 [2021-01-06 20:53:43,947 INFO L226 Difference]: Without dead ends: 6445 [2021-01-06 20:53:43,951 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:53:43,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6445 states. [2021-01-06 20:53:45,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6445 to 4911. [2021-01-06 20:53:45,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4911 states. [2021-01-06 20:53:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4911 states to 4911 states and 6781 transitions. [2021-01-06 20:53:45,899 INFO L78 Accepts]: Start accepts. Automaton has 4911 states and 6781 transitions. Word has length 77 [2021-01-06 20:53:45,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:45,900 INFO L481 AbstractCegarLoop]: Abstraction has 4911 states and 6781 transitions. [2021-01-06 20:53:45,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:53:45,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4911 states and 6781 transitions. [2021-01-06 20:53:45,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 20:53:45,901 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:45,901 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:53:45,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 20:53:45,901 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:45,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:45,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1657778714, now seen corresponding path program 1 times [2021-01-06 20:53:45,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:45,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698322613] [2021-01-06 20:53:45,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:45,945 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 20:53:45,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698322613] [2021-01-06 20:53:45,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:45,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:53:45,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815882266] [2021-01-06 20:53:45,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:53:45,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:45,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:53:45,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:53:45,947 INFO L87 Difference]: Start difference. First operand 4911 states and 6781 transitions. Second operand 3 states. [2021-01-06 20:53:48,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:48,851 INFO L93 Difference]: Finished difference Result 12755 states and 17595 transitions. [2021-01-06 20:53:48,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:53:48,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2021-01-06 20:53:48,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:48,866 INFO L225 Difference]: With dead ends: 12755 [2021-01-06 20:53:48,866 INFO L226 Difference]: Without dead ends: 7921 [2021-01-06 20:53:48,874 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 20:53:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7921 states. [2021-01-06 20:53:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7921 to 7311. [2021-01-06 20:53:51,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7311 states. [2021-01-06 20:53:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7311 states to 7311 states and 9909 transitions. [2021-01-06 20:53:51,850 INFO L78 Accepts]: Start accepts. Automaton has 7311 states and 9909 transitions. Word has length 78 [2021-01-06 20:53:51,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:51,850 INFO L481 AbstractCegarLoop]: Abstraction has 7311 states and 9909 transitions. [2021-01-06 20:53:51,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:53:51,850 INFO L276 IsEmpty]: Start isEmpty. Operand 7311 states and 9909 transitions. [2021-01-06 20:53:51,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 20:53:51,858 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:51,858 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 20:53:51,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 20:53:51,859 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:51,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:51,859 INFO L82 PathProgramCache]: Analyzing trace with hash 910821393, now seen corresponding path program 1 times [2021-01-06 20:53:51,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:51,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752452154] [2021-01-06 20:53:51,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:53:51,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752452154] [2021-01-06 20:53:51,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:53:51,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:53:51,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496487468] [2021-01-06 20:53:51,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:53:51,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:51,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:53:51,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:53:51,943 INFO L87 Difference]: Start difference. First operand 7311 states and 9909 transitions. Second operand 3 states. [2021-01-06 20:53:54,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:53:54,576 INFO L93 Difference]: Finished difference Result 14433 states and 19573 transitions. [2021-01-06 20:53:54,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:53:54,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2021-01-06 20:53:54,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:53:54,597 INFO L225 Difference]: With dead ends: 14433 [2021-01-06 20:53:54,597 INFO L226 Difference]: Without dead ends: 7199 [2021-01-06 20:53:54,606 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 20:53:54,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7199 states. [2021-01-06 20:53:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7199 to 7197. [2021-01-06 20:53:57,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7197 states. [2021-01-06 20:53:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7197 states to 7197 states and 9589 transitions. [2021-01-06 20:53:57,508 INFO L78 Accepts]: Start accepts. Automaton has 7197 states and 9589 transitions. Word has length 99 [2021-01-06 20:53:57,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:53:57,509 INFO L481 AbstractCegarLoop]: Abstraction has 7197 states and 9589 transitions. [2021-01-06 20:53:57,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:53:57,509 INFO L276 IsEmpty]: Start isEmpty. Operand 7197 states and 9589 transitions. [2021-01-06 20:53:57,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 20:53:57,511 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:53:57,511 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2021-01-06 20:53:57,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 20:53:57,512 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:53:57,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:53:57,512 INFO L82 PathProgramCache]: Analyzing trace with hash 412335050, now seen corresponding path program 1 times [2021-01-06 20:53:57,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:53:57,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080985196] [2021-01-06 20:53:57,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:53:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:57,735 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:53:57,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080985196] [2021-01-06 20:53:57,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114105048] [2021-01-06 20:53:57,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 20:53:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:53:57,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 20:53:57,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 20:53:58,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 20:53:58,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 20:53:58,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 20:53:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:53:58,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 20:53:58,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2021-01-06 20:53:58,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155444946] [2021-01-06 20:53:58,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 20:53:58,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:53:58,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 20:53:58,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-01-06 20:53:58,816 INFO L87 Difference]: Start difference. First operand 7197 states and 9589 transitions. Second operand 18 states. [2021-01-06 20:53:59,509 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2021-01-06 20:54:03,076 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2021-01-06 20:54:04,928 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-01-06 20:54:30,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:30,517 INFO L93 Difference]: Finished difference Result 61925 states and 81496 transitions. [2021-01-06 20:54:30,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-01-06 20:54:30,518 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 99 [2021-01-06 20:54:30,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:30,649 INFO L225 Difference]: With dead ends: 61925 [2021-01-06 20:54:30,650 INFO L226 Difference]: Without dead ends: 54805 [2021-01-06 20:54:30,675 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1537, Invalid=6653, Unknown=0, NotChecked=0, Total=8190 [2021-01-06 20:54:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54805 states. [2021-01-06 20:54:38,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54805 to 15407. [2021-01-06 20:54:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15407 states. [2021-01-06 20:54:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15407 states to 15407 states and 20393 transitions. [2021-01-06 20:54:38,452 INFO L78 Accepts]: Start accepts. Automaton has 15407 states and 20393 transitions. Word has length 99 [2021-01-06 20:54:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:38,452 INFO L481 AbstractCegarLoop]: Abstraction has 15407 states and 20393 transitions. [2021-01-06 20:54:38,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 20:54:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 15407 states and 20393 transitions. [2021-01-06 20:54:38,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 20:54:38,456 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:38,456 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2021-01-06 20:54:38,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-01-06 20:54:38,672 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:38,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:38,673 INFO L82 PathProgramCache]: Analyzing trace with hash 667868883, now seen corresponding path program 1 times [2021-01-06 20:54:38,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:38,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293221965] [2021-01-06 20:54:38,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 20:54:38,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293221965] [2021-01-06 20:54:38,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:38,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:54:38,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871972482] [2021-01-06 20:54:38,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:54:38,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:38,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:54:38,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:54:38,728 INFO L87 Difference]: Start difference. First operand 15407 states and 20393 transitions. Second operand 3 states. [2021-01-06 20:54:44,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:44,889 INFO L93 Difference]: Finished difference Result 29409 states and 39126 transitions. [2021-01-06 20:54:44,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:54:44,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 20:54:44,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:44,915 INFO L225 Difference]: With dead ends: 29409 [2021-01-06 20:54:44,915 INFO L226 Difference]: Without dead ends: 14093 [2021-01-06 20:54:44,933 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 20:54:44,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14093 states. [2021-01-06 20:54:51,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14093 to 14093. [2021-01-06 20:54:51,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14093 states. [2021-01-06 20:54:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14093 states to 14093 states and 18595 transitions. [2021-01-06 20:54:51,257 INFO L78 Accepts]: Start accepts. Automaton has 14093 states and 18595 transitions. Word has length 100 [2021-01-06 20:54:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:51,257 INFO L481 AbstractCegarLoop]: Abstraction has 14093 states and 18595 transitions. [2021-01-06 20:54:51,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:54:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 14093 states and 18595 transitions. [2021-01-06 20:54:51,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 20:54:51,261 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:51,261 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2021-01-06 20:54:51,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 20:54:51,262 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:54:51,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:51,262 INFO L82 PathProgramCache]: Analyzing trace with hash -548192524, now seen corresponding path program 1 times [2021-01-06 20:54:51,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:51,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704225241] [2021-01-06 20:54:51,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:54:51,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704225241] [2021-01-06 20:54:51,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702790419] [2021-01-06 20:54:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 20:54:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:51,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 18 conjunts are in the unsatisfiable core [2021-01-06 20:54:51,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 20:54:51,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 20:54:51,897 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 20:54:52,039 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 20:54:52,416 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 29 [2021-01-06 20:54:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:54:52,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 20:54:52,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2021-01-06 20:54:52,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037131692] [2021-01-06 20:54:52,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 20:54:52,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:52,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 20:54:52,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:54:52,675 INFO L87 Difference]: Start difference. First operand 14093 states and 18595 transitions. Second operand 19 states. [2021-01-06 20:54:55,191 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2021-01-06 20:54:55,414 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2021-01-06 20:54:55,764 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2021-01-06 20:54:55,918 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2021-01-06 20:54:56,136 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2021-01-06 20:54:56,537 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2021-01-06 20:54:56,756 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2021-01-06 20:54:57,474 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2021-01-06 20:54:58,052 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2021-01-06 20:54:58,796 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2021-01-06 20:54:59,012 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2021-01-06 20:54:59,203 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2021-01-06 20:54:59,542 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2021-01-06 20:54:59,848 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2021-01-06 20:55:00,046 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2021-01-06 20:55:00,202 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-01-06 20:55:00,772 WARN L197 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2021-01-06 20:55:01,009 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2021-01-06 20:55:01,416 WARN L197 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2021-01-06 20:55:01,631 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2021-01-06 20:55:02,034 WARN L197 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2021-01-06 20:55:02,223 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2021-01-06 20:55:02,406 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-01-06 20:55:03,129 WARN L197 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2021-01-06 20:55:03,328 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2021-01-06 20:55:03,741 WARN L197 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2021-01-06 20:55:03,934 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2021-01-06 20:55:04,348 WARN L197 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2021-01-06 20:55:04,594 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2021-01-06 20:55:05,054 WARN L197 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-01-06 20:55:05,267 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2021-01-06 20:55:06,208 WARN L197 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2021-01-06 20:55:06,375 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2021-01-06 20:55:07,445 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2021-01-06 20:55:07,623 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2021-01-06 20:55:08,334 WARN L197 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2021-01-06 20:55:08,890 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2021-01-06 20:55:09,787 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2021-01-06 20:55:10,910 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2021-01-06 20:55:11,189 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2021-01-06 20:55:11,476 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2021-01-06 20:55:12,301 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2021-01-06 20:55:12,760 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2021-01-06 20:55:15,146 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2021-01-06 20:55:15,374 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 34 [2021-01-06 20:55:15,898 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-01-06 20:55:16,080 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2021-01-06 20:55:16,719 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2021-01-06 20:55:16,970 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2021-01-06 20:55:17,797 WARN L197 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2021-01-06 20:55:17,964 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2021-01-06 20:55:18,309 WARN L197 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2021-01-06 20:55:18,480 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2021-01-06 20:55:18,750 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2021-01-06 20:55:19,516 WARN L197 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2021-01-06 20:55:19,691 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2021-01-06 20:55:20,093 WARN L197 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2021-01-06 20:55:20,319 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-01-06 20:55:20,615 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2021-01-06 20:55:20,822 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2021-01-06 20:55:21,741 WARN L197 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2021-01-06 20:55:25,190 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2021-01-06 20:55:25,513 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2021-01-06 20:55:25,961 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2021-01-06 20:55:26,107 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2021-01-06 20:55:26,406 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2021-01-06 20:55:26,816 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2021-01-06 20:55:26,983 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2021-01-06 20:55:27,290 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 31 [2021-01-06 20:55:28,107 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2021-01-06 20:55:29,876 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2021-01-06 20:55:30,571 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 33 [2021-01-06 20:55:30,747 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2021-01-06 20:55:32,099 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2021-01-06 20:55:32,583 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2021-01-06 20:55:32,984 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 28 [2021-01-06 20:55:33,374 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 28 [2021-01-06 20:55:34,359 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2021-01-06 20:55:34,795 WARN L197 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2021-01-06 20:55:35,005 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2021-01-06 20:55:35,349 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2021-01-06 20:55:35,890 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2021-01-06 20:55:36,107 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2021-01-06 20:55:36,349 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2021-01-06 20:55:36,710 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2021-01-06 20:55:37,206 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2021-01-06 20:55:37,422 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2021-01-06 20:55:37,628 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2021-01-06 20:55:38,190 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2021-01-06 20:55:42,293 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2021-01-06 20:55:42,551 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2021-01-06 20:55:45,799 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2021-01-06 20:55:46,364 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2021-01-06 20:55:47,012 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2021-01-06 20:55:47,963 WARN L197 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2021-01-06 20:55:48,306 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2021-01-06 20:55:49,165 WARN L197 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2021-01-06 20:55:53,275 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2021-01-06 20:55:54,012 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2021-01-06 20:55:57,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:57,715 INFO L93 Difference]: Finished difference Result 72283 states and 93214 transitions. [2021-01-06 20:55:57,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2021-01-06 20:55:57,717 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 100 [2021-01-06 20:55:57,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:57,788 INFO L225 Difference]: With dead ends: 72283 [2021-01-06 20:55:57,788 INFO L226 Difference]: Without dead ends: 58281 [2021-01-06 20:55:57,817 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14869 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=5556, Invalid=31500, Unknown=0, NotChecked=0, Total=37056 [2021-01-06 20:55:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58281 states. [2021-01-06 20:56:11,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58281 to 27251. [2021-01-06 20:56:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27251 states. [2021-01-06 20:56:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27251 states to 27251 states and 35799 transitions. [2021-01-06 20:56:11,322 INFO L78 Accepts]: Start accepts. Automaton has 27251 states and 35799 transitions. Word has length 100 [2021-01-06 20:56:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:11,322 INFO L481 AbstractCegarLoop]: Abstraction has 27251 states and 35799 transitions. [2021-01-06 20:56:11,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 20:56:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 27251 states and 35799 transitions. [2021-01-06 20:56:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 20:56:11,327 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:11,328 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2021-01-06 20:56:11,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-01-06 20:56:11,543 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:56:11,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:11,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1094222321, now seen corresponding path program 1 times [2021-01-06 20:56:11,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:11,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879492907] [2021-01-06 20:56:11,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:12,304 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:12,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879492907] [2021-01-06 20:56:12,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495304122] [2021-01-06 20:56:12,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 20:56:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:12,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 20:56:12,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 20:56:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 20:56:13,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 20:56:13,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 19 [2021-01-06 20:56:13,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825671381] [2021-01-06 20:56:13,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 20:56:13,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:13,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 20:56:13,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:56:13,033 INFO L87 Difference]: Start difference. First operand 27251 states and 35799 transitions. Second operand 19 states. [2021-01-06 20:56:13,384 WARN L197 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2021-01-06 20:56:14,115 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2021-01-06 20:56:14,386 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2021-01-06 20:56:14,653 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2021-01-06 20:56:14,901 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2021-01-06 20:56:15,167 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2021-01-06 20:56:16,639 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2021-01-06 20:56:17,024 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2021-01-06 20:56:17,498 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2021-01-06 20:56:17,996 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2021-01-06 20:56:18,909 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2021-01-06 20:56:19,658 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2021-01-06 20:56:20,338 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2021-01-06 20:56:20,602 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2021-01-06 20:56:21,254 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2021-01-06 20:56:21,565 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2021-01-06 20:56:21,854 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2021-01-06 20:56:22,055 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2021-01-06 20:56:23,942 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2021-01-06 20:56:24,226 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2021-01-06 20:56:24,514 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2021-01-06 20:56:30,984 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2021-01-06 20:56:31,375 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2021-01-06 20:56:32,124 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2021-01-06 20:56:32,419 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2021-01-06 20:56:32,770 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2021-01-06 20:56:39,250 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2021-01-06 20:56:40,055 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2021-01-06 20:56:40,893 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2021-01-06 20:56:41,108 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2021-01-06 20:56:41,933 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2021-01-06 20:56:42,756 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2021-01-06 20:56:43,663 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2021-01-06 20:56:47,678 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2021-01-06 20:56:48,054 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2021-01-06 20:56:48,360 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2021-01-06 20:56:49,407 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2021-01-06 20:56:50,622 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57