/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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 20:54:31,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 20:54:31,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 20:54:31,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 20:54:31,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 20:54:31,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 20:54:31,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 20:54:31,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 20:54:31,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 20:54:31,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 20:54:31,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 20:54:31,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 20:54:31,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 20:54:31,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 20:54:31,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 20:54:31,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 20:54:31,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 20:54:31,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 20:54:31,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 20:54:31,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 20:54:31,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 20:54:31,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 20:54:31,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 20:54:31,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 20:54:31,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 20:54:31,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 20:54:31,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 20:54:31,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 20:54:31,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 20:54:31,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 20:54:31,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 20:54:31,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 20:54:31,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 20:54:31,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 20:54:31,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 20:54:31,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 20:54:31,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 20:54:31,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 20:54:31,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 20:54:31,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 20:54:31,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 20:54:31,469 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:54:31,515 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 20:54:31,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 20:54:31,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 20:54:31,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 20:54:31,521 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 20:54:31,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 20:54:31,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 20:54:31,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 20:54:31,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 20:54:31,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 20:54:31,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 20:54:31,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 20:54:31,523 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 20:54:31,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 20:54:31,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 20:54:31,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 20:54:31,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 20:54:31,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:54:31,527 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 20:54:31,527 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 20:54:31,527 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 20:54:31,528 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 20:54:31,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 20:54:31,528 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 20:54:31,528 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 20:54:31,528 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:54:32,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 20:54:32,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 20:54:32,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 20:54:32,207 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 20:54:32,208 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 20:54:32,210 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2021-01-06 20:54:32,320 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/35c4605a9/24a87b8eeef8478c80dd4eb0bd6b4f0b/FLAG600d5cfd6 [2021-01-06 20:54:33,357 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 20:54:33,360 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2021-01-06 20:54:33,386 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/35c4605a9/24a87b8eeef8478c80dd4eb0bd6b4f0b/FLAG600d5cfd6 [2021-01-06 20:54:33,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/35c4605a9/24a87b8eeef8478c80dd4eb0bd6b4f0b [2021-01-06 20:54:33,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 20:54:33,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 20:54:33,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 20:54:33,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 20:54:33,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 20:54:33,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:54:33" (1/1) ... [2021-01-06 20:54:33,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1ad975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:54:33, skipping insertion in model container [2021-01-06 20:54:33,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:54:33" (1/1) ... [2021-01-06 20:54:33,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 20:54:34,029 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_94~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_412~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[~main__i2~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[~st1~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[~st2~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[~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~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_1163~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1164_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~1,] [2021-01-06 20:54:34,378 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[5793,5806] left hand side expression in assignment: lhs: VariableLHS[~__tmp_795_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_949_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_744_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_983_0~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~2,] left hand side expression in assignment: lhs: VariableLHS[~__return_398~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,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] 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[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_983_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~1,] 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[~st2~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[~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_1054~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:54:34,433 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[8778,8791] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_854_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_649_0~0,GLOBAL] 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~3,] 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[~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_384~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,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~3,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~3,] 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[~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[~st2~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[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_949_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~2,] 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_962~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:54:34,464 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[11837,11850] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_588_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_813_0~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[~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_370~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,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~4,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~4,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_813_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~3,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~4,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~4,] 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[~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[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_854_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~3,] 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_870~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:54:34,493 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[14724,14737] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_504_0~0,GLOBAL] 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~5,] 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[~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~8,] left hand side expression in assignment: lhs: VariableLHS[~__return_356~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,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~5,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~5,] 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[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~6,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~6,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_744_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~7,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~7,] 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[~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_786~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,] [2021-01-06 20:54:34,552 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[17939,17952] left hand side expression in assignment: lhs: VariableLHS[~__tmp_795_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_544_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_600_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_637_0~0,GLOBAL] 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~10,] left hand side expression in assignment: lhs: VariableLHS[~__return_342~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~6,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~6,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_637_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~6,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~7,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~7,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_649_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~6,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~8,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~8,] 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[~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~11,] left hand side expression in assignment: lhs: VariableLHS[~__return_694~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,] [2021-01-06 20:54:34,630 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[21031,21044] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_516_0~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[~node3__m3~9,] 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~12,] left hand side expression in assignment: lhs: VariableLHS[~__return_328~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~7,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~7,] 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[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~8,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~8,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_588_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~7,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~10,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~10,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_600_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~7,] 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_616~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,] [2021-01-06 20:54:34,657 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[24082,24095] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_492_0~0,GLOBAL] 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_314~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~8,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~8,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_492_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~8,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~9,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~9,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_504_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~8,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~11,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~11,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_516_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~8,] 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_535~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,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_544_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~9,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~9,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~9,] 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[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~10,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~10,] 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[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~12,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~12,] 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[~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~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~__return_1310~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1164_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~4,] 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[~node2____CPAchecker_TMP_0~2,] 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[~node1____CPAchecker_TMP_0~1,] 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[~__return_1176~0,GLOBAL] [2021-01-06 20:54:34,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:54:34,762 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_94~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_412~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[~main__i2~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[~st1~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[~st2~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[~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~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_1163~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1164_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~1,] [2021-01-06 20:54:34,881 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[5793,5806] left hand side expression in assignment: lhs: VariableLHS[~__tmp_795_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_949_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_744_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_983_0~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~2,] left hand side expression in assignment: lhs: VariableLHS[~__return_398~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,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] 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[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_983_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~1,] 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[~st2~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[~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_1054~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:54:34,952 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[8778,8791] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_854_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_649_0~0,GLOBAL] 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~3,] 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[~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_384~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,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~3,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~3,] 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[~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[~st2~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[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_949_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~2,] 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_962~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:54:34,994 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[11837,11850] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_588_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_813_0~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[~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_370~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,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~4,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~4,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_813_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~3,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~4,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~4,] 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[~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[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_854_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~3,] 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_870~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:54:35,045 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[14724,14737] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_504_0~0,GLOBAL] 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~5,] 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[~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~8,] left hand side expression in assignment: lhs: VariableLHS[~__return_356~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,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~5,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~5,] 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[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~6,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~6,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_744_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~7,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~7,] 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[~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_786~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,] [2021-01-06 20:54:35,079 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[17939,17952] left hand side expression in assignment: lhs: VariableLHS[~__tmp_795_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~4,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_544_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_600_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_637_0~0,GLOBAL] 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~10,] left hand side expression in assignment: lhs: VariableLHS[~__return_342~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~6,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~6,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_637_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~6,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~7,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~7,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_649_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~6,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~8,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~8,] 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[~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~11,] left hand side expression in assignment: lhs: VariableLHS[~__return_694~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,] [2021-01-06 20:54:35,106 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[21031,21044] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_516_0~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[~node3__m3~9,] 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~12,] left hand side expression in assignment: lhs: VariableLHS[~__return_328~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~7,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~7,] 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[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~8,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~8,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_588_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~7,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~10,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~10,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_600_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~7,] 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_616~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,] [2021-01-06 20:54:35,129 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[24082,24095] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_492_0~0,GLOBAL] 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_314~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~8,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~8,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_492_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~8,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~9,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~9,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_504_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~8,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~11,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~11,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__tmp_516_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~8,] 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_535~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,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_544_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~9,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~9,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~9,] 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[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~10,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~10,] 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[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~12,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~12,] 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[~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~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~__return_1310~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1164_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~4,] 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[~node2____CPAchecker_TMP_0~2,] 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[~node1____CPAchecker_TMP_0~1,] 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[~__return_1176~0,GLOBAL] [2021-01-06 20:54:35,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:54:35,258 INFO L208 MainTranslator]: Completed translation [2021-01-06 20:54:35,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:54:35 WrapperNode [2021-01-06 20:54:35,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 20:54:35,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 20:54:35,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 20:54:35,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 20:54:35,278 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:54:35" (1/1) ... [2021-01-06 20:54:35,333 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:54:35" (1/1) ... [2021-01-06 20:54:35,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 20:54:35,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 20:54:35,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 20:54:35,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 20:54:35,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:54:35" (1/1) ... [2021-01-06 20:54:35,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:54:35" (1/1) ... [2021-01-06 20:54:35,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:54:35" (1/1) ... [2021-01-06 20:54:35,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:54:35" (1/1) ... [2021-01-06 20:54:35,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:54:35" (1/1) ... [2021-01-06 20:54:35,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:54:35" (1/1) ... [2021-01-06 20:54:35,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:54:35" (1/1) ... [2021-01-06 20:54:35,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 20:54:35,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 20:54:35,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 20:54:35,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 20:54:35,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:54:35" (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:54:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 20:54:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 20:54:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 20:54:35,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 20:54:37,401 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 20:54:37,402 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 20:54:37,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:54:37 BoogieIcfgContainer [2021-01-06 20:54:37,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 20:54:37,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 20:54:37,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 20:54:37,414 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 20:54:37,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 08:54:33" (1/3) ... [2021-01-06 20:54:37,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d31efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:54:37, skipping insertion in model container [2021-01-06 20:54:37,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:54:35" (2/3) ... [2021-01-06 20:54:37,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d31efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:54:37, skipping insertion in model container [2021-01-06 20:54:37,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:54:37" (3/3) ... [2021-01-06 20:54:37,420 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2021-01-06 20:54:37,431 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 20:54:37,438 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2021-01-06 20:54:37,467 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-01-06 20:54:37,511 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 20:54:37,512 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 20:54:37,512 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 20:54:37,512 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 20:54:37,512 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 20:54:37,513 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 20:54:37,513 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 20:54:37,513 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 20:54:37,547 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states. [2021-01-06 20:54:37,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 20:54:37,563 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:37,564 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:54:37,565 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:54:37,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:37,575 INFO L82 PathProgramCache]: Analyzing trace with hash -506083603, now seen corresponding path program 1 times [2021-01-06 20:54:37,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:37,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180038482] [2021-01-06 20:54:37,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:38,178 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:54:38,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180038482] [2021-01-06 20:54:38,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:38,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:54:38,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379404448] [2021-01-06 20:54:38,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:54:38,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:38,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:54:38,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:54:38,215 INFO L87 Difference]: Start difference. First operand 279 states. Second operand 5 states. [2021-01-06 20:54:38,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:38,841 INFO L93 Difference]: Finished difference Result 392 states and 660 transitions. [2021-01-06 20:54:38,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:54:38,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2021-01-06 20:54:38,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:38,867 INFO L225 Difference]: With dead ends: 392 [2021-01-06 20:54:38,867 INFO L226 Difference]: Without dead ends: 244 [2021-01-06 20:54:38,874 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:54:38,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-01-06 20:54:38,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2021-01-06 20:54:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2021-01-06 20:54:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 300 transitions. [2021-01-06 20:54:39,013 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 300 transitions. Word has length 48 [2021-01-06 20:54:39,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:39,014 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 300 transitions. [2021-01-06 20:54:39,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:54:39,015 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 300 transitions. [2021-01-06 20:54:39,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 20:54:39,019 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:39,019 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:54:39,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 20:54:39,020 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:54:39,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:39,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1206513712, now seen corresponding path program 1 times [2021-01-06 20:54:39,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:39,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354830604] [2021-01-06 20:54:39,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:39,242 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:54:39,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354830604] [2021-01-06 20:54:39,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:39,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:54:39,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429659106] [2021-01-06 20:54:39,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:54:39,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:39,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:54:39,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:54:39,252 INFO L87 Difference]: Start difference. First operand 244 states and 300 transitions. Second operand 5 states. [2021-01-06 20:54:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:39,519 INFO L93 Difference]: Finished difference Result 312 states and 387 transitions. [2021-01-06 20:54:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:54:39,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2021-01-06 20:54:39,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:39,523 INFO L225 Difference]: With dead ends: 312 [2021-01-06 20:54:39,523 INFO L226 Difference]: Without dead ends: 186 [2021-01-06 20:54:39,526 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:54:39,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-01-06 20:54:39,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-01-06 20:54:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2021-01-06 20:54:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 227 transitions. [2021-01-06 20:54:39,548 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 227 transitions. Word has length 48 [2021-01-06 20:54:39,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:39,548 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 227 transitions. [2021-01-06 20:54:39,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:54:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2021-01-06 20:54:39,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 20:54:39,551 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:39,552 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:54:39,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 20:54:39,552 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:54:39,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:39,554 INFO L82 PathProgramCache]: Analyzing trace with hash 731649800, now seen corresponding path program 1 times [2021-01-06 20:54:39,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:39,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774505012] [2021-01-06 20:54:39,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:39,781 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:54:39,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774505012] [2021-01-06 20:54:39,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:39,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:54:39,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972501254] [2021-01-06 20:54:39,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:54:39,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:39,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:54:39,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:54:39,786 INFO L87 Difference]: Start difference. First operand 186 states and 227 transitions. Second operand 5 states. [2021-01-06 20:54:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:39,979 INFO L93 Difference]: Finished difference Result 266 states and 332 transitions. [2021-01-06 20:54:39,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:54:39,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2021-01-06 20:54:39,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:39,995 INFO L225 Difference]: With dead ends: 266 [2021-01-06 20:54:39,995 INFO L226 Difference]: Without dead ends: 163 [2021-01-06 20:54:40,000 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:54:40,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-01-06 20:54:40,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-01-06 20:54:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-06 20:54:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 199 transitions. [2021-01-06 20:54:40,049 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 199 transitions. Word has length 48 [2021-01-06 20:54:40,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:40,050 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 199 transitions. [2021-01-06 20:54:40,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:54:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 199 transitions. [2021-01-06 20:54:40,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 20:54:40,052 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:40,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:54:40,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 20:54:40,058 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:54:40,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:40,059 INFO L82 PathProgramCache]: Analyzing trace with hash 613838546, now seen corresponding path program 1 times [2021-01-06 20:54:40,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:40,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074660351] [2021-01-06 20:54:40,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:40,309 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:54:40,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074660351] [2021-01-06 20:54:40,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:40,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 20:54:40,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899953701] [2021-01-06 20:54:40,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 20:54:40,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:40,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 20:54:40,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-01-06 20:54:40,321 INFO L87 Difference]: Start difference. First operand 163 states and 199 transitions. Second operand 8 states. [2021-01-06 20:54:40,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:40,804 INFO L93 Difference]: Finished difference Result 326 states and 405 transitions. [2021-01-06 20:54:40,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 20:54:40,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2021-01-06 20:54:40,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:40,807 INFO L225 Difference]: With dead ends: 326 [2021-01-06 20:54:40,807 INFO L226 Difference]: Without dead ends: 239 [2021-01-06 20:54:40,809 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:54:40,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-01-06 20:54:40,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 163. [2021-01-06 20:54:40,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-06 20:54:40,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 198 transitions. [2021-01-06 20:54:40,841 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 198 transitions. Word has length 50 [2021-01-06 20:54:40,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:40,842 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 198 transitions. [2021-01-06 20:54:40,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 20:54:40,842 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 198 transitions. [2021-01-06 20:54:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 20:54:40,844 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:40,844 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] [2021-01-06 20:54:40,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 20:54:40,845 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:54:40,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:40,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1717096174, now seen corresponding path program 1 times [2021-01-06 20:54:40,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:40,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435582615] [2021-01-06 20:54:40,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:41,120 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:54:41,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435582615] [2021-01-06 20:54:41,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:41,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:54:41,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714841991] [2021-01-06 20:54:41,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:54:41,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:41,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:54:41,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:54:41,124 INFO L87 Difference]: Start difference. First operand 163 states and 198 transitions. Second operand 9 states. [2021-01-06 20:54:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:41,980 INFO L93 Difference]: Finished difference Result 343 states and 441 transitions. [2021-01-06 20:54:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 20:54:41,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2021-01-06 20:54:41,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:41,984 INFO L225 Difference]: With dead ends: 343 [2021-01-06 20:54:41,984 INFO L226 Difference]: Without dead ends: 337 [2021-01-06 20:54:41,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2021-01-06 20:54:41,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-01-06 20:54:42,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 163. [2021-01-06 20:54:42,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-06 20:54:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 197 transitions. [2021-01-06 20:54:42,005 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 197 transitions. Word has length 50 [2021-01-06 20:54:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:42,006 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 197 transitions. [2021-01-06 20:54:42,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:54:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 197 transitions. [2021-01-06 20:54:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 20:54:42,008 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:42,008 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] [2021-01-06 20:54:42,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 20:54:42,008 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:54:42,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:42,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1648014290, now seen corresponding path program 1 times [2021-01-06 20:54:42,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:42,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920565113] [2021-01-06 20:54:42,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:42,223 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:54:42,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920565113] [2021-01-06 20:54:42,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:42,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:54:42,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880631220] [2021-01-06 20:54:42,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:54:42,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:42,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:54:42,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:54:42,227 INFO L87 Difference]: Start difference. First operand 163 states and 197 transitions. Second operand 9 states. [2021-01-06 20:54:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:42,894 INFO L93 Difference]: Finished difference Result 403 states and 525 transitions. [2021-01-06 20:54:42,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 20:54:42,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2021-01-06 20:54:42,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:42,897 INFO L225 Difference]: With dead ends: 403 [2021-01-06 20:54:42,898 INFO L226 Difference]: Without dead ends: 341 [2021-01-06 20:54:42,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2021-01-06 20:54:42,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-01-06 20:54:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 163. [2021-01-06 20:54:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-06 20:54:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 196 transitions. [2021-01-06 20:54:42,920 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 196 transitions. Word has length 50 [2021-01-06 20:54:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:42,920 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 196 transitions. [2021-01-06 20:54:42,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:54:42,921 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 196 transitions. [2021-01-06 20:54:42,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 20:54:42,921 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:42,922 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:54:42,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 20:54:42,922 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:54:42,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:42,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1708755507, now seen corresponding path program 1 times [2021-01-06 20:54:42,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:42,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574320328] [2021-01-06 20:54:42,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:43,355 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:54:43,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574320328] [2021-01-06 20:54:43,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:43,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 20:54:43,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819481743] [2021-01-06 20:54:43,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 20:54:43,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:43,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 20:54:43,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-01-06 20:54:43,359 INFO L87 Difference]: Start difference. First operand 163 states and 196 transitions. Second operand 12 states. [2021-01-06 20:54:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:44,484 INFO L93 Difference]: Finished difference Result 486 states and 647 transitions. [2021-01-06 20:54:44,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 20:54:44,485 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2021-01-06 20:54:44,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:44,489 INFO L225 Difference]: With dead ends: 486 [2021-01-06 20:54:44,489 INFO L226 Difference]: Without dead ends: 431 [2021-01-06 20:54:44,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:54:44,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-01-06 20:54:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 151. [2021-01-06 20:54:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-01-06 20:54:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 182 transitions. [2021-01-06 20:54:44,529 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 182 transitions. Word has length 51 [2021-01-06 20:54:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:44,529 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 182 transitions. [2021-01-06 20:54:44,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 20:54:44,529 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 182 transitions. [2021-01-06 20:54:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 20:54:44,530 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:44,531 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:54:44,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 20:54:44,532 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:54:44,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:44,534 INFO L82 PathProgramCache]: Analyzing trace with hash 871420535, now seen corresponding path program 1 times [2021-01-06 20:54:44,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:44,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922215016] [2021-01-06 20:54:44,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:45,229 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:54:45,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922215016] [2021-01-06 20:54:45,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:45,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-01-06 20:54:45,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42616205] [2021-01-06 20:54:45,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 20:54:45,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:45,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 20:54:45,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:54:45,247 INFO L87 Difference]: Start difference. First operand 151 states and 182 transitions. Second operand 19 states. [2021-01-06 20:54:45,489 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2021-01-06 20:54:46,064 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2021-01-06 20:54:47,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:47,814 INFO L93 Difference]: Finished difference Result 405 states and 503 transitions. [2021-01-06 20:54:47,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 20:54:47,815 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2021-01-06 20:54:47,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:47,819 INFO L225 Difference]: With dead ends: 405 [2021-01-06 20:54:47,819 INFO L226 Difference]: Without dead ends: 401 [2021-01-06 20:54:47,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=202, Invalid=920, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 20:54:47,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-01-06 20:54:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 162. [2021-01-06 20:54:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2021-01-06 20:54:47,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 198 transitions. [2021-01-06 20:54:47,849 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 198 transitions. Word has length 52 [2021-01-06 20:54:47,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:47,851 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 198 transitions. [2021-01-06 20:54:47,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 20:54:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 198 transitions. [2021-01-06 20:54:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 20:54:47,852 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:47,853 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:54:47,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 20:54:47,853 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:54:47,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:47,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1375412663, now seen corresponding path program 1 times [2021-01-06 20:54:47,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:47,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422893274] [2021-01-06 20:54:47,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:48,540 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:54:48,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422893274] [2021-01-06 20:54:48,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:48,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-01-06 20:54:48,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266459584] [2021-01-06 20:54:48,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 20:54:48,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:48,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 20:54:48,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:54:48,543 INFO L87 Difference]: Start difference. First operand 162 states and 198 transitions. Second operand 19 states. [2021-01-06 20:54:48,751 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2021-01-06 20:54:49,302 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2021-01-06 20:54:49,809 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2021-01-06 20:54:51,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:51,003 INFO L93 Difference]: Finished difference Result 440 states and 558 transitions. [2021-01-06 20:54:51,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 20:54:51,004 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2021-01-06 20:54:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:51,008 INFO L225 Difference]: With dead ends: 440 [2021-01-06 20:54:51,009 INFO L226 Difference]: Without dead ends: 393 [2021-01-06 20:54:51,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 20:54:51,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-01-06 20:54:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 169. [2021-01-06 20:54:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2021-01-06 20:54:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 207 transitions. [2021-01-06 20:54:51,040 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 207 transitions. Word has length 52 [2021-01-06 20:54:51,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:51,040 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 207 transitions. [2021-01-06 20:54:51,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 20:54:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 207 transitions. [2021-01-06 20:54:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 20:54:51,041 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:51,041 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:54:51,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 20:54:51,042 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:54:51,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:51,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1993375358, now seen corresponding path program 1 times [2021-01-06 20:54:51,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:51,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101515272] [2021-01-06 20:54:51,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:54:51,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101515272] [2021-01-06 20:54:51,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:51,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 20:54:51,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190539836] [2021-01-06 20:54:51,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 20:54:51,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:51,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 20:54:51,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-01-06 20:54:51,525 INFO L87 Difference]: Start difference. First operand 169 states and 207 transitions. Second operand 12 states. [2021-01-06 20:54:52,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:52,554 INFO L93 Difference]: Finished difference Result 303 states and 380 transitions. [2021-01-06 20:54:52,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 20:54:52,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2021-01-06 20:54:52,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:52,556 INFO L225 Difference]: With dead ends: 303 [2021-01-06 20:54:52,557 INFO L226 Difference]: Without dead ends: 256 [2021-01-06 20:54:52,558 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2021-01-06 20:54:52,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-01-06 20:54:52,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 158. [2021-01-06 20:54:52,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2021-01-06 20:54:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 193 transitions. [2021-01-06 20:54:52,592 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 193 transitions. Word has length 53 [2021-01-06 20:54:52,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:52,592 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 193 transitions. [2021-01-06 20:54:52,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 20:54:52,592 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2021-01-06 20:54:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 20:54:52,593 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:52,593 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:54:52,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 20:54:52,594 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:54:52,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:52,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1081508648, now seen corresponding path program 1 times [2021-01-06 20:54:52,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:52,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98976172] [2021-01-06 20:54:52,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:53,361 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:54:53,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98976172] [2021-01-06 20:54:53,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:53,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-01-06 20:54:53,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370079749] [2021-01-06 20:54:53,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 20:54:53,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:53,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 20:54:53,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-01-06 20:54:53,363 INFO L87 Difference]: Start difference. First operand 158 states and 193 transitions. Second operand 16 states. [2021-01-06 20:54:54,133 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2021-01-06 20:54:54,324 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2021-01-06 20:54:54,494 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2021-01-06 20:54:54,720 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2021-01-06 20:54:55,079 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2021-01-06 20:54:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:57,403 INFO L93 Difference]: Finished difference Result 737 states and 978 transitions. [2021-01-06 20:54:57,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-01-06 20:54:57,404 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2021-01-06 20:54:57,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:57,410 INFO L225 Difference]: With dead ends: 737 [2021-01-06 20:54:57,410 INFO L226 Difference]: Without dead ends: 720 [2021-01-06 20:54:57,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=272, Invalid=918, Unknown=0, NotChecked=0, Total=1190 [2021-01-06 20:54:57,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2021-01-06 20:54:57,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 150. [2021-01-06 20:54:57,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2021-01-06 20:54:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 182 transitions. [2021-01-06 20:54:57,471 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 182 transitions. Word has length 53 [2021-01-06 20:54:57,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:57,471 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 182 transitions. [2021-01-06 20:54:57,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 20:54:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 182 transitions. [2021-01-06 20:54:57,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 20:54:57,473 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:57,473 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:54:57,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 20:54:57,473 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:54:57,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:57,474 INFO L82 PathProgramCache]: Analyzing trace with hash -895336457, now seen corresponding path program 1 times [2021-01-06 20:54:57,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:57,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716712061] [2021-01-06 20:54:57,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:54:57,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716712061] [2021-01-06 20:54:57,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:57,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:54:57,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358241832] [2021-01-06 20:54:57,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:54:57,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:57,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:54:57,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:54:57,644 INFO L87 Difference]: Start difference. First operand 150 states and 182 transitions. Second operand 9 states. [2021-01-06 20:54:58,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:58,245 INFO L93 Difference]: Finished difference Result 240 states and 294 transitions. [2021-01-06 20:54:58,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 20:54:58,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2021-01-06 20:54:58,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:58,248 INFO L225 Difference]: With dead ends: 240 [2021-01-06 20:54:58,248 INFO L226 Difference]: Without dead ends: 232 [2021-01-06 20:54:58,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-01-06 20:54:58,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-01-06 20:54:58,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 150. [2021-01-06 20:54:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2021-01-06 20:54:58,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 181 transitions. [2021-01-06 20:54:58,293 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 181 transitions. Word has length 54 [2021-01-06 20:54:58,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:54:58,293 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 181 transitions. [2021-01-06 20:54:58,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:54:58,293 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 181 transitions. [2021-01-06 20:54:58,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 20:54:58,294 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:54:58,294 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:54:58,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 20:54:58,295 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:54:58,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:54:58,295 INFO L82 PathProgramCache]: Analyzing trace with hash 4832631, now seen corresponding path program 1 times [2021-01-06 20:54:58,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:54:58,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275645126] [2021-01-06 20:54:58,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:54:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:54:58,473 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:54:58,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275645126] [2021-01-06 20:54:58,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:54:58,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 20:54:58,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888369328] [2021-01-06 20:54:58,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 20:54:58,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:54:58,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 20:54:58,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-01-06 20:54:58,476 INFO L87 Difference]: Start difference. First operand 150 states and 181 transitions. Second operand 10 states. [2021-01-06 20:54:59,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:54:59,948 INFO L93 Difference]: Finished difference Result 455 states and 600 transitions. [2021-01-06 20:54:59,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 20:54:59,949 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2021-01-06 20:54:59,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:54:59,952 INFO L225 Difference]: With dead ends: 455 [2021-01-06 20:54:59,952 INFO L226 Difference]: Without dead ends: 392 [2021-01-06 20:54:59,953 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2021-01-06 20:54:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-01-06 20:55:00,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 150. [2021-01-06 20:55:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2021-01-06 20:55:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2021-01-06 20:55:00,003 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 54 [2021-01-06 20:55:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:00,003 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2021-01-06 20:55:00,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 20:55:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2021-01-06 20:55:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 20:55:00,004 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:00,005 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:55:00,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 20:55:00,005 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:55:00,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:00,006 INFO L82 PathProgramCache]: Analyzing trace with hash -924533993, now seen corresponding path program 1 times [2021-01-06 20:55:00,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:00,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676025736] [2021-01-06 20:55:00,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:00,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:55:00,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676025736] [2021-01-06 20:55:00,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:00,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 20:55:00,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899776666] [2021-01-06 20:55:00,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 20:55:00,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:00,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 20:55:00,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-06 20:55:00,243 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand 11 states. [2021-01-06 20:55:02,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:02,325 INFO L93 Difference]: Finished difference Result 403 states and 518 transitions. [2021-01-06 20:55:02,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 20:55:02,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2021-01-06 20:55:02,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:02,328 INFO L225 Difference]: With dead ends: 403 [2021-01-06 20:55:02,329 INFO L226 Difference]: Without dead ends: 395 [2021-01-06 20:55:02,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=266, Invalid=726, Unknown=0, NotChecked=0, Total=992 [2021-01-06 20:55:02,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-01-06 20:55:02,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 155. [2021-01-06 20:55:02,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2021-01-06 20:55:02,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 185 transitions. [2021-01-06 20:55:02,381 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 185 transitions. Word has length 54 [2021-01-06 20:55:02,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:02,382 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 185 transitions. [2021-01-06 20:55:02,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 20:55:02,382 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 185 transitions. [2021-01-06 20:55:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-06 20:55:02,383 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:02,383 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:55:02,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 20:55:02,383 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:55:02,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:02,384 INFO L82 PathProgramCache]: Analyzing trace with hash 232129054, now seen corresponding path program 1 times [2021-01-06 20:55:02,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:02,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316478715] [2021-01-06 20:55:02,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:02,516 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:55:02,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316478715] [2021-01-06 20:55:02,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:02,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:55:02,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524035038] [2021-01-06 20:55:02,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:55:02,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:02,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:55:02,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:55:02,519 INFO L87 Difference]: Start difference. First operand 155 states and 185 transitions. Second operand 9 states. [2021-01-06 20:55:03,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:03,093 INFO L93 Difference]: Finished difference Result 240 states and 291 transitions. [2021-01-06 20:55:03,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 20:55:03,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2021-01-06 20:55:03,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:03,095 INFO L225 Difference]: With dead ends: 240 [2021-01-06 20:55:03,095 INFO L226 Difference]: Without dead ends: 232 [2021-01-06 20:55:03,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-01-06 20:55:03,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-01-06 20:55:03,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 150. [2021-01-06 20:55:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2021-01-06 20:55:03,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 179 transitions. [2021-01-06 20:55:03,147 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 179 transitions. Word has length 55 [2021-01-06 20:55:03,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:03,147 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 179 transitions. [2021-01-06 20:55:03,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:55:03,148 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 179 transitions. [2021-01-06 20:55:03,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-06 20:55:03,148 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:03,149 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:55:03,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 20:55:03,149 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:55:03,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:03,150 INFO L82 PathProgramCache]: Analyzing trace with hash 140596120, now seen corresponding path program 1 times [2021-01-06 20:55:03,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:03,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441725283] [2021-01-06 20:55:03,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:03,329 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:55:03,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441725283] [2021-01-06 20:55:03,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:03,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 20:55:03,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922012404] [2021-01-06 20:55:03,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 20:55:03,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:03,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 20:55:03,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 20:55:03,332 INFO L87 Difference]: Start difference. First operand 150 states and 179 transitions. Second operand 9 states. [2021-01-06 20:55:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:04,125 INFO L93 Difference]: Finished difference Result 279 states and 352 transitions. [2021-01-06 20:55:04,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 20:55:04,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2021-01-06 20:55:04,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:04,129 INFO L225 Difference]: With dead ends: 279 [2021-01-06 20:55:04,129 INFO L226 Difference]: Without dead ends: 216 [2021-01-06 20:55:04,131 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-01-06 20:55:04,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-01-06 20:55:04,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 150. [2021-01-06 20:55:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2021-01-06 20:55:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 178 transitions. [2021-01-06 20:55:04,194 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 178 transitions. Word has length 55 [2021-01-06 20:55:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:04,195 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 178 transitions. [2021-01-06 20:55:04,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 20:55:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 178 transitions. [2021-01-06 20:55:04,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-06 20:55:04,196 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:04,196 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] [2021-01-06 20:55:04,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 20:55:04,196 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:55:04,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:04,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1614885916, now seen corresponding path program 1 times [2021-01-06 20:55:04,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:04,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327212401] [2021-01-06 20:55:04,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:04,826 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:55:04,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327212401] [2021-01-06 20:55:04,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:04,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-01-06 20:55:04,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053491596] [2021-01-06 20:55:04,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 20:55:04,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:04,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 20:55:04,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-01-06 20:55:04,831 INFO L87 Difference]: Start difference. First operand 150 states and 178 transitions. Second operand 18 states. [2021-01-06 20:55:05,017 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2021-01-06 20:55:05,611 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2021-01-06 20:55:07,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:07,668 INFO L93 Difference]: Finished difference Result 469 states and 602 transitions. [2021-01-06 20:55:07,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 20:55:07,670 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2021-01-06 20:55:07,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:07,674 INFO L225 Difference]: With dead ends: 469 [2021-01-06 20:55:07,674 INFO L226 Difference]: Without dead ends: 463 [2021-01-06 20:55:07,675 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2021-01-06 20:55:07,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-01-06 20:55:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 157. [2021-01-06 20:55:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2021-01-06 20:55:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 187 transitions. [2021-01-06 20:55:07,729 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 187 transitions. Word has length 56 [2021-01-06 20:55:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:07,730 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 187 transitions. [2021-01-06 20:55:07,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 20:55:07,730 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 187 transitions. [2021-01-06 20:55:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-06 20:55:07,731 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:07,731 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] [2021-01-06 20:55:07,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 20:55:07,732 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:55:07,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:07,732 INFO L82 PathProgramCache]: Analyzing trace with hash 897405148, now seen corresponding path program 1 times [2021-01-06 20:55:07,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:07,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129056091] [2021-01-06 20:55:07,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:08,370 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:55:08,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129056091] [2021-01-06 20:55:08,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:08,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-01-06 20:55:08,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885630215] [2021-01-06 20:55:08,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 20:55:08,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:08,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 20:55:08,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-01-06 20:55:08,373 INFO L87 Difference]: Start difference. First operand 157 states and 187 transitions. Second operand 18 states. [2021-01-06 20:55:08,638 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2021-01-06 20:55:09,351 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2021-01-06 20:55:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:11,232 INFO L93 Difference]: Finished difference Result 370 states and 462 transitions. [2021-01-06 20:55:11,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 20:55:11,233 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2021-01-06 20:55:11,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:11,235 INFO L225 Difference]: With dead ends: 370 [2021-01-06 20:55:11,235 INFO L226 Difference]: Without dead ends: 361 [2021-01-06 20:55:11,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=227, Invalid=895, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 20:55:11,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-01-06 20:55:11,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 157. [2021-01-06 20:55:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2021-01-06 20:55:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 186 transitions. [2021-01-06 20:55:11,282 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 186 transitions. Word has length 56 [2021-01-06 20:55:11,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:11,282 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 186 transitions. [2021-01-06 20:55:11,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 20:55:11,282 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 186 transitions. [2021-01-06 20:55:11,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-06 20:55:11,283 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:11,283 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] [2021-01-06 20:55:11,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 20:55:11,284 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:55:11,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:11,284 INFO L82 PathProgramCache]: Analyzing trace with hash -712982628, now seen corresponding path program 1 times [2021-01-06 20:55:11,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:11,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058432108] [2021-01-06 20:55:11,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:11,863 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:55:11,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058432108] [2021-01-06 20:55:11,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:11,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-01-06 20:55:11,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550346909] [2021-01-06 20:55:11,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 20:55:11,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:11,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 20:55:11,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-01-06 20:55:11,865 INFO L87 Difference]: Start difference. First operand 157 states and 186 transitions. Second operand 18 states. [2021-01-06 20:55:12,052 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2021-01-06 20:55:12,641 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2021-01-06 20:55:14,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:14,765 INFO L93 Difference]: Finished difference Result 370 states and 461 transitions. [2021-01-06 20:55:14,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 20:55:14,767 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2021-01-06 20:55:14,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:14,768 INFO L225 Difference]: With dead ends: 370 [2021-01-06 20:55:14,769 INFO L226 Difference]: Without dead ends: 361 [2021-01-06 20:55:14,770 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2021-01-06 20:55:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-01-06 20:55:14,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 163. [2021-01-06 20:55:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-06 20:55:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 192 transitions. [2021-01-06 20:55:14,822 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 192 transitions. Word has length 56 [2021-01-06 20:55:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:14,823 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 192 transitions. [2021-01-06 20:55:14,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 20:55:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2021-01-06 20:55:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 20:55:14,823 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:14,824 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:55:14,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 20:55:14,824 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:55:14,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:14,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1229531537, now seen corresponding path program 1 times [2021-01-06 20:55:14,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:14,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36269417] [2021-01-06 20:55:14,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:15,645 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:55:15,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36269417] [2021-01-06 20:55:15,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:15,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-01-06 20:55:15,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93228627] [2021-01-06 20:55:15,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 20:55:15,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:15,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 20:55:15,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-01-06 20:55:15,648 INFO L87 Difference]: Start difference. First operand 163 states and 192 transitions. Second operand 16 states. [2021-01-06 20:55:16,451 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2021-01-06 20:55:16,632 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-06 20:55:16,802 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-06 20:55:16,958 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2021-01-06 20:55:17,311 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2021-01-06 20:55:17,595 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2021-01-06 20:55:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:18,927 INFO L93 Difference]: Finished difference Result 598 states and 789 transitions. [2021-01-06 20:55:18,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 20:55:18,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2021-01-06 20:55:18,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:18,932 INFO L225 Difference]: With dead ends: 598 [2021-01-06 20:55:18,933 INFO L226 Difference]: Without dead ends: 592 [2021-01-06 20:55:18,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=223, Invalid=647, Unknown=0, NotChecked=0, Total=870 [2021-01-06 20:55:18,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2021-01-06 20:55:18,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 163. [2021-01-06 20:55:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-06 20:55:18,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 192 transitions. [2021-01-06 20:55:18,999 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 192 transitions. Word has length 57 [2021-01-06 20:55:18,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:18,999 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 192 transitions. [2021-01-06 20:55:18,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 20:55:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2021-01-06 20:55:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 20:55:19,000 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:19,000 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:55:19,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 20:55:19,001 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:55:19,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:19,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1985133879, now seen corresponding path program 1 times [2021-01-06 20:55:19,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:19,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41330546] [2021-01-06 20:55:19,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:55:19,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41330546] [2021-01-06 20:55:19,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:19,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 20:55:19,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417132368] [2021-01-06 20:55:19,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 20:55:19,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:19,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 20:55:19,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-01-06 20:55:19,765 INFO L87 Difference]: Start difference. First operand 163 states and 192 transitions. Second operand 14 states. [2021-01-06 20:55:20,111 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2021-01-06 20:55:20,383 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2021-01-06 20:55:20,617 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-06 20:55:20,832 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2021-01-06 20:55:21,032 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2021-01-06 20:55:21,211 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2021-01-06 20:55:21,477 WARN L197 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2021-01-06 20:55:21,986 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2021-01-06 20:55:22,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:22,855 INFO L93 Difference]: Finished difference Result 432 states and 564 transitions. [2021-01-06 20:55:22,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 20:55:22,856 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2021-01-06 20:55:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:22,859 INFO L225 Difference]: With dead ends: 432 [2021-01-06 20:55:22,859 INFO L226 Difference]: Without dead ends: 419 [2021-01-06 20:55:22,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2021-01-06 20:55:22,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-01-06 20:55:22,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 150. [2021-01-06 20:55:22,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2021-01-06 20:55:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 179 transitions. [2021-01-06 20:55:22,918 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 179 transitions. Word has length 57 [2021-01-06 20:55:22,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:22,919 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 179 transitions. [2021-01-06 20:55:22,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 20:55:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 179 transitions. [2021-01-06 20:55:22,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 20:55:22,920 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:22,920 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:55:22,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 20:55:22,920 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:55:22,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:22,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1082760790, now seen corresponding path program 1 times [2021-01-06 20:55:22,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:22,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675070769] [2021-01-06 20:55:22,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:23,351 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:55:23,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675070769] [2021-01-06 20:55:23,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:23,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 20:55:23,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847082344] [2021-01-06 20:55:23,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 20:55:23,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:23,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 20:55:23,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-01-06 20:55:23,356 INFO L87 Difference]: Start difference. First operand 150 states and 179 transitions. Second operand 10 states. [2021-01-06 20:55:23,856 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2021-01-06 20:55:23,996 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2021-01-06 20:55:24,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:24,804 INFO L93 Difference]: Finished difference Result 389 states and 518 transitions. [2021-01-06 20:55:24,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 20:55:24,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2021-01-06 20:55:24,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:24,808 INFO L225 Difference]: With dead ends: 389 [2021-01-06 20:55:24,809 INFO L226 Difference]: Without dead ends: 363 [2021-01-06 20:55:24,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2021-01-06 20:55:24,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-01-06 20:55:24,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 124. [2021-01-06 20:55:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2021-01-06 20:55:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 151 transitions. [2021-01-06 20:55:24,863 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 151 transitions. Word has length 57 [2021-01-06 20:55:24,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:24,863 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 151 transitions. [2021-01-06 20:55:24,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 20:55:24,863 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2021-01-06 20:55:24,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 20:55:24,864 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:24,864 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:55:24,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 20:55:24,865 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:55:24,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:24,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1060387331, now seen corresponding path program 1 times [2021-01-06 20:55:24,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:24,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49299554] [2021-01-06 20:55:24,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:25,528 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:55:25,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49299554] [2021-01-06 20:55:25,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:25,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 20:55:25,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283726985] [2021-01-06 20:55:25,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 20:55:25,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:25,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 20:55:25,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-01-06 20:55:25,530 INFO L87 Difference]: Start difference. First operand 124 states and 151 transitions. Second operand 14 states. [2021-01-06 20:55:26,037 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2021-01-06 20:55:26,238 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2021-01-06 20:55:26,385 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2021-01-06 20:55:26,539 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2021-01-06 20:55:27,403 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2021-01-06 20:55:28,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:28,267 INFO L93 Difference]: Finished difference Result 381 states and 512 transitions. [2021-01-06 20:55:28,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 20:55:28,268 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2021-01-06 20:55:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:28,270 INFO L225 Difference]: With dead ends: 381 [2021-01-06 20:55:28,270 INFO L226 Difference]: Without dead ends: 375 [2021-01-06 20:55:28,271 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2021-01-06 20:55:28,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-01-06 20:55:28,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 124. [2021-01-06 20:55:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2021-01-06 20:55:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 151 transitions. [2021-01-06 20:55:28,307 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 151 transitions. Word has length 57 [2021-01-06 20:55:28,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:28,307 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 151 transitions. [2021-01-06 20:55:28,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 20:55:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2021-01-06 20:55:28,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-06 20:55:28,308 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:28,308 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] [2021-01-06 20:55:28,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 20:55:28,308 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:55:28,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:28,309 INFO L82 PathProgramCache]: Analyzing trace with hash -99560496, now seen corresponding path program 1 times [2021-01-06 20:55:28,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:28,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091650916] [2021-01-06 20:55:28,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:28,626 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:55:28,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091650916] [2021-01-06 20:55:28,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:28,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 20:55:28,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107364730] [2021-01-06 20:55:28,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 20:55:28,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:28,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 20:55:28,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-01-06 20:55:28,637 INFO L87 Difference]: Start difference. First operand 124 states and 151 transitions. Second operand 10 states. [2021-01-06 20:55:29,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:29,513 INFO L93 Difference]: Finished difference Result 284 states and 373 transitions. [2021-01-06 20:55:29,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 20:55:29,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2021-01-06 20:55:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:29,517 INFO L225 Difference]: With dead ends: 284 [2021-01-06 20:55:29,517 INFO L226 Difference]: Without dead ends: 278 [2021-01-06 20:55:29,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-01-06 20:55:29,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-01-06 20:55:29,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 104. [2021-01-06 20:55:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2021-01-06 20:55:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2021-01-06 20:55:29,579 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 58 [2021-01-06 20:55:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:29,580 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2021-01-06 20:55:29,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 20:55:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2021-01-06 20:55:29,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 20:55:29,581 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:29,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:55:29,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 20:55:29,582 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:55:29,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:29,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1117882514, now seen corresponding path program 1 times [2021-01-06 20:55:29,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:29,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875559850] [2021-01-06 20:55:29,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:55:29,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875559850] [2021-01-06 20:55:29,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:29,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:55:29,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524273468] [2021-01-06 20:55:29,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:55:29,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:29,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:55:29,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:55:29,677 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand 3 states. [2021-01-06 20:55:29,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:29,779 INFO L93 Difference]: Finished difference Result 186 states and 246 transitions. [2021-01-06 20:55:29,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:55:29,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2021-01-06 20:55:29,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:29,780 INFO L225 Difference]: With dead ends: 186 [2021-01-06 20:55:29,780 INFO L226 Difference]: Without dead ends: 143 [2021-01-06 20:55:29,781 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:55:29,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-01-06 20:55:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2021-01-06 20:55:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2021-01-06 20:55:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 181 transitions. [2021-01-06 20:55:29,838 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 181 transitions. Word has length 75 [2021-01-06 20:55:29,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:29,838 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 181 transitions. [2021-01-06 20:55:29,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:55:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 181 transitions. [2021-01-06 20:55:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 20:55:29,839 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:29,839 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:55:29,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 20:55:29,840 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:55:29,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:29,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1016465065, now seen corresponding path program 1 times [2021-01-06 20:55:29,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:29,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434195292] [2021-01-06 20:55:29,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:29,939 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:55:29,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434195292] [2021-01-06 20:55:29,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:29,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:55:29,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583723033] [2021-01-06 20:55:29,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:55:29,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:29,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:55:29,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:55:29,942 INFO L87 Difference]: Start difference. First operand 141 states and 181 transitions. Second operand 5 states. [2021-01-06 20:55:30,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:30,286 INFO L93 Difference]: Finished difference Result 390 states and 541 transitions. [2021-01-06 20:55:30,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:55:30,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2021-01-06 20:55:30,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:30,289 INFO L225 Difference]: With dead ends: 390 [2021-01-06 20:55:30,290 INFO L226 Difference]: Without dead ends: 310 [2021-01-06 20:55:30,291 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:55:30,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-01-06 20:55:30,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 182. [2021-01-06 20:55:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2021-01-06 20:55:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 242 transitions. [2021-01-06 20:55:30,434 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 242 transitions. Word has length 77 [2021-01-06 20:55:30,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:30,435 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 242 transitions. [2021-01-06 20:55:30,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:55:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 242 transitions. [2021-01-06 20:55:30,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 20:55:30,436 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:30,436 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:55:30,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 20:55:30,436 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:55:30,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:30,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1101947074, now seen corresponding path program 1 times [2021-01-06 20:55:30,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:30,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86770397] [2021-01-06 20:55:30,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:30,514 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:55:30,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86770397] [2021-01-06 20:55:30,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:30,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:55:30,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718079316] [2021-01-06 20:55:30,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:55:30,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:30,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:55:30,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:55:30,517 INFO L87 Difference]: Start difference. First operand 182 states and 242 transitions. Second operand 3 states. [2021-01-06 20:55:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:30,692 INFO L93 Difference]: Finished difference Result 408 states and 567 transitions. [2021-01-06 20:55:30,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:55:30,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2021-01-06 20:55:30,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:30,694 INFO L225 Difference]: With dead ends: 408 [2021-01-06 20:55:30,694 INFO L226 Difference]: Without dead ends: 287 [2021-01-06 20:55:30,695 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:55:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-01-06 20:55:30,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2021-01-06 20:55:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2021-01-06 20:55:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 385 transitions. [2021-01-06 20:55:30,862 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 385 transitions. Word has length 77 [2021-01-06 20:55:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:30,862 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 385 transitions. [2021-01-06 20:55:30,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:55:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 385 transitions. [2021-01-06 20:55:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 20:55:30,863 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:30,863 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:55:30,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 20:55:30,863 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:55:30,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:30,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1035453562, now seen corresponding path program 1 times [2021-01-06 20:55:30,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:30,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016277639] [2021-01-06 20:55:30,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:30,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:55:30,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016277639] [2021-01-06 20:55:30,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:30,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:55:30,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696869672] [2021-01-06 20:55:30,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:55:30,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:30,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:55:30,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:55:30,939 INFO L87 Difference]: Start difference. First operand 285 states and 385 transitions. Second operand 3 states. [2021-01-06 20:55:31,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:31,239 INFO L93 Difference]: Finished difference Result 661 states and 920 transitions. [2021-01-06 20:55:31,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:55:31,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2021-01-06 20:55:31,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:31,243 INFO L225 Difference]: With dead ends: 661 [2021-01-06 20:55:31,243 INFO L226 Difference]: Without dead ends: 437 [2021-01-06 20:55:31,243 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:55:31,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-01-06 20:55:31,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 435. [2021-01-06 20:55:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2021-01-06 20:55:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 595 transitions. [2021-01-06 20:55:31,460 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 595 transitions. Word has length 77 [2021-01-06 20:55:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:31,460 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 595 transitions. [2021-01-06 20:55:31,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:55:31,460 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 595 transitions. [2021-01-06 20:55:31,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 20:55:31,461 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:31,461 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:55:31,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 20:55:31,461 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:55:31,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:31,462 INFO L82 PathProgramCache]: Analyzing trace with hash -401787049, now seen corresponding path program 1 times [2021-01-06 20:55:31,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:31,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760826275] [2021-01-06 20:55:31,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:31,564 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:55:31,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760826275] [2021-01-06 20:55:31,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:31,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:55:31,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116784478] [2021-01-06 20:55:31,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:55:31,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:31,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:55:31,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:55:31,567 INFO L87 Difference]: Start difference. First operand 435 states and 595 transitions. Second operand 5 states. [2021-01-06 20:55:32,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:32,109 INFO L93 Difference]: Finished difference Result 1138 states and 1588 transitions. [2021-01-06 20:55:32,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:55:32,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2021-01-06 20:55:32,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:32,113 INFO L225 Difference]: With dead ends: 1138 [2021-01-06 20:55:32,114 INFO L226 Difference]: Without dead ends: 915 [2021-01-06 20:55:32,115 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:55:32,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-01-06 20:55:32,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 662. [2021-01-06 20:55:32,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2021-01-06 20:55:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 916 transitions. [2021-01-06 20:55:32,461 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 916 transitions. Word has length 77 [2021-01-06 20:55:32,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:32,461 INFO L481 AbstractCegarLoop]: Abstraction has 662 states and 916 transitions. [2021-01-06 20:55:32,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:55:32,461 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 916 transitions. [2021-01-06 20:55:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 20:55:32,462 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:32,462 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:55:32,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 20:55:32,462 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:55:32,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:32,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1826714967, now seen corresponding path program 1 times [2021-01-06 20:55:32,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:32,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198956296] [2021-01-06 20:55:32,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:32,554 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:55:32,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198956296] [2021-01-06 20:55:32,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:32,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:55:32,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079071222] [2021-01-06 20:55:32,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:55:32,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:32,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:55:32,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:55:32,557 INFO L87 Difference]: Start difference. First operand 662 states and 916 transitions. Second operand 5 states. [2021-01-06 20:55:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:33,131 INFO L93 Difference]: Finished difference Result 1286 states and 1798 transitions. [2021-01-06 20:55:33,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:55:33,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2021-01-06 20:55:33,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:33,136 INFO L225 Difference]: With dead ends: 1286 [2021-01-06 20:55:33,136 INFO L226 Difference]: Without dead ends: 1063 [2021-01-06 20:55:33,138 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:55:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2021-01-06 20:55:33,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 813. [2021-01-06 20:55:33,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2021-01-06 20:55:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1130 transitions. [2021-01-06 20:55:33,943 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1130 transitions. Word has length 77 [2021-01-06 20:55:33,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:33,944 INFO L481 AbstractCegarLoop]: Abstraction has 813 states and 1130 transitions. [2021-01-06 20:55:33,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:55:33,944 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1130 transitions. [2021-01-06 20:55:33,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 20:55:33,945 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:33,946 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:55:33,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 20:55:33,946 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:55:33,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:33,947 INFO L82 PathProgramCache]: Analyzing trace with hash 275968985, now seen corresponding path program 1 times [2021-01-06 20:55:33,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:33,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828891259] [2021-01-06 20:55:33,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:34,015 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:55:34,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828891259] [2021-01-06 20:55:34,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:34,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:55:34,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730467377] [2021-01-06 20:55:34,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:55:34,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:34,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:55:34,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:55:34,021 INFO L87 Difference]: Start difference. First operand 813 states and 1130 transitions. Second operand 3 states. [2021-01-06 20:55:35,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:35,298 INFO L93 Difference]: Finished difference Result 2037 states and 2846 transitions. [2021-01-06 20:55:35,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:55:35,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2021-01-06 20:55:35,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:35,304 INFO L225 Difference]: With dead ends: 2037 [2021-01-06 20:55:35,304 INFO L226 Difference]: Without dead ends: 1285 [2021-01-06 20:55:35,306 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:55:35,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2021-01-06 20:55:35,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1207. [2021-01-06 20:55:35,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2021-01-06 20:55:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1666 transitions. [2021-01-06 20:55:36,006 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1666 transitions. Word has length 78 [2021-01-06 20:55:36,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:36,007 INFO L481 AbstractCegarLoop]: Abstraction has 1207 states and 1666 transitions. [2021-01-06 20:55:36,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:55:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1666 transitions. [2021-01-06 20:55:36,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 20:55:36,011 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:36,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:55:36,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 20:55:36,012 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:55:36,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:36,013 INFO L82 PathProgramCache]: Analyzing trace with hash -163971304, now seen corresponding path program 1 times [2021-01-06 20:55:36,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:36,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952225717] [2021-01-06 20:55:36,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:36,082 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:55:36,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952225717] [2021-01-06 20:55:36,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:36,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:55:36,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231102495] [2021-01-06 20:55:36,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:55:36,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:36,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:55:36,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:55:36,085 INFO L87 Difference]: Start difference. First operand 1207 states and 1666 transitions. Second operand 3 states. [2021-01-06 20:55:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:37,018 INFO L93 Difference]: Finished difference Result 2389 states and 3317 transitions. [2021-01-06 20:55:37,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:55:37,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2021-01-06 20:55:37,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:37,024 INFO L225 Difference]: With dead ends: 2389 [2021-01-06 20:55:37,025 INFO L226 Difference]: Without dead ends: 1243 [2021-01-06 20:55:37,026 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:55:37,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2021-01-06 20:55:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1241. [2021-01-06 20:55:37,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2021-01-06 20:55:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1696 transitions. [2021-01-06 20:55:37,685 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1696 transitions. Word has length 79 [2021-01-06 20:55:37,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:37,685 INFO L481 AbstractCegarLoop]: Abstraction has 1241 states and 1696 transitions. [2021-01-06 20:55:37,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:55:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1696 transitions. [2021-01-06 20:55:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 20:55:37,687 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:37,687 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:55:37,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 20:55:37,687 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:55:37,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:37,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1432796505, now seen corresponding path program 1 times [2021-01-06 20:55:37,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:37,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681205675] [2021-01-06 20:55:37,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:37,753 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:55:37,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681205675] [2021-01-06 20:55:37,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:37,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:55:37,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479056564] [2021-01-06 20:55:37,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:55:37,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:37,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:55:37,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:55:37,756 INFO L87 Difference]: Start difference. First operand 1241 states and 1696 transitions. Second operand 3 states. [2021-01-06 20:55:39,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:39,045 INFO L93 Difference]: Finished difference Result 3477 states and 4741 transitions. [2021-01-06 20:55:39,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:55:39,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2021-01-06 20:55:39,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:39,054 INFO L225 Difference]: With dead ends: 3477 [2021-01-06 20:55:39,054 INFO L226 Difference]: Without dead ends: 2297 [2021-01-06 20:55:39,056 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:55:39,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2021-01-06 20:55:40,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2171. [2021-01-06 20:55:40,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2171 states. [2021-01-06 20:55:40,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 2923 transitions. [2021-01-06 20:55:40,287 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 2923 transitions. Word has length 79 [2021-01-06 20:55:40,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:40,287 INFO L481 AbstractCegarLoop]: Abstraction has 2171 states and 2923 transitions. [2021-01-06 20:55:40,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:55:40,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2923 transitions. [2021-01-06 20:55:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 20:55:40,288 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:40,288 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:55:40,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 20:55:40,289 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:55:40,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:40,289 INFO L82 PathProgramCache]: Analyzing trace with hash -21206962, now seen corresponding path program 1 times [2021-01-06 20:55:40,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:40,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510294048] [2021-01-06 20:55:40,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:40,364 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:55:40,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510294048] [2021-01-06 20:55:40,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:40,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:55:40,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087148932] [2021-01-06 20:55:40,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:55:40,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:40,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:55:40,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:55:40,367 INFO L87 Difference]: Start difference. First operand 2171 states and 2923 transitions. Second operand 3 states. [2021-01-06 20:55:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:42,736 INFO L93 Difference]: Finished difference Result 6143 states and 8205 transitions. [2021-01-06 20:55:42,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:55:42,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2021-01-06 20:55:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:42,752 INFO L225 Difference]: With dead ends: 6143 [2021-01-06 20:55:42,752 INFO L226 Difference]: Without dead ends: 4033 [2021-01-06 20:55:42,759 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:55:42,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4033 states. [2021-01-06 20:55:44,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4033 to 3783. [2021-01-06 20:55:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3783 states. [2021-01-06 20:55:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3783 states to 3783 states and 4974 transitions. [2021-01-06 20:55:44,852 INFO L78 Accepts]: Start accepts. Automaton has 3783 states and 4974 transitions. Word has length 80 [2021-01-06 20:55:44,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:44,852 INFO L481 AbstractCegarLoop]: Abstraction has 3783 states and 4974 transitions. [2021-01-06 20:55:44,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:55:44,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3783 states and 4974 transitions. [2021-01-06 20:55:44,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 20:55:44,853 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:44,859 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:55:44,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 20:55:44,860 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:55:44,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:44,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1223980109, now seen corresponding path program 1 times [2021-01-06 20:55:44,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:44,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573099281] [2021-01-06 20:55:44,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:55:44,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573099281] [2021-01-06 20:55:44,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:55:44,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 20:55:44,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779576659] [2021-01-06 20:55:44,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 20:55:44,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:44,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 20:55:44,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 20:55:44,980 INFO L87 Difference]: Start difference. First operand 3783 states and 4974 transitions. Second operand 6 states. [2021-01-06 20:55:48,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:55:48,428 INFO L93 Difference]: Finished difference Result 5645 states and 7406 transitions. [2021-01-06 20:55:48,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 20:55:48,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2021-01-06 20:55:48,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:55:48,454 INFO L225 Difference]: With dead ends: 5645 [2021-01-06 20:55:48,455 INFO L226 Difference]: Without dead ends: 5643 [2021-01-06 20:55:48,457 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:55:48,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2021-01-06 20:55:50,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 3879. [2021-01-06 20:55:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3879 states. [2021-01-06 20:55:50,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3879 states to 3879 states and 5030 transitions. [2021-01-06 20:55:50,891 INFO L78 Accepts]: Start accepts. Automaton has 3879 states and 5030 transitions. Word has length 81 [2021-01-06 20:55:50,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:55:50,891 INFO L481 AbstractCegarLoop]: Abstraction has 3879 states and 5030 transitions. [2021-01-06 20:55:50,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 20:55:50,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3879 states and 5030 transitions. [2021-01-06 20:55:50,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-01-06 20:55:50,893 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:55:50,893 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:55:50,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 20:55:50,893 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:55:50,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:55:50,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1680108859, now seen corresponding path program 1 times [2021-01-06 20:55:50,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:55:50,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493633936] [2021-01-06 20:55:50,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:55:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:55:51,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493633936] [2021-01-06 20:55:51,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181849258] [2021-01-06 20:55:51,223 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:55:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:55:51,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 20:55:51,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 20:55:51,805 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 20:55:51,897 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 20:55:52,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 20:55:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:55:52,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 20:55:52,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2021-01-06 20:55:52,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447350468] [2021-01-06 20:55:52,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 20:55:52,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:55:52,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 20:55:52,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-01-06 20:55:52,487 INFO L87 Difference]: Start difference. First operand 3879 states and 5030 transitions. Second operand 18 states. [2021-01-06 20:55:53,381 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2021-01-06 20:55:54,029 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2021-01-06 20:55:54,816 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2021-01-06 20:55:55,289 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2021-01-06 20:55:55,831 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2021-01-06 20:55:56,547 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2021-01-06 20:55:58,448 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2021-01-06 20:56:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:56:22,067 INFO L93 Difference]: Finished difference Result 38453 states and 49002 transitions. [2021-01-06 20:56:22,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-01-06 20:56:22,068 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 103 [2021-01-06 20:56:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:56:22,143 INFO L225 Difference]: With dead ends: 38453 [2021-01-06 20:56:22,143 INFO L226 Difference]: Without dead ends: 34635 [2021-01-06 20:56:22,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1537, Invalid=6653, Unknown=0, NotChecked=0, Total=8190 [2021-01-06 20:56:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34635 states. [2021-01-06 20:56:27,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34635 to 8269. [2021-01-06 20:56:27,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8269 states. [2021-01-06 20:56:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8269 states to 8269 states and 10666 transitions. [2021-01-06 20:56:27,260 INFO L78 Accepts]: Start accepts. Automaton has 8269 states and 10666 transitions. Word has length 103 [2021-01-06 20:56:27,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:56:27,261 INFO L481 AbstractCegarLoop]: Abstraction has 8269 states and 10666 transitions. [2021-01-06 20:56:27,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 20:56:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 8269 states and 10666 transitions. [2021-01-06 20:56:27,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-01-06 20:56:27,263 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:56:27,263 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:56:27,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-01-06 20:56:27,474 INFO L429 AbstractCegarLoop]: === Iteration 37 === [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:27,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:56:27,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1319335917, now seen corresponding path program 1 times [2021-01-06 20:56:27,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:56:27,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458580162] [2021-01-06 20:56:27,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:56:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:27,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458580162] [2021-01-06 20:56:27,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183074053] [2021-01-06 20:56:27,747 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:56:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:56:27,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 22 conjunts are in the unsatisfiable core [2021-01-06 20:56:27,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 20:56:28,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 20:56:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:56:28,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 20:56:28,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2021-01-06 20:56:28,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018528210] [2021-01-06 20:56:28,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-06 20:56:28,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:56:28,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-06 20:56:28,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2021-01-06 20:56:28,808 INFO L87 Difference]: Start difference. First operand 8269 states and 10666 transitions. Second operand 20 states. [2021-01-06 20:56:28,992 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2021-01-06 20:56:29,338 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2021-01-06 20:56:29,682 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2021-01-06 20:56:29,942 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-01-06 20:56:30,294 WARN L197 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2021-01-06 20:56:30,606 WARN L197 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2021-01-06 20:56:31,005 WARN L197 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2021-01-06 20:56:31,420 WARN L197 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-01-06 20:56:32,039 WARN L197 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2021-01-06 20:56:32,367 WARN L197 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2021-01-06 20:56:32,730 WARN L197 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2021-01-06 20:56:33,024 WARN L197 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2021-01-06 20:56:33,511 WARN L197 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2021-01-06 20:56:33,891 WARN L197 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2021-01-06 20:56:34,330 WARN L197 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2021-01-06 20:56:34,690 WARN L197 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2021-01-06 20:56:35,001 WARN L197 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2021-01-06 20:56:35,344 WARN L197 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2021-01-06 20:56:35,729 WARN L197 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2021-01-06 20:56:36,132 WARN L197 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2021-01-06 20:56:36,407 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2021-01-06 20:56:36,761 WARN L197 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2021-01-06 20:56:37,298 WARN L197 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2021-01-06 20:56:38,237 WARN L197 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2021-01-06 20:56:38,702 WARN L197 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2021-01-06 20:56:39,629 WARN L197 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2021-01-06 20:56:40,130 WARN L197 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2021-01-06 20:56:41,123 WARN L197 SmtUtils]: Spent 866.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2021-01-06 20:56:42,453 WARN L197 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2021-01-06 20:56:42,958 WARN L197 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2021-01-06 20:56:43,390 WARN L197 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2021-01-06 20:56:44,324 WARN L197 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2021-01-06 20:56:45,380 WARN L197 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2021-01-06 20:56:45,871 WARN L197 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2021-01-06 20:56:46,269 WARN L197 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2021-01-06 20:56:47,435 WARN L197 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2021-01-06 20:56:48,772 WARN L197 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 109 DAG size of output: 99 [2021-01-06 20:56:49,327 WARN L197 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2021-01-06 20:56:49,912 WARN L197 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2021-01-06 20:56:50,306 WARN L197 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2021-01-06 20:56:50,863 WARN L197 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2021-01-06 20:56:52,170 WARN L197 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2021-01-06 20:56:53,347 WARN L197 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2021-01-06 20:56:54,719 WARN L197 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2021-01-06 20:56:56,070 WARN L197 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2021-01-06 20:56:57,360 WARN L197 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2021-01-06 20:56:57,985 WARN L197 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2021-01-06 20:56:58,824 WARN L197 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2021-01-06 20:56:59,384 WARN L197 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2021-01-06 20:56:59,948 WARN L197 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2021-01-06 20:57:01,288 WARN L197 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2021-01-06 20:57:01,931 WARN L197 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2021-01-06 20:57:02,378 WARN L197 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2021-01-06 20:57:03,150 WARN L197 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2021-01-06 20:57:03,718 WARN L197 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2021-01-06 20:57:05,180 WARN L197 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2021-01-06 20:57:06,448 WARN L197 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2021-01-06 20:57:07,614 WARN L197 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2021-01-06 20:57:09,287 WARN L197 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2021-01-06 20:57:10,650 WARN L197 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2021-01-06 20:57:12,542 WARN L197 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2021-01-06 20:57:14,056 WARN L197 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2021-01-06 20:57:16,091 WARN L197 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 110 DAG size of output: 100 [2021-01-06 20:57:18,105 WARN L197 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2021-01-06 20:57:18,798 WARN L197 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2021-01-06 20:57:19,369 WARN L197 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2021-01-06 20:57:20,521 WARN L197 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2021-01-06 20:57:21,447 WARN L197 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-01-06 20:57:22,442 WARN L197 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2021-01-06 20:57:23,171 WARN L197 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2021-01-06 20:57:23,923 WARN L197 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2021-01-06 20:57:24,723 WARN L197 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2021-01-06 20:57:26,166 WARN L197 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2021-01-06 20:57:27,838 WARN L197 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2021-01-06 20:57:28,877 WARN L197 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2021-01-06 20:57:29,605 WARN L197 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2021-01-06 20:57:31,596 WARN L197 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2021-01-06 20:57:33,818 WARN L197 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2021-01-06 20:57:36,153 WARN L197 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2021-01-06 20:57:38,954 WARN L197 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2021-01-06 20:57:40,871 WARN L197 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2021-01-06 20:57:43,868 WARN L197 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2021-01-06 20:57:45,904 WARN L197 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2021-01-06 20:57:50,574 WARN L197 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 119 DAG size of output: 110 [2021-01-06 20:57:55,843 WARN L197 SmtUtils]: Spent 4.87 s on a formula simplification. DAG size of input: 120 DAG size of output: 110 [2021-01-06 20:58:01,484 WARN L197 SmtUtils]: Spent 5.16 s on a formula simplification. DAG size of input: 123 DAG size of output: 113 [2021-01-06 20:58:03,180 WARN L197 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2021-01-06 20:58:04,988 WARN L197 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-01-06 20:58:06,841 WARN L197 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2021-01-06 20:58:09,550 WARN L197 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2021-01-06 20:58:13,015 WARN L197 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2021-01-06 20:58:15,895 WARN L197 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2021-01-06 20:58:17,175 WARN L197 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2021-01-06 20:58:18,574 WARN L197 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2021-01-06 20:58:21,027 WARN L197 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 97 DAG size of output: 88 [2021-01-06 20:58:22,005 WARN L197 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2021-01-06 20:58:23,126 WARN L197 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2021-01-06 20:58:27,522 WARN L197 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 105 DAG size of output: 96