/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.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 11:27:45,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 11:27:45,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 11:27:45,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 11:27:45,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 11:27:45,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 11:27:45,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 11:27:45,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 11:27:45,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 11:27:45,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 11:27:45,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 11:27:45,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 11:27:45,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 11:27:45,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 11:27:45,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 11:27:45,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 11:27:45,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 11:27:45,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 11:27:45,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 11:27:45,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 11:27:45,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 11:27:45,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 11:27:45,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 11:27:45,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 11:27:45,833 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 11:27:45,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 11:27:45,834 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 11:27:45,835 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 11:27:45,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 11:27:45,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 11:27:45,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 11:27:45,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 11:27:45,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 11:27:45,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 11:27:45,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 11:27:45,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 11:27:45,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 11:27:45,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 11:27:45,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 11:27:45,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 11:27:45,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 11:27:45,848 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 11:27:45,884 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 11:27:45,884 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 11:27:45,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 11:27:45,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 11:27:45,888 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 11:27:45,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 11:27:45,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 11:27:45,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 11:27:45,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 11:27:45,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 11:27:45,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 11:27:45,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 11:27:45,891 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 11:27:45,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 11:27:45,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 11:27:45,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 11:27:45,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 11:27:45,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 11:27:45,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 11:27:45,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 11:27:45,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 11:27:45,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 11:27:45,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 11:27:45,894 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 11:27:45,894 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 11:27:45,894 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 11:27:46,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 11:27:46,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 11:27:46,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 11:27:46,414 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 11:27:46,414 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 11:27:46,415 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.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2020-12-23 11:27:46,501 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8d10f049a/2caa522a194345559e348778570ca3aa/FLAG8086fbfd8 [2020-12-23 11:27:47,354 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 11:27:47,355 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2020-12-23 11:27:47,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8d10f049a/2caa522a194345559e348778570ca3aa/FLAG8086fbfd8 [2020-12-23 11:27:47,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8d10f049a/2caa522a194345559e348778570ca3aa [2020-12-23 11:27:47,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 11:27:47,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 11:27:47,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 11:27:47,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 11:27:47,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 11:27:47,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:27:47" (1/1) ... [2020-12-23 11:27:47,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a6b14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:27:47, skipping insertion in model container [2020-12-23 11:27:47,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:27:47" (1/1) ... [2020-12-23 11:27:47,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 11:27:47,536 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_1858~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_2004~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__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_2137~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~2,] 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_2256~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~2,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__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[~st1~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_2394~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2395_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_4~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~3,] [2020-12-23 11:27:48,035 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.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[15138,15151] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] 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[~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[~st1~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[~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[~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_2518~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2395_0~0,GLOBAL] 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[~nl1~0,GLOBAL] 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[~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[~__return_2408~0,GLOBAL] 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[~nl1~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[~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,] [2020-12-23 11:27:48,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 11:27:48,271 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_1858~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_2004~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__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_2137~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~2,] 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_2256~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~2,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__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[~st1~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_2394~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2395_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_4~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~3,] [2020-12-23 11:27:48,463 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.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[15138,15151] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] 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[~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[~st1~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[~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[~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_2518~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2395_0~0,GLOBAL] 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[~nl1~0,GLOBAL] 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[~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[~__return_2408~0,GLOBAL] 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[~nl1~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[~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,] [2020-12-23 11:27:48,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 11:27:48,559 INFO L208 MainTranslator]: Completed translation [2020-12-23 11:27:48,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:27:48 WrapperNode [2020-12-23 11:27:48,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 11:27:48,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 11:27:48,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 11:27:48,561 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 11:27:48,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:27:48" (1/1) ... [2020-12-23 11:27:48,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:27:48" (1/1) ... [2020-12-23 11:27:48,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 11:27:48,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 11:27:48,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 11:27:48,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 11:27:48,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:27:48" (1/1) ... [2020-12-23 11:27:48,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:27:48" (1/1) ... [2020-12-23 11:27:48,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:27:48" (1/1) ... [2020-12-23 11:27:48,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:27:48" (1/1) ... [2020-12-23 11:27:48,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:27:48" (1/1) ... [2020-12-23 11:27:48,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:27:48" (1/1) ... [2020-12-23 11:27:48,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:27:48" (1/1) ... [2020-12-23 11:27:48,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 11:27:48,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 11:27:48,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 11:27:48,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 11:27:48,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:27:48" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 11:27:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 11:27:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 11:27:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 11:27:48,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 11:27:50,602 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 11:27:50,603 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-23 11:27:50,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:27:50 BoogieIcfgContainer [2020-12-23 11:27:50,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 11:27:50,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 11:27:50,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 11:27:50,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 11:27:50,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 11:27:47" (1/3) ... [2020-12-23 11:27:50,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c8a502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:27:50, skipping insertion in model container [2020-12-23 11:27:50,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:27:48" (2/3) ... [2020-12-23 11:27:50,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c8a502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:27:50, skipping insertion in model container [2020-12-23 11:27:50,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:27:50" (3/3) ... [2020-12-23 11:27:50,616 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2020-12-23 11:27:50,623 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 11:27:50,629 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 11:27:50,650 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 11:27:50,683 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 11:27:50,683 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 11:27:50,684 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 11:27:50,684 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 11:27:50,684 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 11:27:50,684 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 11:27:50,684 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 11:27:50,685 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 11:27:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states. [2020-12-23 11:27:50,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-12-23 11:27:50,726 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:27:50,727 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] [2020-12-23 11:27:50,728 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:27:50,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:27:50,735 INFO L82 PathProgramCache]: Analyzing trace with hash 731422854, now seen corresponding path program 1 times [2020-12-23 11:27:50,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:27:50,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944552148] [2020-12-23 11:27:50,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:27:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:27:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:27:51,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944552148] [2020-12-23 11:27:51,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:27:51,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:27:51,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037647408] [2020-12-23 11:27:51,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:27:51,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:27:51,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:27:51,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:27:51,766 INFO L87 Difference]: Start difference. First operand 324 states. Second operand 4 states. [2020-12-23 11:27:52,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:27:52,040 INFO L93 Difference]: Finished difference Result 944 states and 1672 transitions. [2020-12-23 11:27:52,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:27:52,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2020-12-23 11:27:52,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:27:52,065 INFO L225 Difference]: With dead ends: 944 [2020-12-23 11:27:52,065 INFO L226 Difference]: Without dead ends: 623 [2020-12-23 11:27:52,071 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 [2020-12-23 11:27:52,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-12-23 11:27:52,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 621. [2020-12-23 11:27:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2020-12-23 11:27:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 904 transitions. [2020-12-23 11:27:52,210 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 904 transitions. Word has length 150 [2020-12-23 11:27:52,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:27:52,211 INFO L481 AbstractCegarLoop]: Abstraction has 621 states and 904 transitions. [2020-12-23 11:27:52,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:27:52,211 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 904 transitions. [2020-12-23 11:27:52,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-12-23 11:27:52,217 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:27:52,218 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] [2020-12-23 11:27:52,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 11:27:52,218 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:27:52,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:27:52,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1954150630, now seen corresponding path program 1 times [2020-12-23 11:27:52,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:27:52,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470181465] [2020-12-23 11:27:52,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:27:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:27:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:27:52,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470181465] [2020-12-23 11:27:52,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:27:52,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:27:52,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529171192] [2020-12-23 11:27:52,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:27:52,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:27:52,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:27:52,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:27:52,321 INFO L87 Difference]: Start difference. First operand 621 states and 904 transitions. Second operand 3 states. [2020-12-23 11:27:52,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:27:52,435 INFO L93 Difference]: Finished difference Result 1825 states and 2650 transitions. [2020-12-23 11:27:52,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:27:52,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2020-12-23 11:27:52,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:27:52,446 INFO L225 Difference]: With dead ends: 1825 [2020-12-23 11:27:52,447 INFO L226 Difference]: Without dead ends: 1232 [2020-12-23 11:27:52,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:27:52,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-12-23 11:27:52,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 623. [2020-12-23 11:27:52,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2020-12-23 11:27:52,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 906 transitions. [2020-12-23 11:27:52,544 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 906 transitions. Word has length 151 [2020-12-23 11:27:52,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:27:52,547 INFO L481 AbstractCegarLoop]: Abstraction has 623 states and 906 transitions. [2020-12-23 11:27:52,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:27:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 906 transitions. [2020-12-23 11:27:52,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-12-23 11:27:52,560 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:27:52,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:27:52,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 11:27:52,561 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:27:52,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:27:52,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1787410567, now seen corresponding path program 1 times [2020-12-23 11:27:52,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:27:52,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316920961] [2020-12-23 11:27:52,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:27:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:27:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:27:52,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316920961] [2020-12-23 11:27:52,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:27:52,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:27:52,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033854647] [2020-12-23 11:27:52,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:27:52,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:27:52,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:27:52,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:27:52,813 INFO L87 Difference]: Start difference. First operand 623 states and 906 transitions. Second operand 4 states. [2020-12-23 11:27:52,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:27:52,992 INFO L93 Difference]: Finished difference Result 1779 states and 2570 transitions. [2020-12-23 11:27:52,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:27:52,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2020-12-23 11:27:52,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:27:53,000 INFO L225 Difference]: With dead ends: 1779 [2020-12-23 11:27:53,001 INFO L226 Difference]: Without dead ends: 1186 [2020-12-23 11:27:53,003 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 [2020-12-23 11:27:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-12-23 11:27:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1184. [2020-12-23 11:27:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2020-12-23 11:27:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1696 transitions. [2020-12-23 11:27:53,117 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1696 transitions. Word has length 152 [2020-12-23 11:27:53,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:27:53,125 INFO L481 AbstractCegarLoop]: Abstraction has 1184 states and 1696 transitions. [2020-12-23 11:27:53,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:27:53,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1696 transitions. [2020-12-23 11:27:53,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-12-23 11:27:53,133 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:27:53,134 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] [2020-12-23 11:27:53,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 11:27:53,134 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:27:53,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:27:53,136 INFO L82 PathProgramCache]: Analyzing trace with hash -672172421, now seen corresponding path program 1 times [2020-12-23 11:27:53,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:27:53,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896243412] [2020-12-23 11:27:53,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:27:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:27:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:27:53,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896243412] [2020-12-23 11:27:53,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:27:53,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:27:53,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726122811] [2020-12-23 11:27:53,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:27:53,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:27:53,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:27:53,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:27:53,246 INFO L87 Difference]: Start difference. First operand 1184 states and 1696 transitions. Second operand 3 states. [2020-12-23 11:27:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:27:53,409 INFO L93 Difference]: Finished difference Result 3476 states and 4968 transitions. [2020-12-23 11:27:53,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:27:53,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2020-12-23 11:27:53,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:27:53,423 INFO L225 Difference]: With dead ends: 3476 [2020-12-23 11:27:53,424 INFO L226 Difference]: Without dead ends: 2336 [2020-12-23 11:27:53,427 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:27:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2020-12-23 11:27:53,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 1188. [2020-12-23 11:27:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2020-12-23 11:27:53,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1700 transitions. [2020-12-23 11:27:53,558 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1700 transitions. Word has length 153 [2020-12-23 11:27:53,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:27:53,560 INFO L481 AbstractCegarLoop]: Abstraction has 1188 states and 1700 transitions. [2020-12-23 11:27:53,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:27:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1700 transitions. [2020-12-23 11:27:53,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-12-23 11:27:53,564 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:27:53,565 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] [2020-12-23 11:27:53,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 11:27:53,565 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:27:53,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:27:53,566 INFO L82 PathProgramCache]: Analyzing trace with hash 540119633, now seen corresponding path program 1 times [2020-12-23 11:27:53,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:27:53,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5458511] [2020-12-23 11:27:53,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:27:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:27:53,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:27:53,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5458511] [2020-12-23 11:27:53,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:27:53,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:27:53,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532500481] [2020-12-23 11:27:53,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:27:53,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:27:53,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:27:53,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:27:53,763 INFO L87 Difference]: Start difference. First operand 1188 states and 1700 transitions. Second operand 3 states. [2020-12-23 11:27:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:27:54,035 INFO L93 Difference]: Finished difference Result 3124 states and 4492 transitions. [2020-12-23 11:27:54,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:27:54,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2020-12-23 11:27:54,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:27:54,051 INFO L225 Difference]: With dead ends: 3124 [2020-12-23 11:27:54,052 INFO L226 Difference]: Without dead ends: 2272 [2020-12-23 11:27:54,055 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:27:54,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2020-12-23 11:27:54,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 2270. [2020-12-23 11:27:54,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2020-12-23 11:27:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 3208 transitions. [2020-12-23 11:27:54,320 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 3208 transitions. Word has length 154 [2020-12-23 11:27:54,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:27:54,322 INFO L481 AbstractCegarLoop]: Abstraction has 2270 states and 3208 transitions. [2020-12-23 11:27:54,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:27:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 3208 transitions. [2020-12-23 11:27:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-12-23 11:27:54,331 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:27:54,331 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] [2020-12-23 11:27:54,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 11:27:54,332 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:27:54,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:27:54,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1047550958, now seen corresponding path program 1 times [2020-12-23 11:27:54,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:27:54,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154224704] [2020-12-23 11:27:54,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:27:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:27:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:27:54,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154224704] [2020-12-23 11:27:54,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:27:54,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:27:54,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823428894] [2020-12-23 11:27:54,632 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:27:54,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:27:54,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:27:54,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:27:54,634 INFO L87 Difference]: Start difference. First operand 2270 states and 3208 transitions. Second operand 5 states. [2020-12-23 11:27:55,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:27:55,057 INFO L93 Difference]: Finished difference Result 6318 states and 8929 transitions. [2020-12-23 11:27:55,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:27:55,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2020-12-23 11:27:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:27:55,081 INFO L225 Difference]: With dead ends: 6318 [2020-12-23 11:27:55,081 INFO L226 Difference]: Without dead ends: 4085 [2020-12-23 11:27:55,089 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 [2020-12-23 11:27:55,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2020-12-23 11:27:55,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 4083. [2020-12-23 11:27:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4083 states. [2020-12-23 11:27:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4083 states to 4083 states and 5722 transitions. [2020-12-23 11:27:55,505 INFO L78 Accepts]: Start accepts. Automaton has 4083 states and 5722 transitions. Word has length 154 [2020-12-23 11:27:55,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:27:55,505 INFO L481 AbstractCegarLoop]: Abstraction has 4083 states and 5722 transitions. [2020-12-23 11:27:55,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:27:55,505 INFO L276 IsEmpty]: Start isEmpty. Operand 4083 states and 5722 transitions. [2020-12-23 11:27:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-12-23 11:27:55,514 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:27:55,514 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] [2020-12-23 11:27:55,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 11:27:55,515 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:27:55,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:27:55,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1357265656, now seen corresponding path program 1 times [2020-12-23 11:27:55,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:27:55,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198434269] [2020-12-23 11:27:55,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:27:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:27:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:27:55,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198434269] [2020-12-23 11:27:55,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:27:55,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:27:55,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345076864] [2020-12-23 11:27:55,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:27:55,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:27:55,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:27:55,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:27:55,748 INFO L87 Difference]: Start difference. First operand 4083 states and 5722 transitions. Second operand 4 states. [2020-12-23 11:27:56,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:27:56,251 INFO L93 Difference]: Finished difference Result 8434 states and 11732 transitions. [2020-12-23 11:27:56,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:27:56,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2020-12-23 11:27:56,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:27:56,276 INFO L225 Difference]: With dead ends: 8434 [2020-12-23 11:27:56,276 INFO L226 Difference]: Without dead ends: 4468 [2020-12-23 11:27:56,282 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 [2020-12-23 11:27:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4468 states. [2020-12-23 11:27:56,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4468 to 4311. [2020-12-23 11:27:56,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4311 states. [2020-12-23 11:27:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 5978 transitions. [2020-12-23 11:27:56,736 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 5978 transitions. Word has length 154 [2020-12-23 11:27:56,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:27:56,738 INFO L481 AbstractCegarLoop]: Abstraction has 4311 states and 5978 transitions. [2020-12-23 11:27:56,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:27:56,738 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 5978 transitions. [2020-12-23 11:27:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-12-23 11:27:56,747 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:27:56,747 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] [2020-12-23 11:27:56,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 11:27:56,748 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:27:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:27:56,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1903211100, now seen corresponding path program 1 times [2020-12-23 11:27:56,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:27:56,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064193601] [2020-12-23 11:27:56,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:27:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:27:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:27:56,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064193601] [2020-12-23 11:27:56,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:27:56,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:27:56,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100758486] [2020-12-23 11:27:56,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:27:56,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:27:56,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:27:56,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:27:56,819 INFO L87 Difference]: Start difference. First operand 4311 states and 5978 transitions. Second operand 3 states. [2020-12-23 11:27:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:27:57,497 INFO L93 Difference]: Finished difference Result 12199 states and 16992 transitions. [2020-12-23 11:27:57,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:27:57,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2020-12-23 11:27:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:27:57,542 INFO L225 Difference]: With dead ends: 12199 [2020-12-23 11:27:57,542 INFO L226 Difference]: Without dead ends: 8497 [2020-12-23 11:27:57,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:27:57,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8497 states. [2020-12-23 11:27:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8497 to 4327. [2020-12-23 11:27:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4327 states. [2020-12-23 11:27:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 5994 transitions. [2020-12-23 11:27:58,026 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 5994 transitions. Word has length 155 [2020-12-23 11:27:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:27:58,026 INFO L481 AbstractCegarLoop]: Abstraction has 4327 states and 5994 transitions. [2020-12-23 11:27:58,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:27:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 5994 transitions. [2020-12-23 11:27:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-12-23 11:27:58,036 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:27:58,036 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:27:58,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 11:27:58,036 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:27:58,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:27:58,037 INFO L82 PathProgramCache]: Analyzing trace with hash -347339255, now seen corresponding path program 1 times [2020-12-23 11:27:58,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:27:58,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061593580] [2020-12-23 11:27:58,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:27:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:27:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:27:58,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061593580] [2020-12-23 11:27:58,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:27:58,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:27:58,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17909782] [2020-12-23 11:27:58,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:27:58,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:27:58,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:27:58,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:27:58,234 INFO L87 Difference]: Start difference. First operand 4327 states and 5994 transitions. Second operand 4 states. [2020-12-23 11:27:58,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:27:58,670 INFO L93 Difference]: Finished difference Result 8644 states and 11974 transitions. [2020-12-23 11:27:58,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:27:58,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2020-12-23 11:27:58,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:27:58,715 INFO L225 Difference]: With dead ends: 8644 [2020-12-23 11:27:58,716 INFO L226 Difference]: Without dead ends: 4325 [2020-12-23 11:27:58,724 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 [2020-12-23 11:27:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4325 states. [2020-12-23 11:27:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4325 to 4325. [2020-12-23 11:27:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4325 states. [2020-12-23 11:27:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 4325 states and 5990 transitions. [2020-12-23 11:27:59,110 INFO L78 Accepts]: Start accepts. Automaton has 4325 states and 5990 transitions. Word has length 156 [2020-12-23 11:27:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:27:59,111 INFO L481 AbstractCegarLoop]: Abstraction has 4325 states and 5990 transitions. [2020-12-23 11:27:59,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:27:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 4325 states and 5990 transitions. [2020-12-23 11:27:59,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-12-23 11:27:59,120 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:27:59,120 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] [2020-12-23 11:27:59,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 11:27:59,121 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:27:59,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:27:59,122 INFO L82 PathProgramCache]: Analyzing trace with hash 681641518, now seen corresponding path program 1 times [2020-12-23 11:27:59,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:27:59,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571141891] [2020-12-23 11:27:59,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:27:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:27:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:27:59,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571141891] [2020-12-23 11:27:59,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:27:59,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:27:59,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317240061] [2020-12-23 11:27:59,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:27:59,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:27:59,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:27:59,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:27:59,265 INFO L87 Difference]: Start difference. First operand 4325 states and 5990 transitions. Second operand 3 states. [2020-12-23 11:27:59,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:27:59,744 INFO L93 Difference]: Finished difference Result 9492 states and 13249 transitions. [2020-12-23 11:27:59,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:27:59,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2020-12-23 11:27:59,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:27:59,761 INFO L225 Difference]: With dead ends: 9492 [2020-12-23 11:27:59,761 INFO L226 Difference]: Without dead ends: 6394 [2020-12-23 11:27:59,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:27:59,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6394 states. [2020-12-23 11:28:00,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6394 to 6392. [2020-12-23 11:28:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6392 states. [2020-12-23 11:28:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6392 states to 6392 states and 8711 transitions. [2020-12-23 11:28:00,209 INFO L78 Accepts]: Start accepts. Automaton has 6392 states and 8711 transitions. Word has length 156 [2020-12-23 11:28:00,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:28:00,209 INFO L481 AbstractCegarLoop]: Abstraction has 6392 states and 8711 transitions. [2020-12-23 11:28:00,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:28:00,209 INFO L276 IsEmpty]: Start isEmpty. Operand 6392 states and 8711 transitions. [2020-12-23 11:28:00,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 11:28:00,221 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:28:00,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:28:00,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 11:28:00,222 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:28:00,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:28:00,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1703352107, now seen corresponding path program 1 times [2020-12-23 11:28:00,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:28:00,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975982512] [2020-12-23 11:28:00,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:28:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:28:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:28:00,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975982512] [2020-12-23 11:28:00,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:28:00,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:28:00,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566743651] [2020-12-23 11:28:00,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:28:00,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:28:00,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:28:00,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:28:00,353 INFO L87 Difference]: Start difference. First operand 6392 states and 8711 transitions. Second operand 3 states. [2020-12-23 11:28:00,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:28:00,917 INFO L93 Difference]: Finished difference Result 13132 states and 18577 transitions. [2020-12-23 11:28:00,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:28:00,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2020-12-23 11:28:00,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:28:00,939 INFO L225 Difference]: With dead ends: 13132 [2020-12-23 11:28:00,939 INFO L226 Difference]: Without dead ends: 7962 [2020-12-23 11:28:00,950 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:28:00,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7962 states. [2020-12-23 11:28:01,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7962 to 7864. [2020-12-23 11:28:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7864 states. [2020-12-23 11:28:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7864 states to 7864 states and 11047 transitions. [2020-12-23 11:28:01,609 INFO L78 Accepts]: Start accepts. Automaton has 7864 states and 11047 transitions. Word has length 157 [2020-12-23 11:28:01,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:28:01,610 INFO L481 AbstractCegarLoop]: Abstraction has 7864 states and 11047 transitions. [2020-12-23 11:28:01,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:28:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 7864 states and 11047 transitions. [2020-12-23 11:28:01,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-12-23 11:28:01,622 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:28:01,622 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] [2020-12-23 11:28:01,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 11:28:01,623 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:28:01,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:28:01,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1332410921, now seen corresponding path program 1 times [2020-12-23 11:28:01,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:28:01,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104813298] [2020-12-23 11:28:01,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:28:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:28:01,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:28:01,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104813298] [2020-12-23 11:28:01,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:28:01,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 11:28:01,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508206714] [2020-12-23 11:28:01,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 11:28:01,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:28:01,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 11:28:01,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:28:01,906 INFO L87 Difference]: Start difference. First operand 7864 states and 11047 transitions. Second operand 8 states. [2020-12-23 11:28:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:28:04,027 INFO L93 Difference]: Finished difference Result 21257 states and 31470 transitions. [2020-12-23 11:28:04,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 11:28:04,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 160 [2020-12-23 11:28:04,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:28:04,070 INFO L225 Difference]: With dead ends: 21257 [2020-12-23 11:28:04,070 INFO L226 Difference]: Without dead ends: 15606 [2020-12-23 11:28:04,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2020-12-23 11:28:04,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15606 states. [2020-12-23 11:28:05,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15606 to 9376. [2020-12-23 11:28:05,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9376 states. [2020-12-23 11:28:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9376 states to 9376 states and 13231 transitions. [2020-12-23 11:28:05,104 INFO L78 Accepts]: Start accepts. Automaton has 9376 states and 13231 transitions. Word has length 160 [2020-12-23 11:28:05,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:28:05,105 INFO L481 AbstractCegarLoop]: Abstraction has 9376 states and 13231 transitions. [2020-12-23 11:28:05,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 11:28:05,105 INFO L276 IsEmpty]: Start isEmpty. Operand 9376 states and 13231 transitions. [2020-12-23 11:28:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-12-23 11:28:05,117 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:28:05,117 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:28:05,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 11:28:05,117 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:28:05,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:28:05,118 INFO L82 PathProgramCache]: Analyzing trace with hash 341763621, now seen corresponding path program 1 times [2020-12-23 11:28:05,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:28:05,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870935404] [2020-12-23 11:28:05,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:28:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:28:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:28:05,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870935404] [2020-12-23 11:28:05,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:28:05,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:28:05,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962416205] [2020-12-23 11:28:05,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:28:05,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:28:05,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:28:05,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:28:05,300 INFO L87 Difference]: Start difference. First operand 9376 states and 13231 transitions. Second operand 4 states. [2020-12-23 11:28:06,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:28:06,424 INFO L93 Difference]: Finished difference Result 23981 states and 34093 transitions. [2020-12-23 11:28:06,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:28:06,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2020-12-23 11:28:06,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:28:06,462 INFO L225 Difference]: With dead ends: 23981 [2020-12-23 11:28:06,462 INFO L226 Difference]: Without dead ends: 14959 [2020-12-23 11:28:06,478 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 [2020-12-23 11:28:06,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14959 states. [2020-12-23 11:28:07,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14959 to 14957. [2020-12-23 11:28:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14957 states. [2020-12-23 11:28:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14957 states to 14957 states and 21070 transitions. [2020-12-23 11:28:07,860 INFO L78 Accepts]: Start accepts. Automaton has 14957 states and 21070 transitions. Word has length 160 [2020-12-23 11:28:07,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:28:07,860 INFO L481 AbstractCegarLoop]: Abstraction has 14957 states and 21070 transitions. [2020-12-23 11:28:07,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:28:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 14957 states and 21070 transitions. [2020-12-23 11:28:07,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-12-23 11:28:07,874 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:28:07,874 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] [2020-12-23 11:28:07,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 11:28:07,875 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:28:07,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:28:07,875 INFO L82 PathProgramCache]: Analyzing trace with hash -247303654, now seen corresponding path program 1 times [2020-12-23 11:28:07,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:28:07,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746700902] [2020-12-23 11:28:07,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:28:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:28:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:28:08,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746700902] [2020-12-23 11:28:08,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:28:08,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:28:08,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854446230] [2020-12-23 11:28:08,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:28:08,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:28:08,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:28:08,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:28:08,185 INFO L87 Difference]: Start difference. First operand 14957 states and 21070 transitions. Second operand 4 states. [2020-12-23 11:28:08,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:28:08,954 INFO L93 Difference]: Finished difference Result 23821 states and 33724 transitions. [2020-12-23 11:28:08,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:28:08,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2020-12-23 11:28:08,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:28:08,982 INFO L225 Difference]: With dead ends: 23821 [2020-12-23 11:28:08,982 INFO L226 Difference]: Without dead ends: 12165 [2020-12-23 11:28:09,001 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 [2020-12-23 11:28:09,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12165 states. [2020-12-23 11:28:10,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12165 to 12165. [2020-12-23 11:28:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12165 states. [2020-12-23 11:28:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12165 states to 12165 states and 17047 transitions. [2020-12-23 11:28:10,325 INFO L78 Accepts]: Start accepts. Automaton has 12165 states and 17047 transitions. Word has length 162 [2020-12-23 11:28:10,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:28:10,325 INFO L481 AbstractCegarLoop]: Abstraction has 12165 states and 17047 transitions. [2020-12-23 11:28:10,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:28:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 12165 states and 17047 transitions. [2020-12-23 11:28:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2020-12-23 11:28:10,336 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:28:10,336 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] [2020-12-23 11:28:10,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 11:28:10,337 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:28:10,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:28:10,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1747884219, now seen corresponding path program 1 times [2020-12-23 11:28:10,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:28:10,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900614212] [2020-12-23 11:28:10,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:28:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:28:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:28:10,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900614212] [2020-12-23 11:28:10,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:28:10,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:28:10,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822781164] [2020-12-23 11:28:10,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:28:10,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:28:10,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:28:10,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:28:10,558 INFO L87 Difference]: Start difference. First operand 12165 states and 17047 transitions. Second operand 4 states. [2020-12-23 11:28:12,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:28:12,126 INFO L93 Difference]: Finished difference Result 28477 states and 41489 transitions. [2020-12-23 11:28:12,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:28:12,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2020-12-23 11:28:12,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:28:12,172 INFO L225 Difference]: With dead ends: 28477 [2020-12-23 11:28:12,172 INFO L226 Difference]: Without dead ends: 21507 [2020-12-23 11:28:12,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:28:12,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21507 states. [2020-12-23 11:28:14,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21507 to 21505. [2020-12-23 11:28:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21505 states. [2020-12-23 11:28:14,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21505 states to 21505 states and 30595 transitions. [2020-12-23 11:28:14,191 INFO L78 Accepts]: Start accepts. Automaton has 21505 states and 30595 transitions. Word has length 166 [2020-12-23 11:28:14,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:28:14,192 INFO L481 AbstractCegarLoop]: Abstraction has 21505 states and 30595 transitions. [2020-12-23 11:28:14,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:28:14,192 INFO L276 IsEmpty]: Start isEmpty. Operand 21505 states and 30595 transitions. [2020-12-23 11:28:14,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2020-12-23 11:28:14,206 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:28:14,207 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] [2020-12-23 11:28:14,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 11:28:14,207 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:28:14,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:28:14,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1264928814, now seen corresponding path program 1 times [2020-12-23 11:28:14,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:28:14,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784559290] [2020-12-23 11:28:14,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:28:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:28:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:28:14,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784559290] [2020-12-23 11:28:14,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:28:14,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:28:14,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675133018] [2020-12-23 11:28:14,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:28:14,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:28:14,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:28:14,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:28:14,415 INFO L87 Difference]: Start difference. First operand 21505 states and 30595 transitions. Second operand 4 states. [2020-12-23 11:28:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:28:15,814 INFO L93 Difference]: Finished difference Result 36044 states and 51188 transitions. [2020-12-23 11:28:15,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:28:15,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2020-12-23 11:28:15,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:28:15,843 INFO L225 Difference]: With dead ends: 36044 [2020-12-23 11:28:15,843 INFO L226 Difference]: Without dead ends: 14609 [2020-12-23 11:28:15,864 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 [2020-12-23 11:28:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14609 states. [2020-12-23 11:28:17,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14609 to 14609. [2020-12-23 11:28:17,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14609 states. [2020-12-23 11:28:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14609 states to 14609 states and 20679 transitions. [2020-12-23 11:28:17,068 INFO L78 Accepts]: Start accepts. Automaton has 14609 states and 20679 transitions. Word has length 166 [2020-12-23 11:28:17,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:28:17,068 INFO L481 AbstractCegarLoop]: Abstraction has 14609 states and 20679 transitions. [2020-12-23 11:28:17,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:28:17,068 INFO L276 IsEmpty]: Start isEmpty. Operand 14609 states and 20679 transitions. [2020-12-23 11:28:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-12-23 11:28:17,077 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:28:17,077 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] [2020-12-23 11:28:17,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 11:28:17,078 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:28:17,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:28:17,078 INFO L82 PathProgramCache]: Analyzing trace with hash -68040980, now seen corresponding path program 1 times [2020-12-23 11:28:17,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:28:17,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973912155] [2020-12-23 11:28:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:28:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:28:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:28:17,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973912155] [2020-12-23 11:28:17,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:28:17,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:28:17,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436333865] [2020-12-23 11:28:17,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:28:17,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:28:17,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:28:17,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:28:17,159 INFO L87 Difference]: Start difference. First operand 14609 states and 20679 transitions. Second operand 3 states. [2020-12-23 11:28:18,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:28:18,928 INFO L93 Difference]: Finished difference Result 37738 states and 54497 transitions. [2020-12-23 11:28:18,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:28:18,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2020-12-23 11:28:18,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:28:18,963 INFO L225 Difference]: With dead ends: 37738 [2020-12-23 11:28:18,964 INFO L226 Difference]: Without dead ends: 24151 [2020-12-23 11:28:18,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 [2020-12-23 11:28:19,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24151 states. [2020-12-23 11:28:20,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24151 to 21851. [2020-12-23 11:28:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21851 states. [2020-12-23 11:28:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21851 states to 21851 states and 31867 transitions. [2020-12-23 11:28:20,973 INFO L78 Accepts]: Start accepts. Automaton has 21851 states and 31867 transitions. Word has length 168 [2020-12-23 11:28:20,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:28:20,973 INFO L481 AbstractCegarLoop]: Abstraction has 21851 states and 31867 transitions. [2020-12-23 11:28:20,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:28:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 21851 states and 31867 transitions. [2020-12-23 11:28:20,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 11:28:20,980 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:28:20,980 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] [2020-12-23 11:28:20,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 11:28:20,980 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:28:20,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:28:20,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1403451150, now seen corresponding path program 1 times [2020-12-23 11:28:20,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:28:20,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057190113] [2020-12-23 11:28:20,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:28:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:28:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:28:21,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057190113] [2020-12-23 11:28:21,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:28:21,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:28:21,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555492779] [2020-12-23 11:28:21,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:28:21,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:28:21,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:28:21,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:28:21,069 INFO L87 Difference]: Start difference. First operand 21851 states and 31867 transitions. Second operand 3 states. [2020-12-23 11:28:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:28:23,754 INFO L93 Difference]: Finished difference Result 52906 states and 78194 transitions. [2020-12-23 11:28:23,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:28:23,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 11:28:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:28:23,806 INFO L225 Difference]: With dead ends: 52906 [2020-12-23 11:28:23,807 INFO L226 Difference]: Without dead ends: 35233 [2020-12-23 11:28:23,830 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:28:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35233 states. [2020-12-23 11:28:26,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35233 to 33091. [2020-12-23 11:28:26,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33091 states. [2020-12-23 11:28:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33091 states to 33091 states and 49009 transitions. [2020-12-23 11:28:26,703 INFO L78 Accepts]: Start accepts. Automaton has 33091 states and 49009 transitions. Word has length 171 [2020-12-23 11:28:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:28:26,703 INFO L481 AbstractCegarLoop]: Abstraction has 33091 states and 49009 transitions. [2020-12-23 11:28:26,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:28:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 33091 states and 49009 transitions. [2020-12-23 11:28:26,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-12-23 11:28:26,711 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:28:26,712 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, 1] [2020-12-23 11:28:26,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 11:28:26,712 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:28:26,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:28:26,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1362784471, now seen corresponding path program 1 times [2020-12-23 11:28:26,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:28:26,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613289285] [2020-12-23 11:28:26,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:28:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:28:26,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:28:26,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613289285] [2020-12-23 11:28:26,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:28:26,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:28:26,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003853520] [2020-12-23 11:28:26,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:28:26,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:28:26,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:28:26,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:28:26,916 INFO L87 Difference]: Start difference. First operand 33091 states and 49009 transitions. Second operand 4 states. [2020-12-23 11:28:29,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:28:29,764 INFO L93 Difference]: Finished difference Result 57736 states and 85419 transitions. [2020-12-23 11:28:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:28:29,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2020-12-23 11:28:29,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:28:29,813 INFO L225 Difference]: With dead ends: 57736 [2020-12-23 11:28:29,813 INFO L226 Difference]: Without dead ends: 33081 [2020-12-23 11:28:29,838 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 [2020-12-23 11:28:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33081 states. [2020-12-23 11:28:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33081 to 33081. [2020-12-23 11:28:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33081 states. [2020-12-23 11:28:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33081 states to 33081 states and 48994 transitions. [2020-12-23 11:28:32,684 INFO L78 Accepts]: Start accepts. Automaton has 33081 states and 48994 transitions. Word has length 173 [2020-12-23 11:28:32,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:28:32,684 INFO L481 AbstractCegarLoop]: Abstraction has 33081 states and 48994 transitions. [2020-12-23 11:28:32,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:28:32,684 INFO L276 IsEmpty]: Start isEmpty. Operand 33081 states and 48994 transitions. [2020-12-23 11:28:32,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-12-23 11:28:32,691 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:28:32,691 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, 1] [2020-12-23 11:28:32,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 11:28:32,691 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:28:32,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:28:32,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1128113098, now seen corresponding path program 1 times [2020-12-23 11:28:32,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:28:32,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88538216] [2020-12-23 11:28:32,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:28:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:28:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:28:32,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88538216] [2020-12-23 11:28:32,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:28:32,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:28:32,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39542283] [2020-12-23 11:28:32,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:28:32,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:28:32,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:28:32,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:28:32,913 INFO L87 Difference]: Start difference. First operand 33081 states and 48994 transitions. Second operand 5 states. [2020-12-23 11:28:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:28:36,057 INFO L93 Difference]: Finished difference Result 63182 states and 93572 transitions. [2020-12-23 11:28:36,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:28:36,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 173 [2020-12-23 11:28:36,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:28:36,107 INFO L225 Difference]: With dead ends: 63182 [2020-12-23 11:28:36,107 INFO L226 Difference]: Without dead ends: 30356 [2020-12-23 11:28:36,137 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 [2020-12-23 11:28:36,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30356 states. [2020-12-23 11:28:38,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30356 to 30199. [2020-12-23 11:28:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30199 states. [2020-12-23 11:28:38,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30199 states to 30199 states and 44670 transitions. [2020-12-23 11:28:38,829 INFO L78 Accepts]: Start accepts. Automaton has 30199 states and 44670 transitions. Word has length 173 [2020-12-23 11:28:38,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:28:38,829 INFO L481 AbstractCegarLoop]: Abstraction has 30199 states and 44670 transitions. [2020-12-23 11:28:38,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:28:38,829 INFO L276 IsEmpty]: Start isEmpty. Operand 30199 states and 44670 transitions. [2020-12-23 11:28:38,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-23 11:28:38,834 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:28:38,835 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, 1, 1, 1, 1] [2020-12-23 11:28:38,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 11:28:38,835 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:28:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:28:38,835 INFO L82 PathProgramCache]: Analyzing trace with hash -268733951, now seen corresponding path program 1 times [2020-12-23 11:28:38,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:28:38,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554270238] [2020-12-23 11:28:38,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:28:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:28:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:28:39,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554270238] [2020-12-23 11:28:39,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:28:39,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:28:39,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560832454] [2020-12-23 11:28:39,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:28:39,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:28:39,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:28:39,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:28:39,042 INFO L87 Difference]: Start difference. First operand 30199 states and 44670 transitions. Second operand 6 states. [2020-12-23 11:28:44,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:28:44,692 INFO L93 Difference]: Finished difference Result 84833 states and 126849 transitions. [2020-12-23 11:28:44,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:28:44,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2020-12-23 11:28:44,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:28:44,783 INFO L225 Difference]: With dead ends: 84833 [2020-12-23 11:28:44,783 INFO L226 Difference]: Without dead ends: 55882 [2020-12-23 11:28:44,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:28:44,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55882 states. [2020-12-23 11:28:49,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55882 to 43532. [2020-12-23 11:28:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43532 states. [2020-12-23 11:28:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43532 states to 43532 states and 64405 transitions. [2020-12-23 11:28:49,131 INFO L78 Accepts]: Start accepts. Automaton has 43532 states and 64405 transitions. Word has length 176 [2020-12-23 11:28:49,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:28:49,131 INFO L481 AbstractCegarLoop]: Abstraction has 43532 states and 64405 transitions. [2020-12-23 11:28:49,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:28:49,132 INFO L276 IsEmpty]: Start isEmpty. Operand 43532 states and 64405 transitions. [2020-12-23 11:28:49,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-23 11:28:49,137 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:28:49,137 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, 1, 1, 1, 1] [2020-12-23 11:28:49,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 11:28:49,137 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:28:49,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:28:49,138 INFO L82 PathProgramCache]: Analyzing trace with hash 693497478, now seen corresponding path program 1 times [2020-12-23 11:28:49,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:28:49,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292244444] [2020-12-23 11:28:49,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:28:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:28:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:28:49,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292244444] [2020-12-23 11:28:49,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:28:49,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 11:28:49,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308724374] [2020-12-23 11:28:49,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 11:28:49,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:28:49,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 11:28:49,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:28:49,383 INFO L87 Difference]: Start difference. First operand 43532 states and 64405 transitions. Second operand 9 states. [2020-12-23 11:29:11,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:29:11,505 INFO L93 Difference]: Finished difference Result 247537 states and 365612 transitions. [2020-12-23 11:29:11,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-23 11:29:11,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 176 [2020-12-23 11:29:11,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:29:12,087 INFO L225 Difference]: With dead ends: 247537 [2020-12-23 11:29:12,088 INFO L226 Difference]: Without dead ends: 205602 [2020-12-23 11:29:12,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2020-12-23 11:29:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205602 states. [2020-12-23 11:29:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205602 to 96716. [2020-12-23 11:29:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96716 states. [2020-12-23 11:29:23,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96716 states to 96716 states and 143008 transitions. [2020-12-23 11:29:23,891 INFO L78 Accepts]: Start accepts. Automaton has 96716 states and 143008 transitions. Word has length 176 [2020-12-23 11:29:23,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:29:23,891 INFO L481 AbstractCegarLoop]: Abstraction has 96716 states and 143008 transitions. [2020-12-23 11:29:23,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 11:29:23,891 INFO L276 IsEmpty]: Start isEmpty. Operand 96716 states and 143008 transitions. [2020-12-23 11:29:23,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-23 11:29:23,905 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:29:23,905 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, 1, 1, 1, 1] [2020-12-23 11:29:23,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 11:29:23,906 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:29:23,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:29:23,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1797078089, now seen corresponding path program 1 times [2020-12-23 11:29:23,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:29:23,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544576765] [2020-12-23 11:29:23,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:29:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:29:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:29:24,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544576765] [2020-12-23 11:29:24,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:29:24,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 11:29:24,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126247483] [2020-12-23 11:29:24,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 11:29:24,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:29:24,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 11:29:24,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:29:24,133 INFO L87 Difference]: Start difference. First operand 96716 states and 143008 transitions. Second operand 8 states. [2020-12-23 11:29:37,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:29:37,594 INFO L93 Difference]: Finished difference Result 199130 states and 294190 transitions. [2020-12-23 11:29:37,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 11:29:37,594 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 176 [2020-12-23 11:29:37,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:29:37,794 INFO L225 Difference]: With dead ends: 199130 [2020-12-23 11:29:37,795 INFO L226 Difference]: Without dead ends: 104031 [2020-12-23 11:29:37,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2020-12-23 11:29:37,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104031 states. [2020-12-23 11:29:43,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104031 to 49097. [2020-12-23 11:29:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49097 states. [2020-12-23 11:29:43,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49097 states to 49097 states and 72309 transitions. [2020-12-23 11:29:43,906 INFO L78 Accepts]: Start accepts. Automaton has 49097 states and 72309 transitions. Word has length 176 [2020-12-23 11:29:43,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:29:43,907 INFO L481 AbstractCegarLoop]: Abstraction has 49097 states and 72309 transitions. [2020-12-23 11:29:43,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 11:29:43,907 INFO L276 IsEmpty]: Start isEmpty. Operand 49097 states and 72309 transitions. [2020-12-23 11:29:43,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-23 11:29:43,913 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:29:43,913 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, 1, 1, 1, 1] [2020-12-23 11:29:43,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 11:29:43,913 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:29:43,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:29:43,914 INFO L82 PathProgramCache]: Analyzing trace with hash -138933417, now seen corresponding path program 1 times [2020-12-23 11:29:43,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:29:43,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101146919] [2020-12-23 11:29:43,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:29:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:29:44,692 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2020-12-23 11:29:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:29:45,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101146919] [2020-12-23 11:29:45,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:29:45,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-12-23 11:29:45,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839288311] [2020-12-23 11:29:45,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-23 11:29:45,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:29:45,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-23 11:29:45,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2020-12-23 11:29:45,841 INFO L87 Difference]: Start difference. First operand 49097 states and 72309 transitions. Second operand 21 states. [2020-12-23 11:29:46,151 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2020-12-23 11:29:46,389 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2020-12-23 11:29:46,621 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-12-23 11:29:46,916 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-12-23 11:29:47,322 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2020-12-23 11:29:47,855 WARN L197 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2020-12-23 11:29:48,231 WARN L197 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2020-12-23 11:29:48,688 WARN L197 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2020-12-23 11:29:49,114 WARN L197 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2020-12-23 11:29:49,556 WARN L197 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2020-12-23 11:29:49,980 WARN L197 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2020-12-23 11:29:50,308 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2020-12-23 11:29:50,668 WARN L197 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2020-12-23 11:29:50,827 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 23 [2020-12-23 11:29:51,253 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 23 [2020-12-23 11:30:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:30:25,523 INFO L93 Difference]: Finished difference Result 243468 states and 364747 transitions. [2020-12-23 11:30:25,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-23 11:30:25,524 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 176 [2020-12-23 11:30:25,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:30:26,149 INFO L225 Difference]: With dead ends: 243468 [2020-12-23 11:30:26,149 INFO L226 Difference]: Without dead ends: 220350 [2020-12-23 11:30:26,211 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=319, Invalid=1087, Unknown=0, NotChecked=0, Total=1406 [2020-12-23 11:30:26,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220350 states. [2020-12-23 11:30:36,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220350 to 49657. [2020-12-23 11:30:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49657 states. [2020-12-23 11:30:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49657 states to 49657 states and 72958 transitions. [2020-12-23 11:30:36,691 INFO L78 Accepts]: Start accepts. Automaton has 49657 states and 72958 transitions. Word has length 176 [2020-12-23 11:30:36,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:30:36,692 INFO L481 AbstractCegarLoop]: Abstraction has 49657 states and 72958 transitions. [2020-12-23 11:30:36,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-23 11:30:36,692 INFO L276 IsEmpty]: Start isEmpty. Operand 49657 states and 72958 transitions. [2020-12-23 11:30:36,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-23 11:30:36,701 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:30:36,702 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, 1, 1, 1, 1] [2020-12-23 11:30:36,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 11:30:36,702 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:30:36,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:30:36,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1933329014, now seen corresponding path program 1 times [2020-12-23 11:30:36,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:30:36,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086886752] [2020-12-23 11:30:36,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:30:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:30:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:30:36,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086886752] [2020-12-23 11:30:36,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:30:36,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:30:36,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605026] [2020-12-23 11:30:36,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:30:36,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:30:36,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:30:36,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:30:36,837 INFO L87 Difference]: Start difference. First operand 49657 states and 72958 transitions. Second operand 4 states. [2020-12-23 11:30:50,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:30:50,972 INFO L93 Difference]: Finished difference Result 107400 states and 160368 transitions. [2020-12-23 11:30:50,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:30:50,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2020-12-23 11:30:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:30:51,075 INFO L225 Difference]: With dead ends: 107400 [2020-12-23 11:30:51,075 INFO L226 Difference]: Without dead ends: 77895 [2020-12-23 11:30:51,101 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 [2020-12-23 11:30:51,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77895 states. [2020-12-23 11:31:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77895 to 49228. [2020-12-23 11:31:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49228 states. [2020-12-23 11:31:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49228 states to 49228 states and 72461 transitions. [2020-12-23 11:31:00,243 INFO L78 Accepts]: Start accepts. Automaton has 49228 states and 72461 transitions. Word has length 176 [2020-12-23 11:31:00,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:31:00,243 INFO L481 AbstractCegarLoop]: Abstraction has 49228 states and 72461 transitions. [2020-12-23 11:31:00,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:31:00,244 INFO L276 IsEmpty]: Start isEmpty. Operand 49228 states and 72461 transitions. [2020-12-23 11:31:00,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-23 11:31:00,252 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:31:00,252 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, 1, 1, 1, 1] [2020-12-23 11:31:00,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 11:31:00,252 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:31:00,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:31:00,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1161890815, now seen corresponding path program 1 times [2020-12-23 11:31:00,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:31:00,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540040305] [2020-12-23 11:31:00,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:31:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:31:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:31:00,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540040305] [2020-12-23 11:31:00,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:31:00,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:31:00,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868370792] [2020-12-23 11:31:00,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:31:00,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:31:00,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:31:00,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:31:00,402 INFO L87 Difference]: Start difference. First operand 49228 states and 72461 transitions. Second operand 4 states. [2020-12-23 11:31:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:31:18,132 INFO L93 Difference]: Finished difference Result 139577 states and 208150 transitions. [2020-12-23 11:31:18,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:31:18,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2020-12-23 11:31:18,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:31:18,288 INFO L225 Difference]: With dead ends: 139577 [2020-12-23 11:31:18,288 INFO L226 Difference]: Without dead ends: 96179 [2020-12-23 11:31:18,329 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 [2020-12-23 11:31:18,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96179 states. [2020-12-23 11:31:35,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96179 to 96177. [2020-12-23 11:31:35,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96177 states. [2020-12-23 11:31:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96177 states to 96177 states and 142040 transitions. [2020-12-23 11:31:36,140 INFO L78 Accepts]: Start accepts. Automaton has 96177 states and 142040 transitions. Word has length 176 [2020-12-23 11:31:36,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:31:36,140 INFO L481 AbstractCegarLoop]: Abstraction has 96177 states and 142040 transitions. [2020-12-23 11:31:36,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:31:36,141 INFO L276 IsEmpty]: Start isEmpty. Operand 96177 states and 142040 transitions. [2020-12-23 11:31:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-23 11:31:36,153 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:31:36,153 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, 1, 1, 1, 1] [2020-12-23 11:31:36,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 11:31:36,154 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:31:36,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:31:36,154 INFO L82 PathProgramCache]: Analyzing trace with hash -10538342, now seen corresponding path program 1 times [2020-12-23 11:31:36,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:31:36,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899660655] [2020-12-23 11:31:36,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:31:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:31:36,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:31:36,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899660655] [2020-12-23 11:31:36,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:31:36,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:31:36,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228751002] [2020-12-23 11:31:36,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:31:36,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:31:36,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:31:36,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:31:36,481 INFO L87 Difference]: Start difference. First operand 96177 states and 142040 transitions. Second operand 4 states.