/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_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:56:07,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:56:07,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:56:07,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:56:07,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:56:07,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:56:07,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:56:07,118 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:56:07,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:56:07,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:56:07,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:56:07,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:56:07,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:56:07,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:56:07,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:56:07,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:56:07,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:56:07,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:56:07,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:56:07,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:56:07,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:56:07,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:56:07,163 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:56:07,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:56:07,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:56:07,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:56:07,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:56:07,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:56:07,177 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:56:07,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:56:07,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:56:07,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:56:07,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:56:07,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:56:07,182 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:56:07,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:56:07,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:56:07,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:56:07,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:56:07,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:56:07,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:56:07,193 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:56:07,235 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:56:07,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:56:07,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:56:07,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:56:07,241 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:56:07,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:56:07,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:56:07,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:56:07,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:56:07,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:56:07,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:56:07,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:56:07,243 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:56:07,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:56:07,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:56:07,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:56:07,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:56:07,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:56:07,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:56:07,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:56:07,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:56:07,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:56:07,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:56:07,245 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:56:07,246 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:56:07,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:56:07,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:56:07,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:56:07,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:56:07,754 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:56:07,754 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:56:07,756 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2021-01-06 19:56:07,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3d18ed0f0/a30e670247d54cb99dfdebe9537245ca/FLAGda2d4cdcb [2021-01-06 19:56:08,479 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:56:08,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2021-01-06 19:56:08,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3d18ed0f0/a30e670247d54cb99dfdebe9537245ca/FLAGda2d4cdcb [2021-01-06 19:56:08,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3d18ed0f0/a30e670247d54cb99dfdebe9537245ca [2021-01-06 19:56:08,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:56:08,775 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:56:08,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:56:08,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:56:08,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:56:08,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:56:08" (1/1) ... [2021-01-06 19:56:08,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38caa21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:08, skipping insertion in model container [2021-01-06 19:56:08,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:56:08" (1/1) ... [2021-01-06 19:56:08,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:56:08,859 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r121~0,] left hand side expression in assignment: lhs: VariableLHS[~r131~0,] left hand side expression in assignment: lhs: VariableLHS[~r211~0,] left hand side expression in assignment: lhs: VariableLHS[~r231~0,] left hand side expression in assignment: lhs: VariableLHS[~r311~0,] left hand side expression in assignment: lhs: VariableLHS[~r321~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[~r122~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~r132~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~r212~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~r232~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r312~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~r322~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~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[~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[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:56:09,120 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_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c[14521,14534] [2021-01-06 19:56:09,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:56:09,139 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r121~0,] left hand side expression in assignment: lhs: VariableLHS[~r131~0,] left hand side expression in assignment: lhs: VariableLHS[~r211~0,] left hand side expression in assignment: lhs: VariableLHS[~r231~0,] left hand side expression in assignment: lhs: VariableLHS[~r311~0,] left hand side expression in assignment: lhs: VariableLHS[~r321~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[~r122~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~r132~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~r212~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~r232~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r312~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~r322~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~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[~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[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:56:09,214 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_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c[14521,14534] [2021-01-06 19:56:09,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:56:09,235 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:56:09,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:09 WrapperNode [2021-01-06 19:56:09,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:56:09,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:56:09,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:56:09,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:56:09,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:09" (1/1) ... [2021-01-06 19:56:09,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:09" (1/1) ... [2021-01-06 19:56:09,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:56:09,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:56:09,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:56:09,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:56:09,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:09" (1/1) ... [2021-01-06 19:56:09,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:09" (1/1) ... [2021-01-06 19:56:09,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:09" (1/1) ... [2021-01-06 19:56:09,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:09" (1/1) ... [2021-01-06 19:56:09,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:09" (1/1) ... [2021-01-06 19:56:09,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:09" (1/1) ... [2021-01-06 19:56:09,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:09" (1/1) ... [2021-01-06 19:56:09,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:56:09,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:56:09,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:56:09,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:56:09,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:09" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:56:09,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:56:09,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:56:09,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:56:09,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:56:10,507 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:56:10,508 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-01-06 19:56:10,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:56:10 BoogieIcfgContainer [2021-01-06 19:56:10,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:56:10,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:56:10,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:56:10,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:56:10,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:56:08" (1/3) ... [2021-01-06 19:56:10,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d6526d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:56:10, skipping insertion in model container [2021-01-06 19:56:10,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:09" (2/3) ... [2021-01-06 19:56:10,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d6526d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:56:10, skipping insertion in model container [2021-01-06 19:56:10,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:56:10" (3/3) ... [2021-01-06 19:56:10,519 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2021-01-06 19:56:10,525 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:56:10,531 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:56:10,550 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:56:10,578 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:56:10,578 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:56:10,578 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:56:10,579 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:56:10,579 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:56:10,579 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:56:10,579 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:56:10,579 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:56:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2021-01-06 19:56:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:56:10,607 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:10,608 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:10,609 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:10,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:10,615 INFO L82 PathProgramCache]: Analyzing trace with hash -812713456, now seen corresponding path program 1 times [2021-01-06 19:56:10,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:10,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105565579] [2021-01-06 19:56:10,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:10,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105565579] [2021-01-06 19:56:10,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:10,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:56:10,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510061037] [2021-01-06 19:56:10,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:56:10,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:10,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:56:10,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:56:10,949 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 2 states. [2021-01-06 19:56:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:10,984 INFO L93 Difference]: Finished difference Result 233 states and 401 transitions. [2021-01-06 19:56:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:56:10,986 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2021-01-06 19:56:10,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:10,999 INFO L225 Difference]: With dead ends: 233 [2021-01-06 19:56:10,999 INFO L226 Difference]: Without dead ends: 144 [2021-01-06 19:56:11,003 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 [2021-01-06 19:56:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-01-06 19:56:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-01-06 19:56:11,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2021-01-06 19:56:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 249 transitions. [2021-01-06 19:56:11,054 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 249 transitions. Word has length 37 [2021-01-06 19:56:11,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:11,054 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 249 transitions. [2021-01-06 19:56:11,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:56:11,055 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 249 transitions. [2021-01-06 19:56:11,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:56:11,057 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:11,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:11,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:56:11,058 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:11,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:11,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1630361906, now seen corresponding path program 1 times [2021-01-06 19:56:11,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:11,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358474534] [2021-01-06 19:56:11,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:11,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358474534] [2021-01-06 19:56:11,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:11,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:56:11,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768642885] [2021-01-06 19:56:11,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:56:11,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:11,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:56:11,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:56:11,222 INFO L87 Difference]: Start difference. First operand 144 states and 249 transitions. Second operand 5 states. [2021-01-06 19:56:11,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:11,394 INFO L93 Difference]: Finished difference Result 232 states and 394 transitions. [2021-01-06 19:56:11,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:56:11,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2021-01-06 19:56:11,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:11,397 INFO L225 Difference]: With dead ends: 232 [2021-01-06 19:56:11,397 INFO L226 Difference]: Without dead ends: 144 [2021-01-06 19:56:11,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:56:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-01-06 19:56:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-01-06 19:56:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2021-01-06 19:56:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 219 transitions. [2021-01-06 19:56:11,413 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 219 transitions. Word has length 37 [2021-01-06 19:56:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:11,413 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 219 transitions. [2021-01-06 19:56:11,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:56:11,414 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 219 transitions. [2021-01-06 19:56:11,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 19:56:11,416 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:11,417 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:11,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:56:11,417 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:11,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:11,418 INFO L82 PathProgramCache]: Analyzing trace with hash 190573204, now seen corresponding path program 1 times [2021-01-06 19:56:11,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:11,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447047822] [2021-01-06 19:56:11,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:11,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447047822] [2021-01-06 19:56:11,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:11,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:11,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467723195] [2021-01-06 19:56:11,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:11,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:11,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:11,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:11,618 INFO L87 Difference]: Start difference. First operand 144 states and 219 transitions. Second operand 3 states. [2021-01-06 19:56:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:11,696 INFO L93 Difference]: Finished difference Result 302 states and 483 transitions. [2021-01-06 19:56:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:11,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2021-01-06 19:56:11,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:11,702 INFO L225 Difference]: With dead ends: 302 [2021-01-06 19:56:11,702 INFO L226 Difference]: Without dead ends: 218 [2021-01-06 19:56:11,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:11,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-01-06 19:56:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 215. [2021-01-06 19:56:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2021-01-06 19:56:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 334 transitions. [2021-01-06 19:56:11,752 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 334 transitions. Word has length 66 [2021-01-06 19:56:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:11,753 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 334 transitions. [2021-01-06 19:56:11,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 334 transitions. [2021-01-06 19:56:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 19:56:11,761 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:11,761 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:11,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:56:11,761 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:11,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:11,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1527919177, now seen corresponding path program 1 times [2021-01-06 19:56:11,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:11,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34805385] [2021-01-06 19:56:11,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:11,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34805385] [2021-01-06 19:56:11,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:11,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:11,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975547816] [2021-01-06 19:56:11,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:11,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:11,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:11,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:11,922 INFO L87 Difference]: Start difference. First operand 215 states and 334 transitions. Second operand 3 states. [2021-01-06 19:56:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:11,958 INFO L93 Difference]: Finished difference Result 509 states and 818 transitions. [2021-01-06 19:56:11,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:11,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2021-01-06 19:56:11,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:11,961 INFO L225 Difference]: With dead ends: 509 [2021-01-06 19:56:11,961 INFO L226 Difference]: Without dead ends: 354 [2021-01-06 19:56:11,962 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:11,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-01-06 19:56:11,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 350. [2021-01-06 19:56:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2021-01-06 19:56:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 555 transitions. [2021-01-06 19:56:11,982 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 555 transitions. Word has length 68 [2021-01-06 19:56:11,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:11,982 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 555 transitions. [2021-01-06 19:56:11,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:11,983 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 555 transitions. [2021-01-06 19:56:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 19:56:11,984 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:11,984 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:11,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:56:11,985 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:11,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:11,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1063335298, now seen corresponding path program 1 times [2021-01-06 19:56:11,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:11,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056751935] [2021-01-06 19:56:11,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:12,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056751935] [2021-01-06 19:56:12,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:12,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:12,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413986792] [2021-01-06 19:56:12,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:12,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:12,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:12,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:12,082 INFO L87 Difference]: Start difference. First operand 350 states and 555 transitions. Second operand 3 states. [2021-01-06 19:56:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:12,123 INFO L93 Difference]: Finished difference Result 898 states and 1453 transitions. [2021-01-06 19:56:12,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:12,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-06 19:56:12,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:12,128 INFO L225 Difference]: With dead ends: 898 [2021-01-06 19:56:12,128 INFO L226 Difference]: Without dead ends: 608 [2021-01-06 19:56:12,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:12,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-01-06 19:56:12,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 602. [2021-01-06 19:56:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2021-01-06 19:56:12,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 963 transitions. [2021-01-06 19:56:12,154 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 963 transitions. Word has length 70 [2021-01-06 19:56:12,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:12,155 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 963 transitions. [2021-01-06 19:56:12,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:12,155 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 963 transitions. [2021-01-06 19:56:12,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:56:12,157 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:12,157 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:12,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:56:12,157 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:12,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:12,158 INFO L82 PathProgramCache]: Analyzing trace with hash 845837107, now seen corresponding path program 1 times [2021-01-06 19:56:12,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:12,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914172132] [2021-01-06 19:56:12,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:12,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914172132] [2021-01-06 19:56:12,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:12,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:56:12,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835451328] [2021-01-06 19:56:12,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:56:12,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:12,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:56:12,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:56:12,345 INFO L87 Difference]: Start difference. First operand 602 states and 963 transitions. Second operand 5 states. [2021-01-06 19:56:12,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:12,533 INFO L93 Difference]: Finished difference Result 2296 states and 3768 transitions. [2021-01-06 19:56:12,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:56:12,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2021-01-06 19:56:12,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:12,545 INFO L225 Difference]: With dead ends: 2296 [2021-01-06 19:56:12,546 INFO L226 Difference]: Without dead ends: 1754 [2021-01-06 19:56:12,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:56:12,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2021-01-06 19:56:12,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1077. [2021-01-06 19:56:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1077 states. [2021-01-06 19:56:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1739 transitions. [2021-01-06 19:56:12,603 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1739 transitions. Word has length 72 [2021-01-06 19:56:12,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:12,603 INFO L481 AbstractCegarLoop]: Abstraction has 1077 states and 1739 transitions. [2021-01-06 19:56:12,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:56:12,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1739 transitions. [2021-01-06 19:56:12,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 19:56:12,605 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:12,605 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:12,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:56:12,606 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:12,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:12,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1471686026, now seen corresponding path program 1 times [2021-01-06 19:56:12,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:12,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627877857] [2021-01-06 19:56:12,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:12,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:12,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627877857] [2021-01-06 19:56:12,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:12,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:56:12,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7613774] [2021-01-06 19:56:12,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:56:12,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:12,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:56:12,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:56:12,685 INFO L87 Difference]: Start difference. First operand 1077 states and 1739 transitions. Second operand 4 states. [2021-01-06 19:56:12,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:12,809 INFO L93 Difference]: Finished difference Result 3138 states and 5142 transitions. [2021-01-06 19:56:12,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:56:12,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-01-06 19:56:12,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:12,822 INFO L225 Difference]: With dead ends: 3138 [2021-01-06 19:56:12,822 INFO L226 Difference]: Without dead ends: 2121 [2021-01-06 19:56:12,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:56:12,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2021-01-06 19:56:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 1590. [2021-01-06 19:56:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2021-01-06 19:56:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2581 transitions. [2021-01-06 19:56:12,926 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 2581 transitions. Word has length 73 [2021-01-06 19:56:12,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:12,926 INFO L481 AbstractCegarLoop]: Abstraction has 1590 states and 2581 transitions. [2021-01-06 19:56:12,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:56:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2581 transitions. [2021-01-06 19:56:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 19:56:12,928 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:12,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:12,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:56:12,929 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:12,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:12,930 INFO L82 PathProgramCache]: Analyzing trace with hash -131454774, now seen corresponding path program 1 times [2021-01-06 19:56:12,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:12,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638119801] [2021-01-06 19:56:12,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:13,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638119801] [2021-01-06 19:56:13,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:13,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:56:13,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832813907] [2021-01-06 19:56:13,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:56:13,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:13,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:56:13,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:56:13,003 INFO L87 Difference]: Start difference. First operand 1590 states and 2581 transitions. Second operand 4 states. [2021-01-06 19:56:13,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:13,160 INFO L93 Difference]: Finished difference Result 4612 states and 7546 transitions. [2021-01-06 19:56:13,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:56:13,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 19:56:13,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:13,178 INFO L225 Difference]: With dead ends: 4612 [2021-01-06 19:56:13,178 INFO L226 Difference]: Without dead ends: 3082 [2021-01-06 19:56:13,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:56:13,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2021-01-06 19:56:13,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 2324. [2021-01-06 19:56:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2324 states. [2021-01-06 19:56:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3771 transitions. [2021-01-06 19:56:13,288 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3771 transitions. Word has length 74 [2021-01-06 19:56:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:13,289 INFO L481 AbstractCegarLoop]: Abstraction has 2324 states and 3771 transitions. [2021-01-06 19:56:13,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:56:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3771 transitions. [2021-01-06 19:56:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 19:56:13,291 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:13,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:13,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:56:13,292 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:13,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:13,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1364954579, now seen corresponding path program 1 times [2021-01-06 19:56:13,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:13,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983979125] [2021-01-06 19:56:13,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:13,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:13,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983979125] [2021-01-06 19:56:13,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:13,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:56:13,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057710245] [2021-01-06 19:56:13,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:56:13,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:13,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:56:13,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:56:13,387 INFO L87 Difference]: Start difference. First operand 2324 states and 3771 transitions. Second operand 4 states. [2021-01-06 19:56:13,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:13,581 INFO L93 Difference]: Finished difference Result 6704 states and 10946 transitions. [2021-01-06 19:56:13,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:56:13,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 19:56:13,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:13,605 INFO L225 Difference]: With dead ends: 6704 [2021-01-06 19:56:13,605 INFO L226 Difference]: Without dead ends: 4440 [2021-01-06 19:56:13,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:56:13,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4440 states. [2021-01-06 19:56:13,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4440 to 3366. [2021-01-06 19:56:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3366 states. [2021-01-06 19:56:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 3366 states and 5455 transitions. [2021-01-06 19:56:13,768 INFO L78 Accepts]: Start accepts. Automaton has 3366 states and 5455 transitions. Word has length 75 [2021-01-06 19:56:13,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:13,769 INFO L481 AbstractCegarLoop]: Abstraction has 3366 states and 5455 transitions. [2021-01-06 19:56:13,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:56:13,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3366 states and 5455 transitions. [2021-01-06 19:56:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:56:13,771 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:13,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:13,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:56:13,771 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:13,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:13,772 INFO L82 PathProgramCache]: Analyzing trace with hash 915332421, now seen corresponding path program 1 times [2021-01-06 19:56:13,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:13,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245126664] [2021-01-06 19:56:13,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:13,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245126664] [2021-01-06 19:56:13,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:13,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:13,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416834743] [2021-01-06 19:56:13,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:13,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:13,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:13,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:13,828 INFO L87 Difference]: Start difference. First operand 3366 states and 5455 transitions. Second operand 3 states. [2021-01-06 19:56:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:14,034 INFO L93 Difference]: Finished difference Result 7652 states and 12412 transitions. [2021-01-06 19:56:14,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:14,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2021-01-06 19:56:14,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:14,067 INFO L225 Difference]: With dead ends: 7652 [2021-01-06 19:56:14,067 INFO L226 Difference]: Without dead ends: 5262 [2021-01-06 19:56:14,074 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:14,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5262 states. [2021-01-06 19:56:14,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5262 to 5260. [2021-01-06 19:56:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5260 states. [2021-01-06 19:56:14,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 8462 transitions. [2021-01-06 19:56:14,338 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 8462 transitions. Word has length 76 [2021-01-06 19:56:14,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:14,338 INFO L481 AbstractCegarLoop]: Abstraction has 5260 states and 8462 transitions. [2021-01-06 19:56:14,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 8462 transitions. [2021-01-06 19:56:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:56:14,340 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:14,340 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:14,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:56:14,341 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:14,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:14,341 INFO L82 PathProgramCache]: Analyzing trace with hash -318395451, now seen corresponding path program 1 times [2021-01-06 19:56:14,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:14,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458313448] [2021-01-06 19:56:14,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:14,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458313448] [2021-01-06 19:56:14,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:14,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:14,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043945989] [2021-01-06 19:56:14,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:14,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:14,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:14,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:14,409 INFO L87 Difference]: Start difference. First operand 5260 states and 8462 transitions. Second operand 3 states. [2021-01-06 19:56:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:14,658 INFO L93 Difference]: Finished difference Result 11472 states and 18516 transitions. [2021-01-06 19:56:14,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:14,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2021-01-06 19:56:14,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:14,712 INFO L225 Difference]: With dead ends: 11472 [2021-01-06 19:56:14,712 INFO L226 Difference]: Without dead ends: 7772 [2021-01-06 19:56:14,719 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:14,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7772 states. [2021-01-06 19:56:15,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7772 to 7770. [2021-01-06 19:56:15,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7770 states. [2021-01-06 19:56:15,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7770 states to 7770 states and 12446 transitions. [2021-01-06 19:56:15,113 INFO L78 Accepts]: Start accepts. Automaton has 7770 states and 12446 transitions. Word has length 76 [2021-01-06 19:56:15,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:15,113 INFO L481 AbstractCegarLoop]: Abstraction has 7770 states and 12446 transitions. [2021-01-06 19:56:15,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 7770 states and 12446 transitions. [2021-01-06 19:56:15,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:56:15,115 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:15,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:15,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:56:15,115 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:15,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:15,116 INFO L82 PathProgramCache]: Analyzing trace with hash 700947013, now seen corresponding path program 1 times [2021-01-06 19:56:15,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:15,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910717085] [2021-01-06 19:56:15,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:15,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910717085] [2021-01-06 19:56:15,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:15,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:15,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143570064] [2021-01-06 19:56:15,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:15,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:15,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:15,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:15,193 INFO L87 Difference]: Start difference. First operand 7770 states and 12446 transitions. Second operand 3 states. [2021-01-06 19:56:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:15,604 INFO L93 Difference]: Finished difference Result 17197 states and 27794 transitions. [2021-01-06 19:56:15,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:15,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2021-01-06 19:56:15,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:15,631 INFO L225 Difference]: With dead ends: 17197 [2021-01-06 19:56:15,631 INFO L226 Difference]: Without dead ends: 11540 [2021-01-06 19:56:15,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:15,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11540 states. [2021-01-06 19:56:16,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11540 to 11538. [2021-01-06 19:56:16,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11538 states. [2021-01-06 19:56:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11538 states to 11538 states and 18443 transitions. [2021-01-06 19:56:16,219 INFO L78 Accepts]: Start accepts. Automaton has 11538 states and 18443 transitions. Word has length 76 [2021-01-06 19:56:16,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:16,220 INFO L481 AbstractCegarLoop]: Abstraction has 11538 states and 18443 transitions. [2021-01-06 19:56:16,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 11538 states and 18443 transitions. [2021-01-06 19:56:16,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 19:56:16,221 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:16,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:16,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:56:16,223 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:16,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:16,223 INFO L82 PathProgramCache]: Analyzing trace with hash 411123109, now seen corresponding path program 1 times [2021-01-06 19:56:16,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:16,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082808558] [2021-01-06 19:56:16,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:16,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082808558] [2021-01-06 19:56:16,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:16,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:56:16,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229481502] [2021-01-06 19:56:16,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:56:16,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:16,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:56:16,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:56:16,419 INFO L87 Difference]: Start difference. First operand 11538 states and 18443 transitions. Second operand 4 states. [2021-01-06 19:56:17,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:17,348 INFO L93 Difference]: Finished difference Result 34109 states and 54457 transitions. [2021-01-06 19:56:17,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:56:17,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2021-01-06 19:56:17,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:17,403 INFO L225 Difference]: With dead ends: 34109 [2021-01-06 19:56:17,403 INFO L226 Difference]: Without dead ends: 22580 [2021-01-06 19:56:17,425 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:56:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22580 states. [2021-01-06 19:56:18,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22580 to 22578. [2021-01-06 19:56:18,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22578 states. [2021-01-06 19:56:18,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22578 states to 22578 states and 35802 transitions. [2021-01-06 19:56:18,654 INFO L78 Accepts]: Start accepts. Automaton has 22578 states and 35802 transitions. Word has length 77 [2021-01-06 19:56:18,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:18,655 INFO L481 AbstractCegarLoop]: Abstraction has 22578 states and 35802 transitions. [2021-01-06 19:56:18,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:56:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 22578 states and 35802 transitions. [2021-01-06 19:56:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:56:18,656 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:18,656 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:18,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:56:18,657 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:18,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:18,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1502774817, now seen corresponding path program 1 times [2021-01-06 19:56:18,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:18,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046280397] [2021-01-06 19:56:18,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:18,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046280397] [2021-01-06 19:56:18,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:18,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:18,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311234900] [2021-01-06 19:56:18,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:18,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:18,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:18,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:18,716 INFO L87 Difference]: Start difference. First operand 22578 states and 35802 transitions. Second operand 3 states. [2021-01-06 19:56:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:19,946 INFO L93 Difference]: Finished difference Result 54911 states and 87576 transitions. [2021-01-06 19:56:19,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:19,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2021-01-06 19:56:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:20,031 INFO L225 Difference]: With dead ends: 54911 [2021-01-06 19:56:20,032 INFO L226 Difference]: Without dead ends: 32462 [2021-01-06 19:56:20,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:20,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32462 states. [2021-01-06 19:56:21,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32462 to 31186. [2021-01-06 19:56:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31186 states. [2021-01-06 19:56:21,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31186 states to 31186 states and 49355 transitions. [2021-01-06 19:56:21,369 INFO L78 Accepts]: Start accepts. Automaton has 31186 states and 49355 transitions. Word has length 78 [2021-01-06 19:56:21,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:21,370 INFO L481 AbstractCegarLoop]: Abstraction has 31186 states and 49355 transitions. [2021-01-06 19:56:21,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:21,370 INFO L276 IsEmpty]: Start isEmpty. Operand 31186 states and 49355 transitions. [2021-01-06 19:56:21,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:56:21,371 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:21,371 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:21,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:56:21,372 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:21,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:21,373 INFO L82 PathProgramCache]: Analyzing trace with hash -225322511, now seen corresponding path program 1 times [2021-01-06 19:56:21,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:21,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401379902] [2021-01-06 19:56:21,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:21,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401379902] [2021-01-06 19:56:21,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:21,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:21,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124593823] [2021-01-06 19:56:21,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:21,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:21,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:21,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:21,411 INFO L87 Difference]: Start difference. First operand 31186 states and 49355 transitions. Second operand 3 states. [2021-01-06 19:56:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:23,387 INFO L93 Difference]: Finished difference Result 93520 states and 148003 transitions. [2021-01-06 19:56:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:23,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2021-01-06 19:56:23,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:23,667 INFO L225 Difference]: With dead ends: 93520 [2021-01-06 19:56:23,667 INFO L226 Difference]: Without dead ends: 62362 [2021-01-06 19:56:23,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:23,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62362 states. [2021-01-06 19:56:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62362 to 31188. [2021-01-06 19:56:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31188 states. [2021-01-06 19:56:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31188 states to 31188 states and 49357 transitions. [2021-01-06 19:56:25,454 INFO L78 Accepts]: Start accepts. Automaton has 31188 states and 49357 transitions. Word has length 78 [2021-01-06 19:56:25,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:25,455 INFO L481 AbstractCegarLoop]: Abstraction has 31188 states and 49357 transitions. [2021-01-06 19:56:25,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:25,455 INFO L276 IsEmpty]: Start isEmpty. Operand 31188 states and 49357 transitions. [2021-01-06 19:56:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 19:56:25,456 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:25,456 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:25,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:56:25,457 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:25,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:25,458 INFO L82 PathProgramCache]: Analyzing trace with hash -577611119, now seen corresponding path program 1 times [2021-01-06 19:56:25,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:25,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229136959] [2021-01-06 19:56:25,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:25,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229136959] [2021-01-06 19:56:25,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:25,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:56:25,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769354387] [2021-01-06 19:56:25,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:56:25,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:25,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:56:25,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:56:25,610 INFO L87 Difference]: Start difference. First operand 31188 states and 49357 transitions. Second operand 4 states. [2021-01-06 19:56:27,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:27,766 INFO L93 Difference]: Finished difference Result 92206 states and 145749 transitions. [2021-01-06 19:56:27,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:56:27,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2021-01-06 19:56:27,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:27,878 INFO L225 Difference]: With dead ends: 92206 [2021-01-06 19:56:27,878 INFO L226 Difference]: Without dead ends: 61048 [2021-01-06 19:56:27,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:56:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61048 states. [2021-01-06 19:56:30,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61048 to 61046. [2021-01-06 19:56:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61046 states. [2021-01-06 19:56:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61046 states to 61046 states and 95880 transitions. [2021-01-06 19:56:30,390 INFO L78 Accepts]: Start accepts. Automaton has 61046 states and 95880 transitions. Word has length 79 [2021-01-06 19:56:30,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:30,390 INFO L481 AbstractCegarLoop]: Abstraction has 61046 states and 95880 transitions. [2021-01-06 19:56:30,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:56:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 61046 states and 95880 transitions. [2021-01-06 19:56:30,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:56:30,392 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:30,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:30,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:56:30,392 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:30,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:30,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1003564987, now seen corresponding path program 1 times [2021-01-06 19:56:30,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:30,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533500898] [2021-01-06 19:56:30,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:30,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:30,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533500898] [2021-01-06 19:56:30,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:30,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:30,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872341545] [2021-01-06 19:56:30,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:30,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:30,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:30,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:30,443 INFO L87 Difference]: Start difference. First operand 61046 states and 95880 transitions. Second operand 3 states. [2021-01-06 19:56:32,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:32,872 INFO L93 Difference]: Finished difference Result 148150 states and 233536 transitions. [2021-01-06 19:56:32,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:32,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2021-01-06 19:56:32,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:33,066 INFO L225 Difference]: With dead ends: 148150 [2021-01-06 19:56:33,067 INFO L226 Difference]: Without dead ends: 87384 [2021-01-06 19:56:33,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:33,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87384 states. [2021-01-06 19:56:36,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87384 to 84054. [2021-01-06 19:56:36,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84054 states. [2021-01-06 19:56:36,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84054 states to 84054 states and 131502 transitions. [2021-01-06 19:56:36,307 INFO L78 Accepts]: Start accepts. Automaton has 84054 states and 131502 transitions. Word has length 80 [2021-01-06 19:56:36,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:36,307 INFO L481 AbstractCegarLoop]: Abstraction has 84054 states and 131502 transitions. [2021-01-06 19:56:36,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:36,308 INFO L276 IsEmpty]: Start isEmpty. Operand 84054 states and 131502 transitions. [2021-01-06 19:56:36,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:56:36,309 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:36,309 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:36,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:56:36,309 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:36,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:36,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1064997795, now seen corresponding path program 1 times [2021-01-06 19:56:36,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:36,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389175026] [2021-01-06 19:56:36,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:36,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389175026] [2021-01-06 19:56:36,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:36,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:36,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455030841] [2021-01-06 19:56:36,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:36,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:36,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:36,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:36,344 INFO L87 Difference]: Start difference. First operand 84054 states and 131502 transitions. Second operand 3 states. [2021-01-06 19:56:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:41,030 INFO L93 Difference]: Finished difference Result 252086 states and 394386 transitions. [2021-01-06 19:56:41,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:41,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2021-01-06 19:56:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:41,343 INFO L225 Difference]: With dead ends: 252086 [2021-01-06 19:56:41,344 INFO L226 Difference]: Without dead ends: 168076 [2021-01-06 19:56:41,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:41,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168076 states. [2021-01-06 19:56:45,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168076 to 84058. [2021-01-06 19:56:45,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84058 states. [2021-01-06 19:56:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84058 states to 84058 states and 131506 transitions. [2021-01-06 19:56:45,504 INFO L78 Accepts]: Start accepts. Automaton has 84058 states and 131506 transitions. Word has length 80 [2021-01-06 19:56:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:45,504 INFO L481 AbstractCegarLoop]: Abstraction has 84058 states and 131506 transitions. [2021-01-06 19:56:45,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 84058 states and 131506 transitions. [2021-01-06 19:56:45,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 19:56:45,506 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:45,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:45,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:56:45,507 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:45,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:45,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1530707325, now seen corresponding path program 1 times [2021-01-06 19:56:45,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:45,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879288177] [2021-01-06 19:56:45,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:45,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879288177] [2021-01-06 19:56:45,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:45,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:56:45,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518935491] [2021-01-06 19:56:45,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:56:45,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:45,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:56:45,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:56:45,625 INFO L87 Difference]: Start difference. First operand 84058 states and 131506 transitions. Second operand 4 states. [2021-01-06 19:56:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:51,164 INFO L93 Difference]: Finished difference Result 248426 states and 388114 transitions. [2021-01-06 19:56:51,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:56:51,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2021-01-06 19:56:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:51,461 INFO L225 Difference]: With dead ends: 248426 [2021-01-06 19:56:51,462 INFO L226 Difference]: Without dead ends: 164416 [2021-01-06 19:56:51,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:56:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164416 states. [2021-01-06 19:56:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164416 to 164414. [2021-01-06 19:56:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164414 states. [2021-01-06 19:56:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164414 states to 164414 states and 255112 transitions. [2021-01-06 19:56:58,260 INFO L78 Accepts]: Start accepts. Automaton has 164414 states and 255112 transitions. Word has length 81 [2021-01-06 19:56:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:58,260 INFO L481 AbstractCegarLoop]: Abstraction has 164414 states and 255112 transitions. [2021-01-06 19:56:58,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:56:58,261 INFO L276 IsEmpty]: Start isEmpty. Operand 164414 states and 255112 transitions. [2021-01-06 19:56:58,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 19:56:58,266 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:58,267 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:58,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:56:58,267 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:58,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1063976855, now seen corresponding path program 1 times [2021-01-06 19:56:58,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:58,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903752708] [2021-01-06 19:56:58,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:58,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903752708] [2021-01-06 19:56:58,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:58,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:58,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227693648] [2021-01-06 19:56:58,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:58,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:58,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:58,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:58,333 INFO L87 Difference]: Start difference. First operand 164414 states and 255112 transitions. Second operand 3 states. [2021-01-06 19:57:06,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:06,136 INFO L93 Difference]: Finished difference Result 399850 states and 623434 transitions. [2021-01-06 19:57:06,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:57:06,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2021-01-06 19:57:06,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:06,592 INFO L225 Difference]: With dead ends: 399850 [2021-01-06 19:57:06,593 INFO L226 Difference]: Without dead ends: 236000 [2021-01-06 19:57:07,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:57:07,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236000 states. [2021-01-06 19:57:15,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236000 to 225918. [2021-01-06 19:57:15,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225918 states. [2021-01-06 19:57:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225918 states to 225918 states and 348560 transitions. [2021-01-06 19:57:16,414 INFO L78 Accepts]: Start accepts. Automaton has 225918 states and 348560 transitions. Word has length 82 [2021-01-06 19:57:16,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:16,414 INFO L481 AbstractCegarLoop]: Abstraction has 225918 states and 348560 transitions. [2021-01-06 19:57:16,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:57:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 225918 states and 348560 transitions. [2021-01-06 19:57:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 19:57:16,416 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:16,417 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:57:16,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:57:16,417 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:16,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:16,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1085594423, now seen corresponding path program 1 times [2021-01-06 19:57:16,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:16,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969851808] [2021-01-06 19:57:16,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:57:16,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969851808] [2021-01-06 19:57:16,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:16,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:57:16,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233348520] [2021-01-06 19:57:16,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:57:16,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:16,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:57:16,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:57:16,458 INFO L87 Difference]: Start difference. First operand 225918 states and 348560 transitions. Second operand 3 states. [2021-01-06 19:57:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:31,259 INFO L93 Difference]: Finished difference Result 677330 states and 1045134 transitions. [2021-01-06 19:57:31,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:57:31,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2021-01-06 19:57:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:32,221 INFO L225 Difference]: With dead ends: 677330 [2021-01-06 19:57:32,221 INFO L226 Difference]: Without dead ends: 451744 [2021-01-06 19:57:32,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:57:33,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451744 states. [2021-01-06 19:57:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451744 to 225926. [2021-01-06 19:57:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225926 states. [2021-01-06 19:57:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225926 states to 225926 states and 348568 transitions. [2021-01-06 19:57:44,720 INFO L78 Accepts]: Start accepts. Automaton has 225926 states and 348568 transitions. Word has length 82 [2021-01-06 19:57:44,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:44,721 INFO L481 AbstractCegarLoop]: Abstraction has 225926 states and 348568 transitions. [2021-01-06 19:57:44,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:57:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 225926 states and 348568 transitions. [2021-01-06 19:57:44,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-06 19:57:44,723 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:44,723 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:57:44,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:57:44,723 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:44,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:44,724 INFO L82 PathProgramCache]: Analyzing trace with hash 762927108, now seen corresponding path program 1 times [2021-01-06 19:57:44,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:44,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464024428] [2021-01-06 19:57:44,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:57:44,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464024428] [2021-01-06 19:57:44,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:44,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:57:44,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618010750] [2021-01-06 19:57:44,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:57:44,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:44,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:57:44,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:57:44,845 INFO L87 Difference]: Start difference. First operand 225926 states and 348568 transitions. Second operand 5 states. [2021-01-06 19:58:01,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:58:01,346 INFO L93 Difference]: Finished difference Result 639120 states and 985393 transitions. [2021-01-06 19:58:01,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:58:01,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2021-01-06 19:58:01,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:58:02,460 INFO L225 Difference]: With dead ends: 639120 [2021-01-06 19:58:02,461 INFO L226 Difference]: Without dead ends: 413282 [2021-01-06 19:58:02,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:58:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413282 states. [2021-01-06 19:58:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413282 to 413280. [2021-01-06 19:58:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413280 states. [2021-01-06 19:58:21,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413280 states to 413280 states and 631969 transitions. [2021-01-06 19:58:21,942 INFO L78 Accepts]: Start accepts. Automaton has 413280 states and 631969 transitions. Word has length 83 [2021-01-06 19:58:21,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:58:21,944 INFO L481 AbstractCegarLoop]: Abstraction has 413280 states and 631969 transitions. [2021-01-06 19:58:21,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:58:21,945 INFO L276 IsEmpty]: Start isEmpty. Operand 413280 states and 631969 transitions. [2021-01-06 19:58:21,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-06 19:58:21,948 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:58:21,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:58:21,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:58:21,949 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:58:21,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:58:21,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1633117801, now seen corresponding path program 1 times [2021-01-06 19:58:21,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:58:21,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360548712] [2021-01-06 19:58:21,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:58:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:58:22,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:58:22,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360548712] [2021-01-06 19:58:22,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:58:22,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:58:22,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387885927] [2021-01-06 19:58:22,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:58:22,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:58:22,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:58:22,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:58:22,083 INFO L87 Difference]: Start difference. First operand 413280 states and 631969 transitions. Second operand 4 states. [2021-01-06 19:58:36,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:58:36,418 INFO L93 Difference]: Finished difference Result 734762 states and 1121587 transitions. [2021-01-06 19:58:36,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:58:36,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2021-01-06 19:58:36,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:58:37,056 INFO L225 Difference]: With dead ends: 734762 [2021-01-06 19:58:37,057 INFO L226 Difference]: Without dead ends: 321556 [2021-01-06 19:58:37,345 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:58:37,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321556 states. [2021-01-06 19:58:51,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321556 to 321556. [2021-01-06 19:58:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321556 states. [2021-01-06 19:58:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321556 states to 321556 states and 489721 transitions. [2021-01-06 19:58:52,170 INFO L78 Accepts]: Start accepts. Automaton has 321556 states and 489721 transitions. Word has length 83 [2021-01-06 19:58:52,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:58:52,171 INFO L481 AbstractCegarLoop]: Abstraction has 321556 states and 489721 transitions. [2021-01-06 19:58:52,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:58:52,171 INFO L276 IsEmpty]: Start isEmpty. Operand 321556 states and 489721 transitions. [2021-01-06 19:58:52,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 19:58:52,173 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:58:52,174 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:58:52,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:58:52,174 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:58:52,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:58:52,175 INFO L82 PathProgramCache]: Analyzing trace with hash 960344718, now seen corresponding path program 1 times [2021-01-06 19:58:52,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:58:52,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70647319] [2021-01-06 19:58:52,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:58:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:58:52,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:58:52,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70647319] [2021-01-06 19:58:52,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:58:52,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:58:52,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140126117] [2021-01-06 19:58:52,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:58:52,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:58:52,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:58:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:58:52,299 INFO L87 Difference]: Start difference. First operand 321556 states and 489721 transitions. Second operand 4 states. [2021-01-06 19:59:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:59:16,222 INFO L93 Difference]: Finished difference Result 845180 states and 1286070 transitions. [2021-01-06 19:59:16,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:59:16,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2021-01-06 19:59:16,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:59:17,562 INFO L225 Difference]: With dead ends: 845180 [2021-01-06 19:59:17,562 INFO L226 Difference]: Without dead ends: 523756 [2021-01-06 19:59:17,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:59:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523756 states. [2021-01-06 19:59:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523756 to 523754. [2021-01-06 19:59:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523754 states.