/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/pals_lcr.8.ufo.BOUNDED-16.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 10:01:14,548 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 10:01:14,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 10:01:14,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 10:01:14,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 10:01:14,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 10:01:14,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 10:01:14,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 10:01:14,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 10:01:14,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 10:01:14,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 10:01:14,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 10:01:14,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 10:01:14,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 10:01:14,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 10:01:14,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 10:01:14,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 10:01:14,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 10:01:14,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 10:01:14,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 10:01:14,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 10:01:14,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 10:01:14,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 10:01:14,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 10:01:14,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 10:01:14,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 10:01:14,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 10:01:14,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 10:01:14,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 10:01:14,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 10:01:14,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 10:01:14,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 10:01:14,642 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 10:01:14,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 10:01:14,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 10:01:14,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 10:01:14,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 10:01:14,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 10:01:14,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 10:01:14,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 10:01:14,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 10:01:14,651 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 10:01:14,681 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 10:01:14,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 10:01:14,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 10:01:14,683 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 10:01:14,683 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 10:01:14,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 10:01:14,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 10:01:14,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 10:01:14,684 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 10:01:14,684 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 10:01:14,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 10:01:14,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 10:01:14,685 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 10:01:14,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 10:01:14,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 10:01:14,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 10:01:14,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 10:01:14,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 10:01:14,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 10:01:14,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 10:01:14,687 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 10:01:14,688 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 10:01:14,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 10:01:14,688 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 10:01:14,688 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 10:01:14,689 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 10:01:15,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 10:01:15,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 10:01:15,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 10:01:15,143 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 10:01:15,144 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 10:01:15,145 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.BOUNDED-16.pals.c [2020-12-23 10:01:15,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0f4dd1530/53458f342aa046bfb79d87f175bdfd73/FLAGe54840a67 [2020-12-23 10:01:15,930 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 10:01:15,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.BOUNDED-16.pals.c [2020-12-23 10:01:15,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0f4dd1530/53458f342aa046bfb79d87f175bdfd73/FLAGe54840a67 [2020-12-23 10:01:16,239 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0f4dd1530/53458f342aa046bfb79d87f175bdfd73 [2020-12-23 10:01:16,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 10:01:16,244 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 10:01:16,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 10:01:16,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 10:01:16,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 10:01:16,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:01:16" (1/1) ... [2020-12-23 10:01:16,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@195fe419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:16, skipping insertion in model container [2020-12-23 10:01:16,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:01:16" (1/1) ... [2020-12-23 10:01:16,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 10:01:16,348 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p8_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[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] 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[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] 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[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m8~0,] left hand side expression in assignment: lhs: VariableLHS[~m8~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~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[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2020-12-23 10:01:16,765 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/pals_lcr.8.ufo.BOUNDED-16.pals.c[26453,26466] [2020-12-23 10:01:16,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 10:01:16,794 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p8_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[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] 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[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] 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[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m8~0,] left hand side expression in assignment: lhs: VariableLHS[~m8~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~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[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2020-12-23 10:01:16,957 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/pals_lcr.8.ufo.BOUNDED-16.pals.c[26453,26466] [2020-12-23 10:01:16,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 10:01:16,998 INFO L208 MainTranslator]: Completed translation [2020-12-23 10:01:16,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:16 WrapperNode [2020-12-23 10:01:16,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 10:01:17,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 10:01:17,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 10:01:17,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 10:01:17,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:16" (1/1) ... [2020-12-23 10:01:17,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:16" (1/1) ... [2020-12-23 10:01:17,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 10:01:17,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 10:01:17,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 10:01:17,123 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 10:01:17,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:16" (1/1) ... [2020-12-23 10:01:17,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:16" (1/1) ... [2020-12-23 10:01:17,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:16" (1/1) ... [2020-12-23 10:01:17,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:16" (1/1) ... [2020-12-23 10:01:17,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:16" (1/1) ... [2020-12-23 10:01:17,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:16" (1/1) ... [2020-12-23 10:01:17,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:16" (1/1) ... [2020-12-23 10:01:17,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 10:01:17,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 10:01:17,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 10:01:17,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 10:01:17,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:16" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 10:01:17,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 10:01:17,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 10:01:17,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 10:01:17,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 10:01:18,417 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 10:01:18,421 INFO L299 CfgBuilder]: Removed 29 assume(true) statements. [2020-12-23 10:01:18,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:01:18 BoogieIcfgContainer [2020-12-23 10:01:18,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 10:01:18,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 10:01:18,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 10:01:18,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 10:01:18,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 10:01:16" (1/3) ... [2020-12-23 10:01:18,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5d81ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:01:18, skipping insertion in model container [2020-12-23 10:01:18,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:16" (2/3) ... [2020-12-23 10:01:18,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5d81ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:01:18, skipping insertion in model container [2020-12-23 10:01:18,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:01:18" (3/3) ... [2020-12-23 10:01:18,441 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.BOUNDED-16.pals.c [2020-12-23 10:01:18,448 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 10:01:18,454 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 10:01:18,478 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 10:01:18,528 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 10:01:18,528 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 10:01:18,529 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 10:01:18,529 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 10:01:18,530 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 10:01:18,533 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 10:01:18,533 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 10:01:18,533 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 10:01:18,553 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2020-12-23 10:01:18,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 10:01:18,563 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:18,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] [2020-12-23 10:01:18,564 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:18,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:18,571 INFO L82 PathProgramCache]: Analyzing trace with hash -486996250, now seen corresponding path program 1 times [2020-12-23 10:01:18,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:18,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125035857] [2020-12-23 10:01:18,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:18,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125035857] [2020-12-23 10:01:18,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:18,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 10:01:18,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091452859] [2020-12-23 10:01:18,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 10:01:18,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:18,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 10:01:18,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 10:01:18,918 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 2 states. [2020-12-23 10:01:18,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:18,956 INFO L93 Difference]: Finished difference Result 228 states and 384 transitions. [2020-12-23 10:01:18,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 10:01:18,958 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 45 [2020-12-23 10:01:18,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:18,970 INFO L225 Difference]: With dead ends: 228 [2020-12-23 10:01:18,971 INFO L226 Difference]: Without dead ends: 143 [2020-12-23 10:01:18,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 10:01:18,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-12-23 10:01:19,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2020-12-23 10:01:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-12-23 10:01:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 249 transitions. [2020-12-23 10:01:19,032 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 249 transitions. Word has length 45 [2020-12-23 10:01:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:19,032 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 249 transitions. [2020-12-23 10:01:19,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 10:01:19,033 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 249 transitions. [2020-12-23 10:01:19,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 10:01:19,035 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:19,036 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] [2020-12-23 10:01:19,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 10:01:19,036 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:19,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:19,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1858803548, now seen corresponding path program 1 times [2020-12-23 10:01:19,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:19,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340803651] [2020-12-23 10:01:19,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:19,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340803651] [2020-12-23 10:01:19,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:19,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:01:19,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476113358] [2020-12-23 10:01:19,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 10:01:19,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:19,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 10:01:19,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:01:19,246 INFO L87 Difference]: Start difference. First operand 143 states and 249 transitions. Second operand 5 states. [2020-12-23 10:01:19,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:19,494 INFO L93 Difference]: Finished difference Result 223 states and 374 transitions. [2020-12-23 10:01:19,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 10:01:19,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2020-12-23 10:01:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:19,501 INFO L225 Difference]: With dead ends: 223 [2020-12-23 10:01:19,502 INFO L226 Difference]: Without dead ends: 143 [2020-12-23 10:01:19,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 10:01:19,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-12-23 10:01:19,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2020-12-23 10:01:19,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-12-23 10:01:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 188 transitions. [2020-12-23 10:01:19,544 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 188 transitions. Word has length 45 [2020-12-23 10:01:19,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:19,545 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 188 transitions. [2020-12-23 10:01:19,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 10:01:19,545 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 188 transitions. [2020-12-23 10:01:19,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 10:01:19,556 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:19,556 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:19,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 10:01:19,557 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:19,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:19,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1176555156, now seen corresponding path program 1 times [2020-12-23 10:01:19,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:19,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050702249] [2020-12-23 10:01:19,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:19,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050702249] [2020-12-23 10:01:19,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:19,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:19,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727699475] [2020-12-23 10:01:19,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:19,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:19,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:19,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:19,904 INFO L87 Difference]: Start difference. First operand 143 states and 188 transitions. Second operand 3 states. [2020-12-23 10:01:19,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:19,933 INFO L93 Difference]: Finished difference Result 289 states and 420 transitions. [2020-12-23 10:01:19,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:19,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-12-23 10:01:19,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:19,937 INFO L225 Difference]: With dead ends: 289 [2020-12-23 10:01:19,938 INFO L226 Difference]: Without dead ends: 213 [2020-12-23 10:01:19,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:19,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-12-23 10:01:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2020-12-23 10:01:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-12-23 10:01:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 297 transitions. [2020-12-23 10:01:19,956 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 297 transitions. Word has length 105 [2020-12-23 10:01:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:19,957 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 297 transitions. [2020-12-23 10:01:19,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 297 transitions. [2020-12-23 10:01:19,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 10:01:19,959 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:19,960 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:19,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 10:01:19,960 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:19,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:19,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1701405430, now seen corresponding path program 1 times [2020-12-23 10:01:19,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:19,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627540362] [2020-12-23 10:01:19,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:20,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:20,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627540362] [2020-12-23 10:01:20,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:20,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:20,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491404223] [2020-12-23 10:01:20,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:20,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:20,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:20,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:20,223 INFO L87 Difference]: Start difference. First operand 211 states and 297 transitions. Second operand 3 states. [2020-12-23 10:01:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:20,261 INFO L93 Difference]: Finished difference Result 487 states and 737 transitions. [2020-12-23 10:01:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:20,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-12-23 10:01:20,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:20,267 INFO L225 Difference]: With dead ends: 487 [2020-12-23 10:01:20,267 INFO L226 Difference]: Without dead ends: 343 [2020-12-23 10:01:20,271 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:20,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-12-23 10:01:20,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2020-12-23 10:01:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-12-23 10:01:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 504 transitions. [2020-12-23 10:01:20,314 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 504 transitions. Word has length 105 [2020-12-23 10:01:20,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:20,315 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 504 transitions. [2020-12-23 10:01:20,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:20,315 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 504 transitions. [2020-12-23 10:01:20,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 10:01:20,316 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:20,317 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:20,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 10:01:20,317 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:20,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:20,318 INFO L82 PathProgramCache]: Analyzing trace with hash -179136962, now seen corresponding path program 1 times [2020-12-23 10:01:20,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:20,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843652164] [2020-12-23 10:01:20,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:20,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843652164] [2020-12-23 10:01:20,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:20,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:20,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58602830] [2020-12-23 10:01:20,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:20,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:20,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:20,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:20,485 INFO L87 Difference]: Start difference. First operand 341 states and 504 transitions. Second operand 3 states. [2020-12-23 10:01:20,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:20,547 INFO L93 Difference]: Finished difference Result 865 states and 1338 transitions. [2020-12-23 10:01:20,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:20,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-12-23 10:01:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:20,553 INFO L225 Difference]: With dead ends: 865 [2020-12-23 10:01:20,553 INFO L226 Difference]: Without dead ends: 591 [2020-12-23 10:01:20,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-12-23 10:01:20,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2020-12-23 10:01:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2020-12-23 10:01:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 896 transitions. [2020-12-23 10:01:20,584 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 896 transitions. Word has length 105 [2020-12-23 10:01:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:20,584 INFO L481 AbstractCegarLoop]: Abstraction has 589 states and 896 transitions. [2020-12-23 10:01:20,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 896 transitions. [2020-12-23 10:01:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 10:01:20,586 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:20,586 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:20,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 10:01:20,587 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:20,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:20,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1430042254, now seen corresponding path program 1 times [2020-12-23 10:01:20,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:20,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365348561] [2020-12-23 10:01:20,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:20,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:20,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365348561] [2020-12-23 10:01:20,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:20,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:20,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227303964] [2020-12-23 10:01:20,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:20,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:20,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:20,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:20,716 INFO L87 Difference]: Start difference. First operand 589 states and 896 transitions. Second operand 3 states. [2020-12-23 10:01:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:20,764 INFO L93 Difference]: Finished difference Result 1585 states and 2474 transitions. [2020-12-23 10:01:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:20,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-12-23 10:01:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:20,772 INFO L225 Difference]: With dead ends: 1585 [2020-12-23 10:01:20,772 INFO L226 Difference]: Without dead ends: 1063 [2020-12-23 10:01:20,773 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:20,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2020-12-23 10:01:20,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1061. [2020-12-23 10:01:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2020-12-23 10:01:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1636 transitions. [2020-12-23 10:01:20,841 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1636 transitions. Word has length 105 [2020-12-23 10:01:20,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:20,841 INFO L481 AbstractCegarLoop]: Abstraction has 1061 states and 1636 transitions. [2020-12-23 10:01:20,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:20,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1636 transitions. [2020-12-23 10:01:20,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 10:01:20,842 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:20,843 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:20,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 10:01:20,843 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:20,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:20,844 INFO L82 PathProgramCache]: Analyzing trace with hash 2119342312, now seen corresponding path program 1 times [2020-12-23 10:01:20,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:20,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114611918] [2020-12-23 10:01:20,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:21,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114611918] [2020-12-23 10:01:21,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:21,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:21,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625600676] [2020-12-23 10:01:21,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:21,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:21,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:21,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:21,006 INFO L87 Difference]: Start difference. First operand 1061 states and 1636 transitions. Second operand 3 states. [2020-12-23 10:01:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:21,077 INFO L93 Difference]: Finished difference Result 2953 states and 4614 transitions. [2020-12-23 10:01:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:21,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-12-23 10:01:21,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:21,090 INFO L225 Difference]: With dead ends: 2953 [2020-12-23 10:01:21,090 INFO L226 Difference]: Without dead ends: 1959 [2020-12-23 10:01:21,093 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:21,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2020-12-23 10:01:21,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1957. [2020-12-23 10:01:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1957 states. [2020-12-23 10:01:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3028 transitions. [2020-12-23 10:01:21,169 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3028 transitions. Word has length 105 [2020-12-23 10:01:21,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:21,170 INFO L481 AbstractCegarLoop]: Abstraction has 1957 states and 3028 transitions. [2020-12-23 10:01:21,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:21,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3028 transitions. [2020-12-23 10:01:21,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 10:01:21,171 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:21,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:21,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 10:01:21,172 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:21,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:21,172 INFO L82 PathProgramCache]: Analyzing trace with hash 179311454, now seen corresponding path program 1 times [2020-12-23 10:01:21,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:21,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580099529] [2020-12-23 10:01:21,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:21,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580099529] [2020-12-23 10:01:21,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:21,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:21,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163248267] [2020-12-23 10:01:21,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:21,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:21,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:21,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:21,296 INFO L87 Difference]: Start difference. First operand 1957 states and 3028 transitions. Second operand 3 states. [2020-12-23 10:01:21,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:21,435 INFO L93 Difference]: Finished difference Result 5545 states and 8630 transitions. [2020-12-23 10:01:21,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:21,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-12-23 10:01:21,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:21,457 INFO L225 Difference]: With dead ends: 5545 [2020-12-23 10:01:21,457 INFO L226 Difference]: Without dead ends: 3655 [2020-12-23 10:01:21,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:21,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3655 states. [2020-12-23 10:01:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3655 to 3653. [2020-12-23 10:01:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3653 states. [2020-12-23 10:01:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 5636 transitions. [2020-12-23 10:01:21,610 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 5636 transitions. Word has length 105 [2020-12-23 10:01:21,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:21,611 INFO L481 AbstractCegarLoop]: Abstraction has 3653 states and 5636 transitions. [2020-12-23 10:01:21,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 5636 transitions. [2020-12-23 10:01:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 10:01:21,612 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:21,612 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:21,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 10:01:21,613 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:21,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:21,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1414973228, now seen corresponding path program 1 times [2020-12-23 10:01:21,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:21,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152676263] [2020-12-23 10:01:21,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:21,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:21,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152676263] [2020-12-23 10:01:21,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:21,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:01:21,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061744963] [2020-12-23 10:01:21,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 10:01:21,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:21,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 10:01:21,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 10:01:21,823 INFO L87 Difference]: Start difference. First operand 3653 states and 5636 transitions. Second operand 6 states. [2020-12-23 10:01:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:22,244 INFO L93 Difference]: Finished difference Result 7239 states and 11205 transitions. [2020-12-23 10:01:22,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 10:01:22,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2020-12-23 10:01:22,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:22,265 INFO L225 Difference]: With dead ends: 7239 [2020-12-23 10:01:22,265 INFO L226 Difference]: Without dead ends: 3653 [2020-12-23 10:01:22,273 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-23 10:01:22,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3653 states. [2020-12-23 10:01:22,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3653 to 3653. [2020-12-23 10:01:22,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3653 states. [2020-12-23 10:01:22,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 5604 transitions. [2020-12-23 10:01:22,519 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 5604 transitions. Word has length 105 [2020-12-23 10:01:22,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:22,519 INFO L481 AbstractCegarLoop]: Abstraction has 3653 states and 5604 transitions. [2020-12-23 10:01:22,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 10:01:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 5604 transitions. [2020-12-23 10:01:22,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 10:01:22,520 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:22,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:22,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 10:01:22,521 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:22,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:22,522 INFO L82 PathProgramCache]: Analyzing trace with hash -905500138, now seen corresponding path program 1 times [2020-12-23 10:01:22,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:22,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709361813] [2020-12-23 10:01:22,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:22,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:22,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709361813] [2020-12-23 10:01:22,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:22,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:01:22,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472341126] [2020-12-23 10:01:22,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 10:01:22,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:22,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 10:01:22,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 10:01:22,662 INFO L87 Difference]: Start difference. First operand 3653 states and 5604 transitions. Second operand 6 states. [2020-12-23 10:01:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:23,069 INFO L93 Difference]: Finished difference Result 7239 states and 11141 transitions. [2020-12-23 10:01:23,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 10:01:23,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2020-12-23 10:01:23,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:23,091 INFO L225 Difference]: With dead ends: 7239 [2020-12-23 10:01:23,091 INFO L226 Difference]: Without dead ends: 3653 [2020-12-23 10:01:23,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-23 10:01:23,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3653 states. [2020-12-23 10:01:23,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3653 to 3653. [2020-12-23 10:01:23,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3653 states. [2020-12-23 10:01:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 5572 transitions. [2020-12-23 10:01:23,300 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 5572 transitions. Word has length 105 [2020-12-23 10:01:23,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:23,301 INFO L481 AbstractCegarLoop]: Abstraction has 3653 states and 5572 transitions. [2020-12-23 10:01:23,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 10:01:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 5572 transitions. [2020-12-23 10:01:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 10:01:23,302 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:23,303 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:23,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 10:01:23,303 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:23,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1180259752, now seen corresponding path program 1 times [2020-12-23 10:01:23,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:23,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833720077] [2020-12-23 10:01:23,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:23,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:23,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833720077] [2020-12-23 10:01:23,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:23,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 10:01:23,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104122838] [2020-12-23 10:01:23,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 10:01:23,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:23,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 10:01:23,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-12-23 10:01:23,668 INFO L87 Difference]: Start difference. First operand 3653 states and 5572 transitions. Second operand 10 states. [2020-12-23 10:01:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:27,515 INFO L93 Difference]: Finished difference Result 61029 states and 93652 transitions. [2020-12-23 10:01:27,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 10:01:27,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2020-12-23 10:01:27,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:27,737 INFO L225 Difference]: With dead ends: 61029 [2020-12-23 10:01:27,738 INFO L226 Difference]: Without dead ends: 57443 [2020-12-23 10:01:27,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-12-23 10:01:27,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57443 states. [2020-12-23 10:01:28,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57443 to 7237. [2020-12-23 10:01:28,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7237 states. [2020-12-23 10:01:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7237 states to 7237 states and 10948 transitions. [2020-12-23 10:01:28,996 INFO L78 Accepts]: Start accepts. Automaton has 7237 states and 10948 transitions. Word has length 105 [2020-12-23 10:01:28,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:28,996 INFO L481 AbstractCegarLoop]: Abstraction has 7237 states and 10948 transitions. [2020-12-23 10:01:28,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 10:01:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 7237 states and 10948 transitions. [2020-12-23 10:01:28,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 10:01:28,998 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:28,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:28,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 10:01:28,999 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:29,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:29,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1773942360, now seen corresponding path program 1 times [2020-12-23 10:01:29,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:29,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621192072] [2020-12-23 10:01:29,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:29,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621192072] [2020-12-23 10:01:29,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:29,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:29,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583656571] [2020-12-23 10:01:29,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:29,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:29,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:29,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:29,072 INFO L87 Difference]: Start difference. First operand 7237 states and 10948 transitions. Second operand 3 states. [2020-12-23 10:01:30,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:30,025 INFO L93 Difference]: Finished difference Result 18185 states and 27398 transitions. [2020-12-23 10:01:30,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:30,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-12-23 10:01:30,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:30,051 INFO L225 Difference]: With dead ends: 18185 [2020-12-23 10:01:30,051 INFO L226 Difference]: Without dead ends: 11015 [2020-12-23 10:01:30,061 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:30,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11015 states. [2020-12-23 10:01:31,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11015 to 11013. [2020-12-23 10:01:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11013 states. [2020-12-23 10:01:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11013 states to 11013 states and 16324 transitions. [2020-12-23 10:01:31,147 INFO L78 Accepts]: Start accepts. Automaton has 11013 states and 16324 transitions. Word has length 107 [2020-12-23 10:01:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:31,147 INFO L481 AbstractCegarLoop]: Abstraction has 11013 states and 16324 transitions. [2020-12-23 10:01:31,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:31,148 INFO L276 IsEmpty]: Start isEmpty. Operand 11013 states and 16324 transitions. [2020-12-23 10:01:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 10:01:31,149 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:31,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 10:01:31,150 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:31,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:31,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1707448848, now seen corresponding path program 1 times [2020-12-23 10:01:31,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:31,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897218672] [2020-12-23 10:01:31,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:31,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:31,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897218672] [2020-12-23 10:01:31,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:31,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 10:01:31,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662676326] [2020-12-23 10:01:31,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 10:01:31,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:31,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 10:01:31,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-23 10:01:31,597 INFO L87 Difference]: Start difference. First operand 11013 states and 16324 transitions. Second operand 10 states. [2020-12-23 10:01:32,129 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-12-23 10:01:33,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:33,313 INFO L93 Difference]: Finished difference Result 27403 states and 40727 transitions. [2020-12-23 10:01:33,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 10:01:33,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 107 [2020-12-23 10:01:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:33,347 INFO L225 Difference]: With dead ends: 27403 [2020-12-23 10:01:33,347 INFO L226 Difference]: Without dead ends: 16457 [2020-12-23 10:01:33,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2020-12-23 10:01:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16457 states. [2020-12-23 10:01:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16457 to 11013. [2020-12-23 10:01:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11013 states. [2020-12-23 10:01:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11013 states to 11013 states and 16260 transitions. [2020-12-23 10:01:34,283 INFO L78 Accepts]: Start accepts. Automaton has 11013 states and 16260 transitions. Word has length 107 [2020-12-23 10:01:34,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:34,283 INFO L481 AbstractCegarLoop]: Abstraction has 11013 states and 16260 transitions. [2020-12-23 10:01:34,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 10:01:34,283 INFO L276 IsEmpty]: Start isEmpty. Operand 11013 states and 16260 transitions. [2020-12-23 10:01:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 10:01:34,284 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:34,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:34,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 10:01:34,285 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:34,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:34,286 INFO L82 PathProgramCache]: Analyzing trace with hash 81465228, now seen corresponding path program 1 times [2020-12-23 10:01:34,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:34,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567789312] [2020-12-23 10:01:34,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:34,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567789312] [2020-12-23 10:01:34,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:34,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:34,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386930386] [2020-12-23 10:01:34,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:34,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:34,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:34,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:34,371 INFO L87 Difference]: Start difference. First operand 11013 states and 16260 transitions. Second operand 3 states. [2020-12-23 10:01:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:36,062 INFO L93 Difference]: Finished difference Result 31753 states and 46726 transitions. [2020-12-23 10:01:36,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:36,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-12-23 10:01:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:36,098 INFO L225 Difference]: With dead ends: 31753 [2020-12-23 10:01:36,098 INFO L226 Difference]: Without dead ends: 20807 [2020-12-23 10:01:36,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20807 states. [2020-12-23 10:01:37,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20807 to 20805. [2020-12-23 10:01:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20805 states. [2020-12-23 10:01:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20805 states to 20805 states and 30340 transitions. [2020-12-23 10:01:37,912 INFO L78 Accepts]: Start accepts. Automaton has 20805 states and 30340 transitions. Word has length 107 [2020-12-23 10:01:37,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:37,913 INFO L481 AbstractCegarLoop]: Abstraction has 20805 states and 30340 transitions. [2020-12-23 10:01:37,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:37,913 INFO L276 IsEmpty]: Start isEmpty. Operand 20805 states and 30340 transitions. [2020-12-23 10:01:37,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 10:01:37,914 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:37,914 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:37,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 10:01:37,914 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:37,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:37,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1328972844, now seen corresponding path program 1 times [2020-12-23 10:01:37,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:37,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836216797] [2020-12-23 10:01:37,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:38,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836216797] [2020-12-23 10:01:38,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:38,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:38,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835566176] [2020-12-23 10:01:38,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:38,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:38,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:38,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:38,012 INFO L87 Difference]: Start difference. First operand 20805 states and 30340 transitions. Second operand 3 states. [2020-12-23 10:01:40,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:40,680 INFO L93 Difference]: Finished difference Result 59977 states and 87046 transitions. [2020-12-23 10:01:40,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:40,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-12-23 10:01:40,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:40,722 INFO L225 Difference]: With dead ends: 59977 [2020-12-23 10:01:40,722 INFO L226 Difference]: Without dead ends: 39239 [2020-12-23 10:01:40,751 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:40,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39239 states. [2020-12-23 10:01:44,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39239 to 39237. [2020-12-23 10:01:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39237 states. [2020-12-23 10:01:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39237 states to 39237 states and 56388 transitions. [2020-12-23 10:01:44,332 INFO L78 Accepts]: Start accepts. Automaton has 39237 states and 56388 transitions. Word has length 107 [2020-12-23 10:01:44,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:44,333 INFO L481 AbstractCegarLoop]: Abstraction has 39237 states and 56388 transitions. [2020-12-23 10:01:44,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:44,333 INFO L276 IsEmpty]: Start isEmpty. Operand 39237 states and 56388 transitions. [2020-12-23 10:01:44,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-23 10:01:44,334 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:44,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:44,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 10:01:44,335 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:44,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:44,335 INFO L82 PathProgramCache]: Analyzing trace with hash 892169983, now seen corresponding path program 1 times [2020-12-23 10:01:44,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:44,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921473481] [2020-12-23 10:01:44,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:44,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921473481] [2020-12-23 10:01:44,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:44,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:44,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774156640] [2020-12-23 10:01:44,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:44,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:44,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:44,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:44,606 INFO L87 Difference]: Start difference. First operand 39237 states and 56388 transitions. Second operand 3 states. [2020-12-23 10:01:48,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:48,365 INFO L93 Difference]: Finished difference Result 90571 states and 130504 transitions. [2020-12-23 10:01:48,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:48,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2020-12-23 10:01:48,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:48,420 INFO L225 Difference]: With dead ends: 90571 [2020-12-23 10:01:48,420 INFO L226 Difference]: Without dead ends: 51401 [2020-12-23 10:01:48,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51401 states. [2020-12-23 10:01:52,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51401 to 51399. [2020-12-23 10:01:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51399 states. [2020-12-23 10:01:52,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51399 states to 51399 states and 73798 transitions. [2020-12-23 10:01:52,898 INFO L78 Accepts]: Start accepts. Automaton has 51399 states and 73798 transitions. Word has length 108 [2020-12-23 10:01:52,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:52,898 INFO L481 AbstractCegarLoop]: Abstraction has 51399 states and 73798 transitions. [2020-12-23 10:01:52,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:52,899 INFO L276 IsEmpty]: Start isEmpty. Operand 51399 states and 73798 transitions. [2020-12-23 10:01:52,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-23 10:01:52,900 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:52,900 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:52,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 10:01:52,900 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:52,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:52,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1806029504, now seen corresponding path program 1 times [2020-12-23 10:01:52,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:52,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123930779] [2020-12-23 10:01:52,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:53,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:53,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123930779] [2020-12-23 10:01:53,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:53,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 10:01:53,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041544369] [2020-12-23 10:01:53,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 10:01:53,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:53,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 10:01:53,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 10:01:53,018 INFO L87 Difference]: Start difference. First operand 51399 states and 73798 transitions. Second operand 8 states. [2020-12-23 10:01:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:59,416 INFO L93 Difference]: Finished difference Result 81265 states and 116218 transitions. [2020-12-23 10:01:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 10:01:59,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2020-12-23 10:01:59,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:59,503 INFO L225 Difference]: With dead ends: 81265 [2020-12-23 10:01:59,503 INFO L226 Difference]: Without dead ends: 81263 [2020-12-23 10:01:59,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2020-12-23 10:01:59,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81263 states. [2020-12-23 10:02:04,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81263 to 52167. [2020-12-23 10:02:04,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52167 states. [2020-12-23 10:02:04,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52167 states to 52167 states and 74182 transitions. [2020-12-23 10:02:04,367 INFO L78 Accepts]: Start accepts. Automaton has 52167 states and 74182 transitions. Word has length 108 [2020-12-23 10:02:04,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:04,367 INFO L481 AbstractCegarLoop]: Abstraction has 52167 states and 74182 transitions. [2020-12-23 10:02:04,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 10:02:04,367 INFO L276 IsEmpty]: Start isEmpty. Operand 52167 states and 74182 transitions. [2020-12-23 10:02:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-23 10:02:04,399 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:04,399 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:02:04,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 10:02:04,400 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:04,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:04,400 INFO L82 PathProgramCache]: Analyzing trace with hash 150223880, now seen corresponding path program 1 times [2020-12-23 10:02:04,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:04,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081983814] [2020-12-23 10:02:04,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 10:02:04,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081983814] [2020-12-23 10:02:04,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:04,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 10:02:04,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385736594] [2020-12-23 10:02:04,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 10:02:04,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:04,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 10:02:04,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-23 10:02:04,675 INFO L87 Difference]: Start difference. First operand 52167 states and 74182 transitions. Second operand 10 states. [2020-12-23 10:02:36,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:36,908 INFO L93 Difference]: Finished difference Result 482649 states and 686031 transitions. [2020-12-23 10:02:36,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 10:02:36,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 148 [2020-12-23 10:02:36,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:37,937 INFO L225 Difference]: With dead ends: 482649 [2020-12-23 10:02:37,937 INFO L226 Difference]: Without dead ends: 430551 [2020-12-23 10:02:38,103 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-12-23 10:02:38,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430551 states. [2020-12-23 10:02:50,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430551 to 104263. [2020-12-23 10:02:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104263 states. [2020-12-23 10:02:50,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104263 states to 104263 states and 147782 transitions. [2020-12-23 10:02:50,617 INFO L78 Accepts]: Start accepts. Automaton has 104263 states and 147782 transitions. Word has length 148 [2020-12-23 10:02:50,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:50,618 INFO L481 AbstractCegarLoop]: Abstraction has 104263 states and 147782 transitions. [2020-12-23 10:02:50,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 10:02:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 104263 states and 147782 transitions. [2020-12-23 10:02:50,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-23 10:02:50,662 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:50,662 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:02:50,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 10:02:50,663 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:50,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:50,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1397731496, now seen corresponding path program 1 times [2020-12-23 10:02:50,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:50,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808240113] [2020-12-23 10:02:50,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 10:02:50,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808240113] [2020-12-23 10:02:50,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:50,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 10:02:50,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371474834] [2020-12-23 10:02:50,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 10:02:50,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:50,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 10:02:50,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-23 10:02:50,922 INFO L87 Difference]: Start difference. First operand 104263 states and 147782 transitions. Second operand 10 states. [2020-12-23 10:03:31,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:31,138 INFO L93 Difference]: Finished difference Result 534745 states and 759631 transitions. [2020-12-23 10:03:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 10:03:31,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 148 [2020-12-23 10:03:31,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:32,212 INFO L225 Difference]: With dead ends: 534745 [2020-12-23 10:03:32,213 INFO L226 Difference]: Without dead ends: 482647 [2020-12-23 10:03:32,380 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-12-23 10:03:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482647 states. [2020-12-23 10:03:51,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482647 to 182215. [2020-12-23 10:03:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182215 states. [2020-12-23 10:03:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182215 states to 182215 states and 257606 transitions. [2020-12-23 10:03:52,622 INFO L78 Accepts]: Start accepts. Automaton has 182215 states and 257606 transitions. Word has length 148 [2020-12-23 10:03:52,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:52,623 INFO L481 AbstractCegarLoop]: Abstraction has 182215 states and 257606 transitions. [2020-12-23 10:03:52,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 10:03:52,623 INFO L276 IsEmpty]: Start isEmpty. Operand 182215 states and 257606 transitions. [2020-12-23 10:03:52,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-23 10:03:52,666 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:52,666 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:03:52,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 10:03:52,666 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:52,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:52,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1427802818, now seen corresponding path program 1 times [2020-12-23 10:03:52,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:52,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354695876] [2020-12-23 10:03:52,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:52,921 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 10:03:52,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354695876] [2020-12-23 10:03:52,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:52,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 10:03:52,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305050898] [2020-12-23 10:03:52,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 10:03:52,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:52,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 10:03:52,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-12-23 10:03:52,925 INFO L87 Difference]: Start difference. First operand 182215 states and 257606 transitions. Second operand 10 states.