/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 10:04:44,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 10:04:44,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 10:04:44,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 10:04:44,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 10:04:44,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 10:04:44,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 10:04:44,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 10:04:44,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 10:04:44,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 10:04:44,816 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 10:04:44,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 10:04:44,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 10:04:44,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 10:04:44,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 10:04:44,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 10:04:44,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 10:04:44,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 10:04:44,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 10:04:44,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 10:04:44,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 10:04:44,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 10:04:44,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 10:04:44,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 10:04:44,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 10:04:44,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 10:04:44,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 10:04:44,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 10:04:44,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 10:04:44,844 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 10:04:44,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 10:04:44,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 10:04:44,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 10:04:44,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 10:04:44,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 10:04:44,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 10:04:44,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 10:04:44,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 10:04:44,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 10:04:44,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 10:04:44,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 10:04:44,864 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 10:04:44,892 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 10:04:44,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 10:04:44,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 10:04:44,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 10:04:44,894 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 10:04:44,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 10:04:44,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 10:04:44,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 10:04:44,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 10:04:44,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 10:04:44,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 10:04:44,897 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 10:04:44,897 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 10:04:44,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 10:04:44,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 10:04:44,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 10:04:44,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 10:04:44,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 10:04:44,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 10:04:44,899 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 10:04:44,899 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 10:04:44,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 10:04:44,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 10:04:44,900 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 10:04:44,901 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 10:04:44,901 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 10:04:45,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 10:04:45,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 10:04:45,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 10:04:45,338 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 10:04:45,339 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 10:04:45,340 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c [2020-12-23 10:04:45,429 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8c96c7306/967278f716164df38cc4bcfa2c3afb2d/FLAGaa5797822 [2020-12-23 10:04:46,106 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 10:04:46,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c [2020-12-23 10:04:46,123 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8c96c7306/967278f716164df38cc4bcfa2c3afb2d/FLAGaa5797822 [2020-12-23 10:04:46,404 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8c96c7306/967278f716164df38cc4bcfa2c3afb2d [2020-12-23 10:04:46,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 10:04:46,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 10:04:46,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 10:04:46,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 10:04:46,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 10:04:46,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:04:46" (1/1) ... [2020-12-23 10:04:46,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ed48f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:04:46, skipping insertion in model container [2020-12-23 10:04:46,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:04:46" (1/1) ... [2020-12-23 10:04:46,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 10:04:46,506 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p41_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p14_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p42_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p24_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p43_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p34_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~3,] left hand side expression in assignment: lhs: VariableLHS[~r4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p14_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~3,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p24_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~3,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p34_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~3,] left hand side expression in assignment: lhs: VariableLHS[~newmax4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p41_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p42_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p43_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r121~0,] left hand side expression in assignment: lhs: VariableLHS[~r131~0,] left hand side expression in assignment: lhs: VariableLHS[~r141~0,] left hand side expression in assignment: lhs: VariableLHS[~r211~0,] left hand side expression in assignment: lhs: VariableLHS[~r231~0,] left hand side expression in assignment: lhs: VariableLHS[~r241~0,] left hand side expression in assignment: lhs: VariableLHS[~r311~0,] left hand side expression in assignment: lhs: VariableLHS[~r321~0,] left hand side expression in assignment: lhs: VariableLHS[~r341~0,] left hand side expression in assignment: lhs: VariableLHS[~r411~0,] left hand side expression in assignment: lhs: VariableLHS[~r421~0,] left hand side expression in assignment: lhs: VariableLHS[~r431~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~r122~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~r132~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~r142~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~r212~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r232~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~r242~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~r312~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~r322~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~r342~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~r412~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~r422~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~r432~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~r123~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~r133~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~r143~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___14~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___14~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___14~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___14~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___14~0,] left hand side expression in assignment: lhs: VariableLHS[~r213~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___15~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___15~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___15~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___15~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___15~0,] left hand side expression in assignment: lhs: VariableLHS[~r233~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___16~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___16~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___16~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___16~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___16~0,] left hand side expression in assignment: lhs: VariableLHS[~r243~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___17~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___17~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___17~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___17~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___17~0,] left hand side expression in assignment: lhs: VariableLHS[~r313~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___18~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___18~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___18~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___18~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___18~0,] left hand side expression in assignment: lhs: VariableLHS[~r323~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___19~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___19~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___19~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___19~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___19~0,] left hand side expression in assignment: lhs: VariableLHS[~r343~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___20~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___20~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___20~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___20~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___20~0,] left hand side expression in assignment: lhs: VariableLHS[~r413~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___21~0,] left hand side expression in assignment: lhs: VariableLHS[~r423~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___22~0,] left hand side expression in assignment: lhs: VariableLHS[~r433~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep14~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[~ep24~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[~ep34~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep41~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep42~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep43~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[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p14_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p14_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[~p24_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p24_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[~p34_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p34_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p41_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p41_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p42_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p42_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p43_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p43_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p14_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p14_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[~p24_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p24_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[~p34_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p34_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p41_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p41_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p42_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p42_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p43_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p43_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2020-12-23 10:04:46,898 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c[26792,26805] [2020-12-23 10:04:46,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 10:04:46,915 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p41_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p14_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p42_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p24_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p43_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p34_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~3,] left hand side expression in assignment: lhs: VariableLHS[~r4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p14_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~3,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p24_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~3,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p34_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~3,] left hand side expression in assignment: lhs: VariableLHS[~newmax4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p41_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p42_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p43_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r121~0,] left hand side expression in assignment: lhs: VariableLHS[~r131~0,] left hand side expression in assignment: lhs: VariableLHS[~r141~0,] left hand side expression in assignment: lhs: VariableLHS[~r211~0,] left hand side expression in assignment: lhs: VariableLHS[~r231~0,] left hand side expression in assignment: lhs: VariableLHS[~r241~0,] left hand side expression in assignment: lhs: VariableLHS[~r311~0,] left hand side expression in assignment: lhs: VariableLHS[~r321~0,] left hand side expression in assignment: lhs: VariableLHS[~r341~0,] left hand side expression in assignment: lhs: VariableLHS[~r411~0,] left hand side expression in assignment: lhs: VariableLHS[~r421~0,] left hand side expression in assignment: lhs: VariableLHS[~r431~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~r122~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~r132~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~r142~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~r212~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r232~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~r242~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~r312~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~r322~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~r342~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~r412~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~r422~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~r432~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~r123~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~r133~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~r143~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___14~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___14~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___14~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___14~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___14~0,] left hand side expression in assignment: lhs: VariableLHS[~r213~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___15~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___15~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___15~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___15~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___15~0,] left hand side expression in assignment: lhs: VariableLHS[~r233~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___16~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___16~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___16~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___16~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___16~0,] left hand side expression in assignment: lhs: VariableLHS[~r243~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___17~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___17~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___17~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___17~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___17~0,] left hand side expression in assignment: lhs: VariableLHS[~r313~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___18~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___18~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___18~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___18~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___18~0,] left hand side expression in assignment: lhs: VariableLHS[~r323~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___19~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___19~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___19~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___19~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___19~0,] left hand side expression in assignment: lhs: VariableLHS[~r343~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___20~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___20~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___20~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___20~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___20~0,] left hand side expression in assignment: lhs: VariableLHS[~r413~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___21~0,] left hand side expression in assignment: lhs: VariableLHS[~r423~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___22~0,] left hand side expression in assignment: lhs: VariableLHS[~r433~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep14~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[~ep24~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[~ep34~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep41~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep42~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep43~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[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p14_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p14_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[~p24_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p24_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[~p34_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p34_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p41_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p41_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p42_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p42_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p43_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p43_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p14_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p14_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[~p24_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p24_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[~p34_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p34_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p41_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p41_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p42_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p42_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p43_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p43_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2020-12-23 10:04:47,061 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c[26792,26805] [2020-12-23 10:04:47,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 10:04:47,096 INFO L208 MainTranslator]: Completed translation [2020-12-23 10:04:47,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:04:47 WrapperNode [2020-12-23 10:04:47,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 10:04:47,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 10:04:47,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 10:04:47,100 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 10:04:47,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:04:47" (1/1) ... [2020-12-23 10:04:47,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:04:47" (1/1) ... [2020-12-23 10:04:47,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 10:04:47,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 10:04:47,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 10:04:47,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 10:04:47,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:04:47" (1/1) ... [2020-12-23 10:04:47,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:04:47" (1/1) ... [2020-12-23 10:04:47,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:04:47" (1/1) ... [2020-12-23 10:04:47,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:04:47" (1/1) ... [2020-12-23 10:04:47,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:04:47" (1/1) ... [2020-12-23 10:04:47,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:04:47" (1/1) ... [2020-12-23 10:04:47,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:04:47" (1/1) ... [2020-12-23 10:04:47,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 10:04:47,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 10:04:47,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 10:04:47,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 10:04:47,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:04:47" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 10:04:47,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 10:04:47,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 10:04:47,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 10:04:47,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 10:04:48,999 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 10:04:48,999 INFO L299 CfgBuilder]: Removed 21 assume(true) statements. [2020-12-23 10:04:49,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:04:49 BoogieIcfgContainer [2020-12-23 10:04:49,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 10:04:49,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 10:04:49,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 10:04:49,007 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 10:04:49,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 10:04:46" (1/3) ... [2020-12-23 10:04:49,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9613ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:04:49, skipping insertion in model container [2020-12-23 10:04:49,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:04:47" (2/3) ... [2020-12-23 10:04:49,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9613ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:04:49, skipping insertion in model container [2020-12-23 10:04:49,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:04:49" (3/3) ... [2020-12-23 10:04:49,011 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c [2020-12-23 10:04:49,018 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 10:04:49,024 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 10:04:49,044 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 10:04:49,074 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 10:04:49,075 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 10:04:49,075 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 10:04:49,075 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 10:04:49,075 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 10:04:49,075 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 10:04:49,076 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 10:04:49,076 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 10:04:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states. [2020-12-23 10:04:49,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 10:04:49,114 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:49,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:04:49,116 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:49,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:49,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1302956056, now seen corresponding path program 1 times [2020-12-23 10:04:49,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:49,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012410999] [2020-12-23 10:04:49,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:49,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 10:04:49,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012410999] [2020-12-23 10:04:49,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:49,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 10:04:49,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812731339] [2020-12-23 10:04:49,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 10:04:49,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:49,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 10:04:49,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 10:04:49,585 INFO L87 Difference]: Start difference. First operand 319 states. Second operand 2 states. [2020-12-23 10:04:49,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:49,641 INFO L93 Difference]: Finished difference Result 451 states and 797 transitions. [2020-12-23 10:04:49,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 10:04:49,643 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 77 [2020-12-23 10:04:49,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:49,660 INFO L225 Difference]: With dead ends: 451 [2020-12-23 10:04:49,660 INFO L226 Difference]: Without dead ends: 315 [2020-12-23 10:04:49,664 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 10:04:49,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-12-23 10:04:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2020-12-23 10:04:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-12-23 10:04:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 562 transitions. [2020-12-23 10:04:49,755 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 562 transitions. Word has length 77 [2020-12-23 10:04:49,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:49,758 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 562 transitions. [2020-12-23 10:04:49,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 10:04:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 562 transitions. [2020-12-23 10:04:49,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 10:04:49,763 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:49,763 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] [2020-12-23 10:04:49,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 10:04:49,764 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:49,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:49,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1436969562, now seen corresponding path program 1 times [2020-12-23 10:04:49,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:49,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066735892] [2020-12-23 10:04:49,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:04:49,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066735892] [2020-12-23 10:04:49,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:49,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:04:49,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115026247] [2020-12-23 10:04:49,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 10:04:49,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:49,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 10:04:49,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:04:49,988 INFO L87 Difference]: Start difference. First operand 315 states and 562 transitions. Second operand 5 states. [2020-12-23 10:04:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:50,142 INFO L93 Difference]: Finished difference Result 450 states and 790 transitions. [2020-12-23 10:04:50,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 10:04:50,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-12-23 10:04:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:50,151 INFO L225 Difference]: With dead ends: 450 [2020-12-23 10:04:50,151 INFO L226 Difference]: Without dead ends: 315 [2020-12-23 10:04:50,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 10:04:50,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-12-23 10:04:50,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2020-12-23 10:04:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-12-23 10:04:50,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 528 transitions. [2020-12-23 10:04:50,190 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 528 transitions. Word has length 77 [2020-12-23 10:04:50,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:50,192 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 528 transitions. [2020-12-23 10:04:50,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 10:04:50,193 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 528 transitions. [2020-12-23 10:04:50,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-23 10:04:50,200 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:50,201 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] [2020-12-23 10:04:50,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 10:04:50,202 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:50,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:50,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1445636690, now seen corresponding path program 1 times [2020-12-23 10:04:50,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:50,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641705956] [2020-12-23 10:04:50,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:04:50,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641705956] [2020-12-23 10:04:50,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:50,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:04:50,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340247566] [2020-12-23 10:04:50,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:04:50,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:50,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:04:50,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:04:50,432 INFO L87 Difference]: Start difference. First operand 315 states and 528 transitions. Second operand 3 states. [2020-12-23 10:04:50,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:50,522 INFO L93 Difference]: Finished difference Result 565 states and 954 transitions. [2020-12-23 10:04:50,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:04:50,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2020-12-23 10:04:50,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:50,526 INFO L225 Difference]: With dead ends: 565 [2020-12-23 10:04:50,526 INFO L226 Difference]: Without dead ends: 434 [2020-12-23 10:04:50,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:04:50,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-12-23 10:04:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2020-12-23 10:04:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-12-23 10:04:50,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 722 transitions. [2020-12-23 10:04:50,550 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 722 transitions. Word has length 110 [2020-12-23 10:04:50,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:50,551 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 722 transitions. [2020-12-23 10:04:50,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:04:50,551 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 722 transitions. [2020-12-23 10:04:50,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-23 10:04:50,555 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:50,556 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:04:50,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 10:04:50,556 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:50,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:50,557 INFO L82 PathProgramCache]: Analyzing trace with hash -880032262, now seen corresponding path program 1 times [2020-12-23 10:04:50,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:50,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534264758] [2020-12-23 10:04:50,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:04:50,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534264758] [2020-12-23 10:04:50,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:50,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:04:50,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373177628] [2020-12-23 10:04:50,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:04:50,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:50,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:04:50,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:04:50,737 INFO L87 Difference]: Start difference. First operand 431 states and 722 transitions. Second operand 3 states. [2020-12-23 10:04:50,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:50,794 INFO L93 Difference]: Finished difference Result 905 states and 1522 transitions. [2020-12-23 10:04:50,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:04:50,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2020-12-23 10:04:50,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:50,802 INFO L225 Difference]: With dead ends: 905 [2020-12-23 10:04:50,802 INFO L226 Difference]: Without dead ends: 658 [2020-12-23 10:04:50,804 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:04:50,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-12-23 10:04:50,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 654. [2020-12-23 10:04:50,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2020-12-23 10:04:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1097 transitions. [2020-12-23 10:04:50,853 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1097 transitions. Word has length 113 [2020-12-23 10:04:50,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:50,854 INFO L481 AbstractCegarLoop]: Abstraction has 654 states and 1097 transitions. [2020-12-23 10:04:50,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:04:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1097 transitions. [2020-12-23 10:04:50,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 10:04:50,858 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:50,858 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] [2020-12-23 10:04:50,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 10:04:50,858 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:50,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:50,859 INFO L82 PathProgramCache]: Analyzing trace with hash 164082803, now seen corresponding path program 1 times [2020-12-23 10:04:50,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:50,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774918031] [2020-12-23 10:04:50,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:04:51,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774918031] [2020-12-23 10:04:51,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:51,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:04:51,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577937666] [2020-12-23 10:04:51,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:04:51,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:51,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:04:51,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:04:51,040 INFO L87 Difference]: Start difference. First operand 654 states and 1097 transitions. Second operand 3 states. [2020-12-23 10:04:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:51,103 INFO L93 Difference]: Finished difference Result 1554 states and 2611 transitions. [2020-12-23 10:04:51,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:04:51,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-12-23 10:04:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:51,111 INFO L225 Difference]: With dead ends: 1554 [2020-12-23 10:04:51,111 INFO L226 Difference]: Without dead ends: 1084 [2020-12-23 10:04:51,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:04:51,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2020-12-23 10:04:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1078. [2020-12-23 10:04:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2020-12-23 10:04:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1805 transitions. [2020-12-23 10:04:51,149 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1805 transitions. Word has length 116 [2020-12-23 10:04:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:51,149 INFO L481 AbstractCegarLoop]: Abstraction has 1078 states and 1805 transitions. [2020-12-23 10:04:51,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:04:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1805 transitions. [2020-12-23 10:04:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-12-23 10:04:51,152 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:51,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:04:51,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 10:04:51,153 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:51,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:51,153 INFO L82 PathProgramCache]: Analyzing trace with hash 725306107, now seen corresponding path program 1 times [2020-12-23 10:04:51,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:51,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949090450] [2020-12-23 10:04:51,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:04:51,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949090450] [2020-12-23 10:04:51,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:51,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:04:51,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953479901] [2020-12-23 10:04:51,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:04:51,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:51,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:04:51,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:04:51,310 INFO L87 Difference]: Start difference. First operand 1078 states and 1805 transitions. Second operand 3 states. [2020-12-23 10:04:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:51,377 INFO L93 Difference]: Finished difference Result 2786 states and 4663 transitions. [2020-12-23 10:04:51,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:04:51,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2020-12-23 10:04:51,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:51,388 INFO L225 Difference]: With dead ends: 2786 [2020-12-23 10:04:51,388 INFO L226 Difference]: Without dead ends: 1892 [2020-12-23 10:04:51,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:04:51,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2020-12-23 10:04:51,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1882. [2020-12-23 10:04:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1882 states. [2020-12-23 10:04:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 3137 transitions. [2020-12-23 10:04:51,541 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 3137 transitions. Word has length 119 [2020-12-23 10:04:51,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:51,541 INFO L481 AbstractCegarLoop]: Abstraction has 1882 states and 3137 transitions. [2020-12-23 10:04:51,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:04:51,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 3137 transitions. [2020-12-23 10:04:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-12-23 10:04:51,546 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:51,547 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] [2020-12-23 10:04:51,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 10:04:51,547 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:51,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1859517548, now seen corresponding path program 1 times [2020-12-23 10:04:51,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:51,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883059018] [2020-12-23 10:04:51,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:04:51,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883059018] [2020-12-23 10:04:51,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:51,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 10:04:51,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364295014] [2020-12-23 10:04:51,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 10:04:51,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:51,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 10:04:51,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 10:04:51,901 INFO L87 Difference]: Start difference. First operand 1882 states and 3137 transitions. Second operand 6 states. [2020-12-23 10:04:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:52,275 INFO L93 Difference]: Finished difference Result 7592 states and 12730 transitions. [2020-12-23 10:04:52,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 10:04:52,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2020-12-23 10:04:52,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:52,312 INFO L225 Difference]: With dead ends: 7592 [2020-12-23 10:04:52,312 INFO L226 Difference]: Without dead ends: 5894 [2020-12-23 10:04:52,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 10:04:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5894 states. [2020-12-23 10:04:52,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5894 to 3495. [2020-12-23 10:04:52,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3495 states. [2020-12-23 10:04:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 5814 transitions. [2020-12-23 10:04:52,505 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 5814 transitions. Word has length 122 [2020-12-23 10:04:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:52,505 INFO L481 AbstractCegarLoop]: Abstraction has 3495 states and 5814 transitions. [2020-12-23 10:04:52,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 10:04:52,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 5814 transitions. [2020-12-23 10:04:52,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-12-23 10:04:52,510 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:52,510 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] [2020-12-23 10:04:52,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 10:04:52,511 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:52,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:52,511 INFO L82 PathProgramCache]: Analyzing trace with hash 389891547, now seen corresponding path program 1 times [2020-12-23 10:04:52,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:52,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262687983] [2020-12-23 10:04:52,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:04:52,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262687983] [2020-12-23 10:04:52,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:52,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:04:52,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322309877] [2020-12-23 10:04:52,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:04:52,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:52,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:04:52,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:04:52,671 INFO L87 Difference]: Start difference. First operand 3495 states and 5814 transitions. Second operand 4 states. [2020-12-23 10:04:52,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:52,958 INFO L93 Difference]: Finished difference Result 9414 states and 15746 transitions. [2020-12-23 10:04:52,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:04:52,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2020-12-23 10:04:52,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:53,007 INFO L225 Difference]: With dead ends: 9414 [2020-12-23 10:04:53,007 INFO L226 Difference]: Without dead ends: 6103 [2020-12-23 10:04:53,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 10:04:53,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6103 states. [2020-12-23 10:04:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6103 to 5184. [2020-12-23 10:04:53,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5184 states. [2020-12-23 10:04:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 8642 transitions. [2020-12-23 10:04:53,390 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 8642 transitions. Word has length 123 [2020-12-23 10:04:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:53,390 INFO L481 AbstractCegarLoop]: Abstraction has 5184 states and 8642 transitions. [2020-12-23 10:04:53,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:04:53,391 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 8642 transitions. [2020-12-23 10:04:53,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-23 10:04:53,397 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:53,398 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] [2020-12-23 10:04:53,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 10:04:53,398 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:53,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:53,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1571101099, now seen corresponding path program 1 times [2020-12-23 10:04:53,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:53,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679556117] [2020-12-23 10:04:53,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:04:53,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679556117] [2020-12-23 10:04:53,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:53,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:04:53,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976814045] [2020-12-23 10:04:53,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:04:53,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:53,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:04:53,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:04:53,595 INFO L87 Difference]: Start difference. First operand 5184 states and 8642 transitions. Second operand 4 states. [2020-12-23 10:04:53,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:53,916 INFO L93 Difference]: Finished difference Result 14068 states and 23509 transitions. [2020-12-23 10:04:53,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:04:53,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2020-12-23 10:04:53,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:53,973 INFO L225 Difference]: With dead ends: 14068 [2020-12-23 10:04:53,973 INFO L226 Difference]: Without dead ends: 9068 [2020-12-23 10:04:53,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 10:04:53,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9068 states. [2020-12-23 10:04:54,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9068 to 7682. [2020-12-23 10:04:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7682 states. [2020-12-23 10:04:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7682 states to 7682 states and 12789 transitions. [2020-12-23 10:04:54,380 INFO L78 Accepts]: Start accepts. Automaton has 7682 states and 12789 transitions. Word has length 124 [2020-12-23 10:04:54,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:54,381 INFO L481 AbstractCegarLoop]: Abstraction has 7682 states and 12789 transitions. [2020-12-23 10:04:54,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:04:54,381 INFO L276 IsEmpty]: Start isEmpty. Operand 7682 states and 12789 transitions. [2020-12-23 10:04:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-12-23 10:04:54,387 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:54,387 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] [2020-12-23 10:04:54,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 10:04:54,388 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:54,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:54,388 INFO L82 PathProgramCache]: Analyzing trace with hash -297104110, now seen corresponding path program 1 times [2020-12-23 10:04:54,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:54,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100286669] [2020-12-23 10:04:54,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:04:54,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100286669] [2020-12-23 10:04:54,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:54,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:04:54,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037250457] [2020-12-23 10:04:54,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:04:54,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:54,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:04:54,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:04:54,515 INFO L87 Difference]: Start difference. First operand 7682 states and 12789 transitions. Second operand 4 states. [2020-12-23 10:04:54,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:54,898 INFO L93 Difference]: Finished difference Result 20545 states and 34293 transitions. [2020-12-23 10:04:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:04:54,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2020-12-23 10:04:54,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:54,952 INFO L225 Difference]: With dead ends: 20545 [2020-12-23 10:04:54,952 INFO L226 Difference]: Without dead ends: 13047 [2020-12-23 10:04:54,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 10:04:54,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13047 states. [2020-12-23 10:04:55,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13047 to 11364. [2020-12-23 10:04:55,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11364 states. [2020-12-23 10:04:55,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11364 states to 11364 states and 18893 transitions. [2020-12-23 10:04:55,511 INFO L78 Accepts]: Start accepts. Automaton has 11364 states and 18893 transitions. Word has length 125 [2020-12-23 10:04:55,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:55,512 INFO L481 AbstractCegarLoop]: Abstraction has 11364 states and 18893 transitions. [2020-12-23 10:04:55,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:04:55,512 INFO L276 IsEmpty]: Start isEmpty. Operand 11364 states and 18893 transitions. [2020-12-23 10:04:55,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-12-23 10:04:55,518 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:55,518 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] [2020-12-23 10:04:55,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 10:04:55,518 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:55,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:55,519 INFO L82 PathProgramCache]: Analyzing trace with hash 353038505, now seen corresponding path program 1 times [2020-12-23 10:04:55,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:55,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570811567] [2020-12-23 10:04:55,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:04:55,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570811567] [2020-12-23 10:04:55,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:55,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:04:55,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394700709] [2020-12-23 10:04:55,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:04:55,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:55,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:04:55,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:04:55,681 INFO L87 Difference]: Start difference. First operand 11364 states and 18893 transitions. Second operand 3 states. [2020-12-23 10:04:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:56,104 INFO L93 Difference]: Finished difference Result 25355 states and 42351 transitions. [2020-12-23 10:04:56,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:04:56,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2020-12-23 10:04:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:56,150 INFO L225 Difference]: With dead ends: 25355 [2020-12-23 10:04:56,151 INFO L226 Difference]: Without dead ends: 17492 [2020-12-23 10:04:56,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:04:56,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17492 states. [2020-12-23 10:04:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17492 to 17490. [2020-12-23 10:04:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17490 states. [2020-12-23 10:04:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17490 states to 17490 states and 29055 transitions. [2020-12-23 10:04:56,908 INFO L78 Accepts]: Start accepts. Automaton has 17490 states and 29055 transitions. Word has length 126 [2020-12-23 10:04:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:56,908 INFO L481 AbstractCegarLoop]: Abstraction has 17490 states and 29055 transitions. [2020-12-23 10:04:56,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:04:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 17490 states and 29055 transitions. [2020-12-23 10:04:56,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-12-23 10:04:56,912 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:56,912 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] [2020-12-23 10:04:56,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 10:04:56,912 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:56,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:56,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2087080898, now seen corresponding path program 1 times [2020-12-23 10:04:56,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:56,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334436661] [2020-12-23 10:04:56,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:04:57,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334436661] [2020-12-23 10:04:57,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:57,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:04:57,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35339999] [2020-12-23 10:04:57,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:04:57,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:57,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:04:57,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:04:57,024 INFO L87 Difference]: Start difference. First operand 17490 states and 29055 transitions. Second operand 4 states. [2020-12-23 10:04:57,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:57,791 INFO L93 Difference]: Finished difference Result 48107 states and 80122 transitions. [2020-12-23 10:04:57,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:04:57,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2020-12-23 10:04:57,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:57,873 INFO L225 Difference]: With dead ends: 48107 [2020-12-23 10:04:57,873 INFO L226 Difference]: Without dead ends: 30803 [2020-12-23 10:04:57,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 10:04:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30803 states. [2020-12-23 10:04:58,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30803 to 25870. [2020-12-23 10:04:58,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25870 states. [2020-12-23 10:04:58,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25870 states to 25870 states and 42908 transitions. [2020-12-23 10:04:58,848 INFO L78 Accepts]: Start accepts. Automaton has 25870 states and 42908 transitions. Word has length 126 [2020-12-23 10:04:58,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:58,852 INFO L481 AbstractCegarLoop]: Abstraction has 25870 states and 42908 transitions. [2020-12-23 10:04:58,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:04:58,853 INFO L276 IsEmpty]: Start isEmpty. Operand 25870 states and 42908 transitions. [2020-12-23 10:04:58,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-12-23 10:04:58,856 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:58,858 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] [2020-12-23 10:04:58,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 10:04:58,858 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:58,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:58,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1488761057, now seen corresponding path program 1 times [2020-12-23 10:04:58,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:58,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725200003] [2020-12-23 10:04:58,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:58,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:04:58,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725200003] [2020-12-23 10:04:58,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:58,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:04:58,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580033764] [2020-12-23 10:04:58,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:04:58,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:58,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:04:58,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:04:58,973 INFO L87 Difference]: Start difference. First operand 25870 states and 42908 transitions. Second operand 3 states. [2020-12-23 10:05:00,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:05:00,064 INFO L93 Difference]: Finished difference Result 57952 states and 96127 transitions. [2020-12-23 10:05:00,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:05:00,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2020-12-23 10:05:00,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:05:00,158 INFO L225 Difference]: With dead ends: 57952 [2020-12-23 10:05:00,158 INFO L226 Difference]: Without dead ends: 39854 [2020-12-23 10:05:00,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:05:00,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39854 states. [2020-12-23 10:05:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39854 to 39852. [2020-12-23 10:05:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39852 states. [2020-12-23 10:05:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39852 states to 39852 states and 65777 transitions. [2020-12-23 10:05:01,726 INFO L78 Accepts]: Start accepts. Automaton has 39852 states and 65777 transitions. Word has length 126 [2020-12-23 10:05:01,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:05:01,727 INFO L481 AbstractCegarLoop]: Abstraction has 39852 states and 65777 transitions. [2020-12-23 10:05:01,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:05:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 39852 states and 65777 transitions. [2020-12-23 10:05:01,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-12-23 10:05:01,729 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:05:01,729 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] [2020-12-23 10:05:01,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 10:05:01,730 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:05:01,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:05:01,730 INFO L82 PathProgramCache]: Analyzing trace with hash 814940521, now seen corresponding path program 1 times [2020-12-23 10:05:01,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:05:01,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471522670] [2020-12-23 10:05:01,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:05:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:05:01,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:05:01,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471522670] [2020-12-23 10:05:01,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:05:01,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:05:01,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769026629] [2020-12-23 10:05:01,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:05:01,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:05:01,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:05:01,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:05:01,821 INFO L87 Difference]: Start difference. First operand 39852 states and 65777 transitions. Second operand 3 states. [2020-12-23 10:05:03,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:05:03,239 INFO L93 Difference]: Finished difference Result 88300 states and 145787 transitions. [2020-12-23 10:05:03,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:05:03,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2020-12-23 10:05:03,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:05:03,441 INFO L225 Difference]: With dead ends: 88300 [2020-12-23 10:05:03,441 INFO L226 Difference]: Without dead ends: 60402 [2020-12-23 10:05:03,491 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:05:03,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60402 states. [2020-12-23 10:05:05,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60402 to 60400. [2020-12-23 10:05:05,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60400 states. [2020-12-23 10:05:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60400 states to 60400 states and 99176 transitions. [2020-12-23 10:05:05,582 INFO L78 Accepts]: Start accepts. Automaton has 60400 states and 99176 transitions. Word has length 126 [2020-12-23 10:05:05,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:05:05,582 INFO L481 AbstractCegarLoop]: Abstraction has 60400 states and 99176 transitions. [2020-12-23 10:05:05,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:05:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 60400 states and 99176 transitions. [2020-12-23 10:05:05,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-12-23 10:05:05,585 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:05:05,585 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] [2020-12-23 10:05:05,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 10:05:05,585 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:05:05,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:05:05,586 INFO L82 PathProgramCache]: Analyzing trace with hash -122812449, now seen corresponding path program 1 times [2020-12-23 10:05:05,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:05:05,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330357095] [2020-12-23 10:05:05,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:05:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:05:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:05:05,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330357095] [2020-12-23 10:05:05,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:05:05,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:05:05,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87358772] [2020-12-23 10:05:05,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:05:05,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:05:05,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:05:05,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:05:05,686 INFO L87 Difference]: Start difference. First operand 60400 states and 99176 transitions. Second operand 3 states. [2020-12-23 10:05:07,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:05:07,356 INFO L93 Difference]: Finished difference Result 133205 states and 218691 transitions. [2020-12-23 10:05:07,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:05:07,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2020-12-23 10:05:07,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:05:07,552 INFO L225 Difference]: With dead ends: 133205 [2020-12-23 10:05:07,553 INFO L226 Difference]: Without dead ends: 90697 [2020-12-23 10:05:07,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:05:07,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90697 states. [2020-12-23 10:05:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90697 to 90695. [2020-12-23 10:05:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90695 states. [2020-12-23 10:05:10,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90695 states to 90695 states and 147936 transitions. [2020-12-23 10:05:10,195 INFO L78 Accepts]: Start accepts. Automaton has 90695 states and 147936 transitions. Word has length 126 [2020-12-23 10:05:10,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:05:10,195 INFO L481 AbstractCegarLoop]: Abstraction has 90695 states and 147936 transitions. [2020-12-23 10:05:10,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:05:10,195 INFO L276 IsEmpty]: Start isEmpty. Operand 90695 states and 147936 transitions. [2020-12-23 10:05:10,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-23 10:05:10,197 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:05:10,197 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] [2020-12-23 10:05:10,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 10:05:10,197 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:05:10,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:05:10,198 INFO L82 PathProgramCache]: Analyzing trace with hash 2013833626, now seen corresponding path program 1 times [2020-12-23 10:05:10,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:05:10,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642309420] [2020-12-23 10:05:10,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:05:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:05:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:05:10,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642309420] [2020-12-23 10:05:10,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:05:10,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 10:05:10,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550007422] [2020-12-23 10:05:10,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 10:05:10,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:05:10,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 10:05:10,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 10:05:10,477 INFO L87 Difference]: Start difference. First operand 90695 states and 147936 transitions. Second operand 6 states. [2020-12-23 10:05:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:05:13,870 INFO L93 Difference]: Finished difference Result 235464 states and 385823 transitions. [2020-12-23 10:05:13,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 10:05:13,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2020-12-23 10:05:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:05:14,113 INFO L225 Difference]: With dead ends: 235464 [2020-12-23 10:05:14,113 INFO L226 Difference]: Without dead ends: 145003 [2020-12-23 10:05:14,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 10:05:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145003 states. [2020-12-23 10:05:17,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145003 to 90695. [2020-12-23 10:05:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90695 states. [2020-12-23 10:05:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90695 states to 90695 states and 147311 transitions. [2020-12-23 10:05:17,182 INFO L78 Accepts]: Start accepts. Automaton has 90695 states and 147311 transitions. Word has length 128 [2020-12-23 10:05:17,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:05:17,182 INFO L481 AbstractCegarLoop]: Abstraction has 90695 states and 147311 transitions. [2020-12-23 10:05:17,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 10:05:17,183 INFO L276 IsEmpty]: Start isEmpty. Operand 90695 states and 147311 transitions. [2020-12-23 10:05:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-23 10:05:17,189 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:05:17,189 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] [2020-12-23 10:05:17,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 10:05:17,189 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:05:17,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:05:17,190 INFO L82 PathProgramCache]: Analyzing trace with hash 967069717, now seen corresponding path program 1 times [2020-12-23 10:05:17,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:05:17,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555087926] [2020-12-23 10:05:17,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:05:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:05:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:05:17,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555087926] [2020-12-23 10:05:17,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:05:17,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 10:05:17,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033966950] [2020-12-23 10:05:17,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 10:05:17,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:05:17,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 10:05:17,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 10:05:17,450 INFO L87 Difference]: Start difference. First operand 90695 states and 147311 transitions. Second operand 6 states. [2020-12-23 10:05:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:05:21,701 INFO L93 Difference]: Finished difference Result 283676 states and 463349 transitions. [2020-12-23 10:05:21,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 10:05:21,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2020-12-23 10:05:21,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:05:22,040 INFO L225 Difference]: With dead ends: 283676 [2020-12-23 10:05:22,040 INFO L226 Difference]: Without dead ends: 193215 [2020-12-23 10:05:22,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 10:05:22,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193215 states. [2020-12-23 10:05:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193215 to 132887. [2020-12-23 10:05:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132887 states. [2020-12-23 10:05:26,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132887 states to 132887 states and 215706 transitions. [2020-12-23 10:05:26,206 INFO L78 Accepts]: Start accepts. Automaton has 132887 states and 215706 transitions. Word has length 131 [2020-12-23 10:05:26,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:05:26,207 INFO L481 AbstractCegarLoop]: Abstraction has 132887 states and 215706 transitions. [2020-12-23 10:05:26,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 10:05:26,207 INFO L276 IsEmpty]: Start isEmpty. Operand 132887 states and 215706 transitions. [2020-12-23 10:05:26,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-12-23 10:05:26,208 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:05:26,208 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] [2020-12-23 10:05:26,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 10:05:26,208 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:05:26,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:05:26,209 INFO L82 PathProgramCache]: Analyzing trace with hash -516955133, now seen corresponding path program 1 times [2020-12-23 10:05:26,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:05:26,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043742724] [2020-12-23 10:05:26,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:05:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:05:26,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:05:26,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043742724] [2020-12-23 10:05:26,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:05:26,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 10:05:26,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619798728] [2020-12-23 10:05:26,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 10:05:26,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:05:26,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 10:05:26,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 10:05:26,410 INFO L87 Difference]: Start difference. First operand 132887 states and 215706 transitions. Second operand 8 states. [2020-12-23 10:05:32,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:05:32,486 INFO L93 Difference]: Finished difference Result 270179 states and 434572 transitions. [2020-12-23 10:05:32,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 10:05:32,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 132 [2020-12-23 10:05:32,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:05:33,105 INFO L225 Difference]: With dead ends: 270179 [2020-12-23 10:05:33,106 INFO L226 Difference]: Without dead ends: 270177 [2020-12-23 10:05:33,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2020-12-23 10:05:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270177 states. [2020-12-23 10:05:38,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270177 to 137945. [2020-12-23 10:05:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137945 states. [2020-12-23 10:05:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137945 states to 137945 states and 220737 transitions. [2020-12-23 10:05:38,656 INFO L78 Accepts]: Start accepts. Automaton has 137945 states and 220737 transitions. Word has length 132 [2020-12-23 10:05:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:05:38,657 INFO L481 AbstractCegarLoop]: Abstraction has 137945 states and 220737 transitions. [2020-12-23 10:05:38,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 10:05:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 137945 states and 220737 transitions. [2020-12-23 10:05:38,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 10:05:38,667 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:05:38,668 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:05:38,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 10:05:38,668 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:05:38,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:05:38,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1950700141, now seen corresponding path program 1 times [2020-12-23 10:05:38,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:05:38,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649930107] [2020-12-23 10:05:38,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:05:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:05:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 10:05:38,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649930107] [2020-12-23 10:05:38,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:05:38,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 10:05:38,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51746494] [2020-12-23 10:05:38,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 10:05:38,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:05:38,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 10:05:38,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 10:05:38,915 INFO L87 Difference]: Start difference. First operand 137945 states and 220737 transitions. Second operand 6 states. [2020-12-23 10:05:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:05:44,289 INFO L93 Difference]: Finished difference Result 232569 states and 375162 transitions. [2020-12-23 10:05:44,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 10:05:44,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 169 [2020-12-23 10:05:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:05:44,599 INFO L225 Difference]: With dead ends: 232569 [2020-12-23 10:05:44,599 INFO L226 Difference]: Without dead ends: 192267 [2020-12-23 10:05:44,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 10:05:44,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192267 states. [2020-12-23 10:05:49,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192267 to 153775. [2020-12-23 10:05:49,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153775 states. [2020-12-23 10:05:49,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153775 states to 153775 states and 245909 transitions. [2020-12-23 10:05:49,890 INFO L78 Accepts]: Start accepts. Automaton has 153775 states and 245909 transitions. Word has length 169 [2020-12-23 10:05:49,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:05:49,891 INFO L481 AbstractCegarLoop]: Abstraction has 153775 states and 245909 transitions. [2020-12-23 10:05:49,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 10:05:49,891 INFO L276 IsEmpty]: Start isEmpty. Operand 153775 states and 245909 transitions. [2020-12-23 10:05:49,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 10:05:49,896 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:05:49,897 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:05:49,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 10:05:49,897 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:05:49,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:05:49,898 INFO L82 PathProgramCache]: Analyzing trace with hash 502467593, now seen corresponding path program 1 times [2020-12-23 10:05:49,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:05:49,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611968640] [2020-12-23 10:05:49,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:05:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:05:50,380 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-12-23 10:05:50,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611968640] [2020-12-23 10:05:50,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:05:50,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 10:05:50,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892996129] [2020-12-23 10:05:50,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 10:05:50,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:05:50,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 10:05:50,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 10:05:50,382 INFO L87 Difference]: Start difference. First operand 153775 states and 245909 transitions. Second operand 6 states. [2020-12-23 10:05:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:05:56,060 INFO L93 Difference]: Finished difference Result 251395 states and 404780 transitions. [2020-12-23 10:05:56,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 10:05:56,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 169 [2020-12-23 10:05:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:05:56,405 INFO L225 Difference]: With dead ends: 251395 [2020-12-23 10:05:56,405 INFO L226 Difference]: Without dead ends: 211293 [2020-12-23 10:05:56,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 10:05:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211293 states. [2020-12-23 10:06:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211293 to 169541. [2020-12-23 10:06:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169541 states. [2020-12-23 10:06:02,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169541 states to 169541 states and 271433 transitions. [2020-12-23 10:06:02,510 INFO L78 Accepts]: Start accepts. Automaton has 169541 states and 271433 transitions. Word has length 169 [2020-12-23 10:06:02,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:06:02,510 INFO L481 AbstractCegarLoop]: Abstraction has 169541 states and 271433 transitions. [2020-12-23 10:06:02,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 10:06:02,510 INFO L276 IsEmpty]: Start isEmpty. Operand 169541 states and 271433 transitions. [2020-12-23 10:06:02,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 10:06:02,515 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:06:02,516 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:06:02,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 10:06:02,516 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:06:02,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:06:02,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1488798125, now seen corresponding path program 1 times [2020-12-23 10:06:02,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:06:02,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482054668] [2020-12-23 10:06:02,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:06:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:06:02,700 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-23 10:06:02,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482054668] [2020-12-23 10:06:02,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:06:02,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 10:06:02,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958774219] [2020-12-23 10:06:02,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 10:06:02,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:06:02,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 10:06:02,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 10:06:02,703 INFO L87 Difference]: Start difference. First operand 169541 states and 271433 transitions. Second operand 6 states. [2020-12-23 10:06:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:06:09,296 INFO L93 Difference]: Finished difference Result 267161 states and 430304 transitions. [2020-12-23 10:06:09,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 10:06:09,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 169 [2020-12-23 10:06:09,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:06:09,694 INFO L225 Difference]: With dead ends: 267161 [2020-12-23 10:06:09,695 INFO L226 Difference]: Without dead ends: 227059 [2020-12-23 10:06:09,755 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 10:06:09,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227059 states. [2020-12-23 10:06:17,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227059 to 185307. [2020-12-23 10:06:17,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185307 states. [2020-12-23 10:06:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185307 states to 185307 states and 296957 transitions. [2020-12-23 10:06:18,019 INFO L78 Accepts]: Start accepts. Automaton has 185307 states and 296957 transitions. Word has length 169 [2020-12-23 10:06:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:06:18,020 INFO L481 AbstractCegarLoop]: Abstraction has 185307 states and 296957 transitions. [2020-12-23 10:06:18,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 10:06:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 185307 states and 296957 transitions. [2020-12-23 10:06:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 10:06:18,023 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:06:18,024 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:06:18,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 10:06:18,024 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:06:18,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:06:18,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1868416201, now seen corresponding path program 1 times [2020-12-23 10:06:18,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:06:18,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507854941] [2020-12-23 10:06:18,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:06:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:06:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 10:06:18,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507854941] [2020-12-23 10:06:18,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:06:18,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 10:06:18,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443422759] [2020-12-23 10:06:18,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 10:06:18,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:06:18,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 10:06:18,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 10:06:18,206 INFO L87 Difference]: Start difference. First operand 185307 states and 296957 transitions. Second operand 6 states. [2020-12-23 10:06:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:06:24,988 INFO L93 Difference]: Finished difference Result 272071 states and 438280 transitions. [2020-12-23 10:06:24,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 10:06:24,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 169 [2020-12-23 10:06:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:06:25,373 INFO L225 Difference]: With dead ends: 272071 [2020-12-23 10:06:25,373 INFO L226 Difference]: Without dead ends: 231969 [2020-12-23 10:06:25,426 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 10:06:25,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231969 states. [2020-12-23 10:06:32,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231969 to 201073. [2020-12-23 10:06:32,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201073 states. [2020-12-23 10:06:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201073 states to 201073 states and 322481 transitions. [2020-12-23 10:06:32,911 INFO L78 Accepts]: Start accepts. Automaton has 201073 states and 322481 transitions. Word has length 169 [2020-12-23 10:06:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:06:32,911 INFO L481 AbstractCegarLoop]: Abstraction has 201073 states and 322481 transitions. [2020-12-23 10:06:32,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 10:06:32,911 INFO L276 IsEmpty]: Start isEmpty. Operand 201073 states and 322481 transitions. [2020-12-23 10:06:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-12-23 10:06:32,915 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:06:32,916 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:06:32,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 10:06:32,916 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:06:32,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:06:32,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1858198460, now seen corresponding path program 1 times [2020-12-23 10:06:32,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:06:32,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570860478] [2020-12-23 10:06:32,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:06:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:06:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 10:06:33,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570860478] [2020-12-23 10:06:33,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:06:33,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:06:33,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552811095] [2020-12-23 10:06:33,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:06:33,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:06:33,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:06:33,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:06:33,049 INFO L87 Difference]: Start difference. First operand 201073 states and 322481 transitions. Second operand 4 states. [2020-12-23 10:06:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:06:39,848 INFO L93 Difference]: Finished difference Result 289097 states and 465292 transitions. [2020-12-23 10:06:39,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:06:39,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2020-12-23 10:06:39,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:06:40,257 INFO L225 Difference]: With dead ends: 289097 [2020-12-23 10:06:40,258 INFO L226 Difference]: Without dead ends: 232965 [2020-12-23 10:06:40,338 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 10:06:40,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232965 states. [2020-12-23 10:06:47,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232965 to 218833. [2020-12-23 10:06:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218833 states. [2020-12-23 10:06:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218833 states to 218833 states and 350787 transitions. [2020-12-23 10:06:48,520 INFO L78 Accepts]: Start accepts. Automaton has 218833 states and 350787 transitions. Word has length 170 [2020-12-23 10:06:48,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:06:48,521 INFO L481 AbstractCegarLoop]: Abstraction has 218833 states and 350787 transitions. [2020-12-23 10:06:48,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:06:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 218833 states and 350787 transitions. [2020-12-23 10:06:48,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-12-23 10:06:48,527 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:06:48,527 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:06:48,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 10:06:48,527 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:06:48,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:06:48,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1880830714, now seen corresponding path program 1 times [2020-12-23 10:06:48,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:06:48,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417080909] [2020-12-23 10:06:48,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:06:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:06:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 10:06:48,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417080909] [2020-12-23 10:06:48,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:06:48,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:06:48,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809365962] [2020-12-23 10:06:48,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:06:48,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:06:48,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:06:48,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:06:48,641 INFO L87 Difference]: Start difference. First operand 218833 states and 350787 transitions. Second operand 3 states. [2020-12-23 10:06:59,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:06:59,264 INFO L93 Difference]: Finished difference Result 439823 states and 707657 transitions. [2020-12-23 10:06:59,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:06:59,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2020-12-23 10:06:59,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:06:59,917 INFO L225 Difference]: With dead ends: 439823 [2020-12-23 10:06:59,917 INFO L226 Difference]: Without dead ends: 359625 [2020-12-23 10:07:00,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:07:00,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359625 states. [2020-12-23 10:07:13,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359625 to 359294. [2020-12-23 10:07:13,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359294 states. [2020-12-23 10:07:15,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359294 states to 359294 states and 576337 transitions. [2020-12-23 10:07:15,673 INFO L78 Accepts]: Start accepts. Automaton has 359294 states and 576337 transitions. Word has length 170 [2020-12-23 10:07:15,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:07:15,673 INFO L481 AbstractCegarLoop]: Abstraction has 359294 states and 576337 transitions. [2020-12-23 10:07:15,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:07:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 359294 states and 576337 transitions. [2020-12-23 10:07:15,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 10:07:15,680 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:07:15,681 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:07:15,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 10:07:15,681 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:07:15,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:07:15,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1175251207, now seen corresponding path program 1 times [2020-12-23 10:07:15,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:07:15,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738048920] [2020-12-23 10:07:15,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:07:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:07:15,927 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:07:15,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738048920] [2020-12-23 10:07:15,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:07:15,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:07:15,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589827137] [2020-12-23 10:07:15,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:07:15,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:07:15,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:07:15,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:07:15,932 INFO L87 Difference]: Start difference. First operand 359294 states and 576337 transitions. Second operand 3 states. [2020-12-23 10:07:40,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:07:40,357 INFO L93 Difference]: Finished difference Result 1067942 states and 1711761 transitions. [2020-12-23 10:07:40,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:07:40,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 10:07:40,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:07:41,858 INFO L225 Difference]: With dead ends: 1067942 [2020-12-23 10:07:41,858 INFO L226 Difference]: Without dead ends: 708691 [2020-12-23 10:07:42,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:07:42,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708691 states. [2020-12-23 10:08:12,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708691 to 708689. [2020-12-23 10:08:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708689 states.