/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 21:19:42,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 21:19:42,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 21:19:43,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 21:19:43,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 21:19:43,024 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 21:19:43,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 21:19:43,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 21:19:43,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 21:19:43,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 21:19:43,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 21:19:43,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 21:19:43,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 21:19:43,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 21:19:43,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 21:19:43,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 21:19:43,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 21:19:43,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 21:19:43,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 21:19:43,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 21:19:43,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 21:19:43,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 21:19:43,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 21:19:43,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 21:19:43,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 21:19:43,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 21:19:43,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 21:19:43,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 21:19:43,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 21:19:43,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 21:19:43,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 21:19:43,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 21:19:43,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 21:19:43,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 21:19:43,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 21:19:43,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 21:19:43,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 21:19:43,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 21:19:43,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 21:19:43,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 21:19:43,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 21:19:43,115 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 21:19:43,166 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 21:19:43,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 21:19:43,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 21:19:43,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 21:19:43,171 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 21:19:43,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 21:19:43,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 21:19:43,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 21:19:43,172 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 21:19:43,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 21:19:43,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 21:19:43,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 21:19:43,174 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 21:19:43,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 21:19:43,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 21:19:43,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 21:19:43,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 21:19:43,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:19:43,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 21:19:43,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 21:19:43,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 21:19:43,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 21:19:43,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 21:19:43,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 21:19:43,176 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 21:19:43,177 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 21:19:43,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 21:19:43,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 21:19:43,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 21:19:43,657 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 21:19:43,658 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 21:19:43,659 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2021-01-06 21:19:43,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/acc583e10/9a7c4fb0e9034de58b91e96c8fc31bfb/FLAG3c94549e7 [2021-01-06 21:19:44,638 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 21:19:44,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2021-01-06 21:19:44,670 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/acc583e10/9a7c4fb0e9034de58b91e96c8fc31bfb/FLAG3c94549e7 [2021-01-06 21:19:44,814 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/acc583e10/9a7c4fb0e9034de58b91e96c8fc31bfb [2021-01-06 21:19:44,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 21:19:44,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 21:19:44,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 21:19:44,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 21:19:44,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 21:19:44,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:19:44" (1/1) ... [2021-01-06 21:19:44,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f785e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:44, skipping insertion in model container [2021-01-06 21:19:44,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:19:44" (1/1) ... [2021-01-06 21:19:44,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 21:19:44,915 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~init__r121~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r131~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r211~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r231~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r311~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r321~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r122~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r132~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r212~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r232~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r312~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r322~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1897~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] 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[~node2__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] 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[~node3__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] 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[~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[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_2043~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~1,] 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[~node1__newmax~1,] 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[~node1__newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__newmax~1,] 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[~node2__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[~node2__newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__newmax~1,] 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[~node3__newmax~1,] 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[~node3__newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] 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[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_2176~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~1,] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~1,] 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[~node2__newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~1,] 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[~node3__newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~1,] 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[~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[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__return_2312~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~2,] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~3,] 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[~node1__newmax~3,] 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[~node1__newmax~3,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~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[~node2__newmax~3,] 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[~node2__newmax~3,] 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[~node2__newmax~3,] 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[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__newmax~3,] 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[~node3__newmax~3,] 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[~node3__newmax~3,] 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[~mode3~0,GLOBAL] 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[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~__return_2456~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_4~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~3,] [2021-01-06 21:19:45,320 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[15462,15475] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~4,] 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[~node1__newmax~4,] 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[~node1__newmax~4,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~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[~node2__newmax~4,] 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[~node2__newmax~4,] 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[~node2__newmax~4,] 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[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__newmax~4,] 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[~node3__newmax~4,] 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[~node3__newmax~4,] 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[~mode3~0,GLOBAL] 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[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~__return_2581~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~2,] 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[~node3____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~2,] 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[~node2____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~2,] 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[~node1____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] [2021-01-06 21:19:45,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:19:45,446 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~init__r121~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r131~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r211~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r231~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r311~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r321~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r122~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r132~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r212~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r232~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r312~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r322~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1897~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] 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[~node2__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] 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[~node3__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] 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[~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[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_2043~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~1,] 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[~node1__newmax~1,] 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[~node1__newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__newmax~1,] 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[~node2__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[~node2__newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__newmax~1,] 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[~node3__newmax~1,] 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[~node3__newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] 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[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_2176~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~1,] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~1,] 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[~node2__newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~1,] 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[~node3__newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~1,] 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[~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[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__return_2312~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~2,] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~3,] 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[~node1__newmax~3,] 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[~node1__newmax~3,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~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[~node2__newmax~3,] 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[~node2__newmax~3,] 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[~node2__newmax~3,] 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[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__newmax~3,] 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[~node3__newmax~3,] 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[~node3__newmax~3,] 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[~mode3~0,GLOBAL] 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[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~__return_2456~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_4~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~3,] [2021-01-06 21:19:45,681 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[15462,15475] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~4,] 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[~node1__newmax~4,] 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[~node1__newmax~4,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~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[~node2__newmax~4,] 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[~node2__newmax~4,] 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[~node2__newmax~4,] 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[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__newmax~4,] 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[~node3__newmax~4,] 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[~node3__newmax~4,] 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[~mode3~0,GLOBAL] 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[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~__return_2581~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~2,] 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[~node3____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~2,] 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[~node2____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~2,] 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[~node1____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] [2021-01-06 21:19:45,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:19:45,765 INFO L208 MainTranslator]: Completed translation [2021-01-06 21:19:45,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:45 WrapperNode [2021-01-06 21:19:45,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 21:19:45,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 21:19:45,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 21:19:45,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 21:19:45,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:45" (1/1) ... [2021-01-06 21:19:45,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:45" (1/1) ... [2021-01-06 21:19:45,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 21:19:45,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 21:19:45,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 21:19:45,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 21:19:45,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:45" (1/1) ... [2021-01-06 21:19:45,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:45" (1/1) ... [2021-01-06 21:19:45,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:45" (1/1) ... [2021-01-06 21:19:45,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:45" (1/1) ... [2021-01-06 21:19:45,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:45" (1/1) ... [2021-01-06 21:19:45,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:45" (1/1) ... [2021-01-06 21:19:45,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:45" (1/1) ... [2021-01-06 21:19:45,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 21:19:45,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 21:19:45,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 21:19:45,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 21:19:45,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:45" (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 21:19:46,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 21:19:46,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 21:19:46,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 21:19:46,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 21:19:47,716 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 21:19:47,717 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 21:19:47,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:19:47 BoogieIcfgContainer [2021-01-06 21:19:47,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 21:19:47,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 21:19:47,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 21:19:47,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 21:19:47,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 09:19:44" (1/3) ... [2021-01-06 21:19:47,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3157ead3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:19:47, skipping insertion in model container [2021-01-06 21:19:47,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:45" (2/3) ... [2021-01-06 21:19:47,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3157ead3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:19:47, skipping insertion in model container [2021-01-06 21:19:47,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:19:47" (3/3) ... [2021-01-06 21:19:47,733 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2021-01-06 21:19:47,741 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 21:19:47,747 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 21:19:47,766 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 21:19:47,800 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 21:19:47,800 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 21:19:47,800 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 21:19:47,800 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 21:19:47,800 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 21:19:47,801 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 21:19:47,801 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 21:19:47,801 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 21:19:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states. [2021-01-06 21:19:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-01-06 21:19:47,843 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:47,844 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:19:47,844 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:47,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:47,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1491324598, now seen corresponding path program 1 times [2021-01-06 21:19:47,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:47,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472236330] [2021-01-06 21:19:47,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:19:48,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472236330] [2021-01-06 21:19:48,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:48,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:48,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551141604] [2021-01-06 21:19:48,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:48,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:48,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:48,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:48,568 INFO L87 Difference]: Start difference. First operand 344 states. Second operand 3 states. [2021-01-06 21:19:48,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:48,747 INFO L93 Difference]: Finished difference Result 702 states and 1220 transitions. [2021-01-06 21:19:48,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:48,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2021-01-06 21:19:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:48,773 INFO L225 Difference]: With dead ends: 702 [2021-01-06 21:19:48,774 INFO L226 Difference]: Without dead ends: 565 [2021-01-06 21:19:48,779 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 21:19:48,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-01-06 21:19:48,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 563. [2021-01-06 21:19:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2021-01-06 21:19:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 842 transitions. [2021-01-06 21:19:48,907 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 842 transitions. Word has length 155 [2021-01-06 21:19:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:48,908 INFO L481 AbstractCegarLoop]: Abstraction has 563 states and 842 transitions. [2021-01-06 21:19:48,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:19:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 842 transitions. [2021-01-06 21:19:48,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-01-06 21:19:48,920 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:48,921 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:19:48,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 21:19:48,921 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:48,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:48,922 INFO L82 PathProgramCache]: Analyzing trace with hash -599043347, now seen corresponding path program 1 times [2021-01-06 21:19:48,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:48,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950061648] [2021-01-06 21:19:48,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:49,392 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 21:19:49,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950061648] [2021-01-06 21:19:49,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:49,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:19:49,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130558658] [2021-01-06 21:19:49,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:19:49,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:49,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:19:49,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:19:49,400 INFO L87 Difference]: Start difference. First operand 563 states and 842 transitions. Second operand 4 states. [2021-01-06 21:19:49,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:49,588 INFO L93 Difference]: Finished difference Result 1643 states and 2449 transitions. [2021-01-06 21:19:49,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:19:49,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2021-01-06 21:19:49,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:49,601 INFO L225 Difference]: With dead ends: 1643 [2021-01-06 21:19:49,601 INFO L226 Difference]: Without dead ends: 1089 [2021-01-06 21:19:49,610 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 21:19:49,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-01-06 21:19:49,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1087. [2021-01-06 21:19:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2021-01-06 21:19:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1608 transitions. [2021-01-06 21:19:49,704 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1608 transitions. Word has length 155 [2021-01-06 21:19:49,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:49,707 INFO L481 AbstractCegarLoop]: Abstraction has 1087 states and 1608 transitions. [2021-01-06 21:19:49,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:19:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1608 transitions. [2021-01-06 21:19:49,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-01-06 21:19:49,716 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:49,717 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:19:49,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 21:19:49,718 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:49,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:49,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1611010681, now seen corresponding path program 1 times [2021-01-06 21:19:49,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:49,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814242497] [2021-01-06 21:19:49,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:49,844 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 21:19:49,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814242497] [2021-01-06 21:19:49,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:49,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:49,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884353429] [2021-01-06 21:19:49,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:49,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:49,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:49,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:49,849 INFO L87 Difference]: Start difference. First operand 1087 states and 1608 transitions. Second operand 3 states. [2021-01-06 21:19:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:49,963 INFO L93 Difference]: Finished difference Result 3223 states and 4762 transitions. [2021-01-06 21:19:49,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:49,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2021-01-06 21:19:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:49,978 INFO L225 Difference]: With dead ends: 3223 [2021-01-06 21:19:49,979 INFO L226 Difference]: Without dead ends: 2164 [2021-01-06 21:19:49,982 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 21:19:49,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2021-01-06 21:19:50,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 1089. [2021-01-06 21:19:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2021-01-06 21:19:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1610 transitions. [2021-01-06 21:19:50,067 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1610 transitions. Word has length 156 [2021-01-06 21:19:50,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:50,075 INFO L481 AbstractCegarLoop]: Abstraction has 1089 states and 1610 transitions. [2021-01-06 21:19:50,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:19:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1610 transitions. [2021-01-06 21:19:50,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-06 21:19:50,078 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:50,079 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:19:50,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 21:19:50,079 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:50,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:50,081 INFO L82 PathProgramCache]: Analyzing trace with hash -580833396, now seen corresponding path program 1 times [2021-01-06 21:19:50,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:50,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606230920] [2021-01-06 21:19:50,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:50,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:19:50,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606230920] [2021-01-06 21:19:50,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:50,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:19:50,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049595390] [2021-01-06 21:19:50,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:19:50,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:50,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:19:50,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:19:50,359 INFO L87 Difference]: Start difference. First operand 1089 states and 1610 transitions. Second operand 4 states. [2021-01-06 21:19:50,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:50,577 INFO L93 Difference]: Finished difference Result 3149 states and 4634 transitions. [2021-01-06 21:19:50,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:19:50,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2021-01-06 21:19:50,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:50,589 INFO L225 Difference]: With dead ends: 3149 [2021-01-06 21:19:50,590 INFO L226 Difference]: Without dead ends: 2090 [2021-01-06 21:19:50,593 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 21:19:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2021-01-06 21:19:50,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2021-01-06 21:19:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2021-01-06 21:19:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3048 transitions. [2021-01-06 21:19:50,746 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3048 transitions. Word has length 157 [2021-01-06 21:19:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:50,747 INFO L481 AbstractCegarLoop]: Abstraction has 2088 states and 3048 transitions. [2021-01-06 21:19:50,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:19:50,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3048 transitions. [2021-01-06 21:19:50,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-01-06 21:19:50,752 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:50,752 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:19:50,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 21:19:50,752 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:50,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:50,753 INFO L82 PathProgramCache]: Analyzing trace with hash 268848056, now seen corresponding path program 1 times [2021-01-06 21:19:50,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:50,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483904938] [2021-01-06 21:19:50,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:50,867 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 21:19:50,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483904938] [2021-01-06 21:19:50,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:50,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:50,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048755225] [2021-01-06 21:19:50,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:50,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:50,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:50,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:50,871 INFO L87 Difference]: Start difference. First operand 2088 states and 3048 transitions. Second operand 3 states. [2021-01-06 21:19:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:51,163 INFO L93 Difference]: Finished difference Result 6188 states and 9024 transitions. [2021-01-06 21:19:51,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:51,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2021-01-06 21:19:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:51,192 INFO L225 Difference]: With dead ends: 6188 [2021-01-06 21:19:51,193 INFO L226 Difference]: Without dead ends: 4144 [2021-01-06 21:19:51,202 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 21:19:51,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4144 states. [2021-01-06 21:19:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4144 to 2092. [2021-01-06 21:19:51,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2092 states. [2021-01-06 21:19:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 3052 transitions. [2021-01-06 21:19:51,491 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 3052 transitions. Word has length 158 [2021-01-06 21:19:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:51,491 INFO L481 AbstractCegarLoop]: Abstraction has 2092 states and 3052 transitions. [2021-01-06 21:19:51,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:19:51,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 3052 transitions. [2021-01-06 21:19:51,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-01-06 21:19:51,496 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:51,497 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:19:51,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 21:19:51,497 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:51,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:51,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1767168465, now seen corresponding path program 1 times [2021-01-06 21:19:51,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:51,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379851784] [2021-01-06 21:19:51,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:19:51,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379851784] [2021-01-06 21:19:51,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:51,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:51,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021910896] [2021-01-06 21:19:51,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:51,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:51,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:51,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:51,645 INFO L87 Difference]: Start difference. First operand 2092 states and 3052 transitions. Second operand 3 states. [2021-01-06 21:19:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:51,975 INFO L93 Difference]: Finished difference Result 5411 states and 7901 transitions. [2021-01-06 21:19:51,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:51,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2021-01-06 21:19:51,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:51,993 INFO L225 Difference]: With dead ends: 5411 [2021-01-06 21:19:51,994 INFO L226 Difference]: Without dead ends: 3651 [2021-01-06 21:19:51,997 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 21:19:52,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2021-01-06 21:19:52,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 3649. [2021-01-06 21:19:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2021-01-06 21:19:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 5243 transitions. [2021-01-06 21:19:52,292 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 5243 transitions. Word has length 159 [2021-01-06 21:19:52,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:52,294 INFO L481 AbstractCegarLoop]: Abstraction has 3649 states and 5243 transitions. [2021-01-06 21:19:52,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:19:52,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 5243 transitions. [2021-01-06 21:19:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-01-06 21:19:52,302 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:52,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:19:52,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 21:19:52,303 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:52,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:52,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1188374862, now seen corresponding path program 1 times [2021-01-06 21:19:52,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:52,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419098504] [2021-01-06 21:19:52,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:52,557 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 21:19:52,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419098504] [2021-01-06 21:19:52,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:52,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:19:52,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699459888] [2021-01-06 21:19:52,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:19:52,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:52,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:19:52,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:19:52,561 INFO L87 Difference]: Start difference. First operand 3649 states and 5243 transitions. Second operand 5 states. [2021-01-06 21:19:53,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:53,223 INFO L93 Difference]: Finished difference Result 10381 states and 14906 transitions. [2021-01-06 21:19:53,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:19:53,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2021-01-06 21:19:53,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:53,259 INFO L225 Difference]: With dead ends: 10381 [2021-01-06 21:19:53,260 INFO L226 Difference]: Without dead ends: 6769 [2021-01-06 21:19:53,266 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 21:19:53,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6769 states. [2021-01-06 21:19:53,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6769 to 6767. [2021-01-06 21:19:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6767 states. [2021-01-06 21:19:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6767 states to 6767 states and 9634 transitions. [2021-01-06 21:19:53,872 INFO L78 Accepts]: Start accepts. Automaton has 6767 states and 9634 transitions. Word has length 159 [2021-01-06 21:19:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:53,873 INFO L481 AbstractCegarLoop]: Abstraction has 6767 states and 9634 transitions. [2021-01-06 21:19:53,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:19:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 6767 states and 9634 transitions. [2021-01-06 21:19:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-01-06 21:19:53,884 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:53,884 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:19:53,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 21:19:53,885 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:53,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:53,885 INFO L82 PathProgramCache]: Analyzing trace with hash 504620971, now seen corresponding path program 1 times [2021-01-06 21:19:53,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:53,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396839232] [2021-01-06 21:19:53,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:54,078 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 21:19:54,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396839232] [2021-01-06 21:19:54,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:54,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:19:54,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111321182] [2021-01-06 21:19:54,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:19:54,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:54,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:19:54,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:19:54,081 INFO L87 Difference]: Start difference. First operand 6767 states and 9634 transitions. Second operand 4 states. [2021-01-06 21:19:54,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:54,663 INFO L93 Difference]: Finished difference Result 13796 states and 19550 transitions. [2021-01-06 21:19:54,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:19:54,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2021-01-06 21:19:54,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:54,756 INFO L225 Difference]: With dead ends: 13796 [2021-01-06 21:19:54,756 INFO L226 Difference]: Without dead ends: 7146 [2021-01-06 21:19:54,768 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 21:19:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7146 states. [2021-01-06 21:19:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7146 to 6991. [2021-01-06 21:19:55,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6991 states. [2021-01-06 21:19:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6991 states to 6991 states and 9886 transitions. [2021-01-06 21:19:55,371 INFO L78 Accepts]: Start accepts. Automaton has 6991 states and 9886 transitions. Word has length 159 [2021-01-06 21:19:55,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:55,371 INFO L481 AbstractCegarLoop]: Abstraction has 6991 states and 9886 transitions. [2021-01-06 21:19:55,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:19:55,372 INFO L276 IsEmpty]: Start isEmpty. Operand 6991 states and 9886 transitions. [2021-01-06 21:19:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 21:19:55,383 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:55,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:19:55,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 21:19:55,383 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:55,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:55,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1391753097, now seen corresponding path program 1 times [2021-01-06 21:19:55,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:55,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895271275] [2021-01-06 21:19:55,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:55,483 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 21:19:55,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895271275] [2021-01-06 21:19:55,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:55,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:55,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985187318] [2021-01-06 21:19:55,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:55,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:55,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:55,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:55,486 INFO L87 Difference]: Start difference. First operand 6991 states and 9886 transitions. Second operand 3 states. [2021-01-06 21:19:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:56,409 INFO L93 Difference]: Finished difference Result 20247 states and 28724 transitions. [2021-01-06 21:19:56,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:56,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2021-01-06 21:19:56,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:56,447 INFO L225 Difference]: With dead ends: 20247 [2021-01-06 21:19:56,448 INFO L226 Difference]: Without dead ends: 13857 [2021-01-06 21:19:56,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:56,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13857 states. [2021-01-06 21:19:57,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13857 to 7007. [2021-01-06 21:19:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7007 states. [2021-01-06 21:19:57,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7007 states to 7007 states and 9902 transitions. [2021-01-06 21:19:57,172 INFO L78 Accepts]: Start accepts. Automaton has 7007 states and 9902 transitions. Word has length 160 [2021-01-06 21:19:57,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:57,172 INFO L481 AbstractCegarLoop]: Abstraction has 7007 states and 9902 transitions. [2021-01-06 21:19:57,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:19:57,173 INFO L276 IsEmpty]: Start isEmpty. Operand 7007 states and 9902 transitions. [2021-01-06 21:19:57,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-01-06 21:19:57,185 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:57,185 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:19:57,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 21:19:57,185 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:57,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:57,186 INFO L82 PathProgramCache]: Analyzing trace with hash -911721654, now seen corresponding path program 1 times [2021-01-06 21:19:57,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:57,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534230165] [2021-01-06 21:19:57,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:57,354 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 21:19:57,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534230165] [2021-01-06 21:19:57,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:57,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:19:57,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481128785] [2021-01-06 21:19:57,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:19:57,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:57,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:19:57,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:19:57,357 INFO L87 Difference]: Start difference. First operand 7007 states and 9902 transitions. Second operand 4 states. [2021-01-06 21:19:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:58,018 INFO L93 Difference]: Finished difference Result 14004 states and 19790 transitions. [2021-01-06 21:19:58,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:19:58,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2021-01-06 21:19:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:58,038 INFO L225 Difference]: With dead ends: 14004 [2021-01-06 21:19:58,038 INFO L226 Difference]: Without dead ends: 7005 [2021-01-06 21:19:58,050 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 21:19:58,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7005 states. [2021-01-06 21:19:58,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7005 to 7005. [2021-01-06 21:19:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7005 states. [2021-01-06 21:19:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7005 states to 7005 states and 9898 transitions. [2021-01-06 21:19:58,815 INFO L78 Accepts]: Start accepts. Automaton has 7005 states and 9898 transitions. Word has length 161 [2021-01-06 21:19:58,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:58,815 INFO L481 AbstractCegarLoop]: Abstraction has 7005 states and 9898 transitions. [2021-01-06 21:19:58,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:19:58,815 INFO L276 IsEmpty]: Start isEmpty. Operand 7005 states and 9898 transitions. [2021-01-06 21:19:58,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-01-06 21:19:58,828 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:58,829 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:19:58,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 21:19:58,829 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:58,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:58,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2124598414, now seen corresponding path program 1 times [2021-01-06 21:19:58,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:58,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641342016] [2021-01-06 21:19:58,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:19:58,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641342016] [2021-01-06 21:19:58,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:58,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:58,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862712319] [2021-01-06 21:19:58,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:58,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:58,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:58,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:58,948 INFO L87 Difference]: Start difference. First operand 7005 states and 9898 transitions. Second operand 3 states. [2021-01-06 21:19:59,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:59,663 INFO L93 Difference]: Finished difference Result 16189 states and 22982 transitions. [2021-01-06 21:19:59,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:59,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2021-01-06 21:19:59,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:59,689 INFO L225 Difference]: With dead ends: 16189 [2021-01-06 21:19:59,690 INFO L226 Difference]: Without dead ends: 10395 [2021-01-06 21:19:59,701 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 21:19:59,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10395 states. [2021-01-06 21:20:00,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10395 to 10393. [2021-01-06 21:20:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10393 states. [2021-01-06 21:20:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 14460 transitions. [2021-01-06 21:20:00,640 INFO L78 Accepts]: Start accepts. Automaton has 10393 states and 14460 transitions. Word has length 161 [2021-01-06 21:20:00,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:00,640 INFO L481 AbstractCegarLoop]: Abstraction has 10393 states and 14460 transitions. [2021-01-06 21:20:00,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:20:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 10393 states and 14460 transitions. [2021-01-06 21:20:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-01-06 21:20:00,661 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:00,662 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:00,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 21:20:00,662 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:00,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:00,663 INFO L82 PathProgramCache]: Analyzing trace with hash -727385235, now seen corresponding path program 1 times [2021-01-06 21:20:00,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:00,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958824829] [2021-01-06 21:20:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:00,751 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 21:20:00,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958824829] [2021-01-06 21:20:00,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:00,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:20:00,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551753276] [2021-01-06 21:20:00,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:20:00,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:00,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:20:00,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:20:00,754 INFO L87 Difference]: Start difference. First operand 10393 states and 14460 transitions. Second operand 3 states. [2021-01-06 21:20:01,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:01,778 INFO L93 Difference]: Finished difference Result 24303 states and 34628 transitions. [2021-01-06 21:20:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:20:01,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2021-01-06 21:20:01,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:01,818 INFO L225 Difference]: With dead ends: 24303 [2021-01-06 21:20:01,818 INFO L226 Difference]: Without dead ends: 15108 [2021-01-06 21:20:01,834 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 21:20:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15108 states. [2021-01-06 21:20:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15108 to 13181. [2021-01-06 21:20:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13181 states. [2021-01-06 21:20:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13181 states to 13181 states and 18914 transitions. [2021-01-06 21:20:03,130 INFO L78 Accepts]: Start accepts. Automaton has 13181 states and 18914 transitions. Word has length 163 [2021-01-06 21:20:03,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:03,131 INFO L481 AbstractCegarLoop]: Abstraction has 13181 states and 18914 transitions. [2021-01-06 21:20:03,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:20:03,131 INFO L276 IsEmpty]: Start isEmpty. Operand 13181 states and 18914 transitions. [2021-01-06 21:20:03,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-01-06 21:20:03,152 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:03,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:03,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 21:20:03,152 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:03,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:03,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1248523357, now seen corresponding path program 1 times [2021-01-06 21:20:03,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:03,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576122887] [2021-01-06 21:20:03,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:03,263 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 21:20:03,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576122887] [2021-01-06 21:20:03,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:03,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:20:03,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647926045] [2021-01-06 21:20:03,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:20:03,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:03,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:20:03,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:20:03,267 INFO L87 Difference]: Start difference. First operand 13181 states and 18914 transitions. Second operand 3 states. [2021-01-06 21:20:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:04,439 INFO L93 Difference]: Finished difference Result 29139 states and 42714 transitions. [2021-01-06 21:20:04,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:20:04,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2021-01-06 21:20:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:04,490 INFO L225 Difference]: With dead ends: 29139 [2021-01-06 21:20:04,491 INFO L226 Difference]: Without dead ends: 19243 [2021-01-06 21:20:04,510 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 21:20:04,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19243 states. [2021-01-06 21:20:05,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19243 to 17437. [2021-01-06 21:20:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17437 states. [2021-01-06 21:20:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17437 states to 17437 states and 25648 transitions. [2021-01-06 21:20:05,744 INFO L78 Accepts]: Start accepts. Automaton has 17437 states and 25648 transitions. Word has length 165 [2021-01-06 21:20:05,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:05,744 INFO L481 AbstractCegarLoop]: Abstraction has 17437 states and 25648 transitions. [2021-01-06 21:20:05,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:20:05,744 INFO L276 IsEmpty]: Start isEmpty. Operand 17437 states and 25648 transitions. [2021-01-06 21:20:05,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-01-06 21:20:05,768 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:05,769 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:05,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 21:20:05,769 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:05,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:05,770 INFO L82 PathProgramCache]: Analyzing trace with hash -846552929, now seen corresponding path program 1 times [2021-01-06 21:20:05,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:05,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051507341] [2021-01-06 21:20:05,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:05,887 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 21:20:05,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051507341] [2021-01-06 21:20:05,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:05,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:20:05,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049069991] [2021-01-06 21:20:05,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:20:05,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:05,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:20:05,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:20:05,890 INFO L87 Difference]: Start difference. First operand 17437 states and 25648 transitions. Second operand 5 states. [2021-01-06 21:20:07,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:07,210 INFO L93 Difference]: Finished difference Result 33724 states and 49986 transitions. [2021-01-06 21:20:07,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:20:07,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2021-01-06 21:20:07,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:07,241 INFO L225 Difference]: With dead ends: 33724 [2021-01-06 21:20:07,241 INFO L226 Difference]: Without dead ends: 17437 [2021-01-06 21:20:07,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:20:07,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17437 states. [2021-01-06 21:20:08,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17437 to 17437. [2021-01-06 21:20:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17437 states. [2021-01-06 21:20:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17437 states to 17437 states and 25410 transitions. [2021-01-06 21:20:08,668 INFO L78 Accepts]: Start accepts. Automaton has 17437 states and 25410 transitions. Word has length 166 [2021-01-06 21:20:08,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:08,669 INFO L481 AbstractCegarLoop]: Abstraction has 17437 states and 25410 transitions. [2021-01-06 21:20:08,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:20:08,669 INFO L276 IsEmpty]: Start isEmpty. Operand 17437 states and 25410 transitions. [2021-01-06 21:20:08,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-01-06 21:20:08,687 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:08,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:08,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 21:20:08,689 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:08,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:08,689 INFO L82 PathProgramCache]: Analyzing trace with hash -316024710, now seen corresponding path program 1 times [2021-01-06 21:20:08,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:08,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341582132] [2021-01-06 21:20:08,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:08,934 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 21:20:08,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341582132] [2021-01-06 21:20:08,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:08,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:20:08,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655296216] [2021-01-06 21:20:08,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:20:08,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:08,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:20:08,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:20:08,937 INFO L87 Difference]: Start difference. First operand 17437 states and 25410 transitions. Second operand 4 states. [2021-01-06 21:20:11,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:11,129 INFO L93 Difference]: Finished difference Result 43679 states and 65710 transitions. [2021-01-06 21:20:11,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:20:11,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2021-01-06 21:20:11,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:11,168 INFO L225 Difference]: With dead ends: 43679 [2021-01-06 21:20:11,169 INFO L226 Difference]: Without dead ends: 32388 [2021-01-06 21:20:11,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:20:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32388 states. [2021-01-06 21:20:13,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32388 to 32386. [2021-01-06 21:20:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32386 states. [2021-01-06 21:20:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32386 states to 32386 states and 47679 transitions. [2021-01-06 21:20:13,448 INFO L78 Accepts]: Start accepts. Automaton has 32386 states and 47679 transitions. Word has length 166 [2021-01-06 21:20:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:13,449 INFO L481 AbstractCegarLoop]: Abstraction has 32386 states and 47679 transitions. [2021-01-06 21:20:13,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:20:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 32386 states and 47679 transitions. [2021-01-06 21:20:13,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-01-06 21:20:13,471 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:13,472 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:13,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 21:20:13,472 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:13,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:13,473 INFO L82 PathProgramCache]: Analyzing trace with hash 105363050, now seen corresponding path program 1 times [2021-01-06 21:20:13,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:13,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942878061] [2021-01-06 21:20:13,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:13,650 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 21:20:13,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942878061] [2021-01-06 21:20:13,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:13,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:20:13,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008867175] [2021-01-06 21:20:13,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:20:13,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:13,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:20:13,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:20:13,655 INFO L87 Difference]: Start difference. First operand 32386 states and 47679 transitions. Second operand 5 states. [2021-01-06 21:20:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:19,049 INFO L93 Difference]: Finished difference Result 81978 states and 125897 transitions. [2021-01-06 21:20:19,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:20:19,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2021-01-06 21:20:19,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:19,164 INFO L225 Difference]: With dead ends: 81978 [2021-01-06 21:20:19,165 INFO L226 Difference]: Without dead ends: 71608 [2021-01-06 21:20:19,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:20:19,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71608 states. [2021-01-06 21:20:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71608 to 53386. [2021-01-06 21:20:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53386 states. [2021-01-06 21:20:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53386 states to 53386 states and 80575 transitions. [2021-01-06 21:20:23,508 INFO L78 Accepts]: Start accepts. Automaton has 53386 states and 80575 transitions. Word has length 166 [2021-01-06 21:20:23,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:23,509 INFO L481 AbstractCegarLoop]: Abstraction has 53386 states and 80575 transitions. [2021-01-06 21:20:23,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:20:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 53386 states and 80575 transitions. [2021-01-06 21:20:23,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-01-06 21:20:23,524 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:23,524 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:23,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 21:20:23,524 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:23,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:23,525 INFO L82 PathProgramCache]: Analyzing trace with hash 937564653, now seen corresponding path program 1 times [2021-01-06 21:20:23,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:23,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807853382] [2021-01-06 21:20:23,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:23,660 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 21:20:23,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807853382] [2021-01-06 21:20:23,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:23,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:20:23,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046176519] [2021-01-06 21:20:23,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:20:23,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:23,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:20:23,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:20:23,662 INFO L87 Difference]: Start difference. First operand 53386 states and 80575 transitions. Second operand 3 states. [2021-01-06 21:20:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:30,462 INFO L93 Difference]: Finished difference Result 135200 states and 207035 transitions. [2021-01-06 21:20:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:20:30,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2021-01-06 21:20:30,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:30,613 INFO L225 Difference]: With dead ends: 135200 [2021-01-06 21:20:30,613 INFO L226 Difference]: Without dead ends: 92730 [2021-01-06 21:20:30,667 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 21:20:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92730 states. [2021-01-06 21:20:38,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92730 to 92728. [2021-01-06 21:20:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92728 states. [2021-01-06 21:20:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92728 states to 92728 states and 139861 transitions. [2021-01-06 21:20:38,360 INFO L78 Accepts]: Start accepts. Automaton has 92728 states and 139861 transitions. Word has length 166 [2021-01-06 21:20:38,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:38,361 INFO L481 AbstractCegarLoop]: Abstraction has 92728 states and 139861 transitions. [2021-01-06 21:20:38,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:20:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand 92728 states and 139861 transitions. [2021-01-06 21:20:38,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-01-06 21:20:38,381 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:38,382 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:38,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 21:20:38,382 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:38,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:38,383 INFO L82 PathProgramCache]: Analyzing trace with hash 251154677, now seen corresponding path program 1 times [2021-01-06 21:20:38,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:38,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848923699] [2021-01-06 21:20:38,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:38,571 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 21:20:38,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848923699] [2021-01-06 21:20:38,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:38,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:20:38,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889115699] [2021-01-06 21:20:38,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:20:38,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:38,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:20:38,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:20:38,574 INFO L87 Difference]: Start difference. First operand 92728 states and 139861 transitions. Second operand 4 states. [2021-01-06 21:20:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:49,571 INFO L93 Difference]: Finished difference Result 226961 states and 342081 transitions. [2021-01-06 21:20:49,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:20:49,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2021-01-06 21:20:49,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:49,814 INFO L225 Difference]: With dead ends: 226961 [2021-01-06 21:20:49,815 INFO L226 Difference]: Without dead ends: 134581 [2021-01-06 21:20:49,895 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 21:20:50,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134581 states. [2021-01-06 21:21:01,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134581 to 134579. [2021-01-06 21:21:01,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134579 states. [2021-01-06 21:21:01,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134579 states to 134579 states and 200374 transitions. [2021-01-06 21:21:01,486 INFO L78 Accepts]: Start accepts. Automaton has 134579 states and 200374 transitions. Word has length 166 [2021-01-06 21:21:01,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:21:01,486 INFO L481 AbstractCegarLoop]: Abstraction has 134579 states and 200374 transitions. [2021-01-06 21:21:01,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:21:01,486 INFO L276 IsEmpty]: Start isEmpty. Operand 134579 states and 200374 transitions. [2021-01-06 21:21:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-01-06 21:21:01,527 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:21:01,528 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:01,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 21:21:01,528 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:21:01,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:21:01,529 INFO L82 PathProgramCache]: Analyzing trace with hash 926924829, now seen corresponding path program 1 times [2021-01-06 21:21:01,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:21:01,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095342095] [2021-01-06 21:21:01,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:21:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:21:01,716 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 21:21:01,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095342095] [2021-01-06 21:21:01,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:21:01,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:21:01,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798100280] [2021-01-06 21:21:01,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:21:01,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:21:01,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:21:01,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:21:01,721 INFO L87 Difference]: Start difference. First operand 134579 states and 200374 transitions. Second operand 4 states. [2021-01-06 21:21:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:21:11,644 INFO L93 Difference]: Finished difference Result 224205 states and 333625 transitions. [2021-01-06 21:21:11,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:21:11,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2021-01-06 21:21:11,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:21:11,849 INFO L225 Difference]: With dead ends: 224205 [2021-01-06 21:21:11,849 INFO L226 Difference]: Without dead ends: 122111 [2021-01-06 21:21:11,924 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 21:21:12,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122111 states. [2021-01-06 21:21:21,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122111 to 122111. [2021-01-06 21:21:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122111 states. [2021-01-06 21:21:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122111 states to 122111 states and 181778 transitions. [2021-01-06 21:21:22,132 INFO L78 Accepts]: Start accepts. Automaton has 122111 states and 181778 transitions. Word has length 168 [2021-01-06 21:21:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:21:22,132 INFO L481 AbstractCegarLoop]: Abstraction has 122111 states and 181778 transitions. [2021-01-06 21:21:22,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:21:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 122111 states and 181778 transitions. [2021-01-06 21:21:22,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-01-06 21:21:22,163 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:21:22,163 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:22,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 21:21:22,163 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:21:22,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:21:22,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1059303823, now seen corresponding path program 1 times [2021-01-06 21:21:22,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:21:22,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280233259] [2021-01-06 21:21:22,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:21:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:21:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:21:22,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280233259] [2021-01-06 21:21:22,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:21:22,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:21:22,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578602375] [2021-01-06 21:21:22,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:21:22,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:21:22,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:21:22,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:21:22,260 INFO L87 Difference]: Start difference. First operand 122111 states and 181778 transitions. Second operand 3 states.