/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:52:56,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:52:56,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:52:56,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:52:56,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:52:56,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:52:56,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:52:56,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:52:56,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:52:56,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:52:56,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:52:56,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:52:56,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:52:56,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:52:56,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:52:56,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:52:56,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:52:56,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:52:56,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:52:56,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:52:56,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:52:56,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:52:56,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:52:56,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:52:56,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:52:56,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:52:56,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:52:56,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:52:56,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:52:56,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:52:56,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:52:56,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:52:56,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:52:56,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:52:56,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:52:56,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:52:56,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:52:56,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:52:56,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:52:56,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:52:56,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:52:56,940 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:52:56,992 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:52:56,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:52:56,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:52:56,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:52:56,997 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:52:56,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:52:56,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:52:56,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:52:56,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:52:56,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:52:56,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:52:57,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:52:57,000 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:52:57,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:52:57,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:52:57,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:52:57,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:52:57,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:52:57,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:52:57,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:52:57,002 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:52:57,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:52:57,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:52:57,002 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:52:57,003 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:52:57,003 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:52:57,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:52:57,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:52:57,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:52:57,486 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:52:57,487 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:52:57,488 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c [2021-01-06 19:52:57,580 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/32cf0b7fb/218176623b9a48fca3a7127f12035014/FLAGc934a3258 [2021-01-06 19:52:58,343 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:52:58,344 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c [2021-01-06 19:52:58,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/32cf0b7fb/218176623b9a48fca3a7127f12035014/FLAGc934a3258 [2021-01-06 19:52:58,616 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/32cf0b7fb/218176623b9a48fca3a7127f12035014 [2021-01-06 19:52:58,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:52:58,624 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:52:58,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:52:58,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:52:58,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:52:58,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:52:58" (1/1) ... [2021-01-06 19:52:58,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@133967cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:52:58, skipping insertion in model container [2021-01-06 19:52:58,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:52:58" (1/1) ... [2021-01-06 19:52:58,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:52:58,687 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:52:58,969 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c[20056,20069] [2021-01-06 19:52:58,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:52:58,989 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:52:59,105 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c[20056,20069] [2021-01-06 19:52:59,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:52:59,152 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:52:59,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:52:59 WrapperNode [2021-01-06 19:52:59,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:52:59,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:52:59,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:52:59,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:52:59,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:52:59" (1/1) ... [2021-01-06 19:52:59,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:52:59" (1/1) ... [2021-01-06 19:52:59,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:52:59,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:52:59,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:52:59,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:52:59,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:52:59" (1/1) ... [2021-01-06 19:52:59,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:52:59" (1/1) ... [2021-01-06 19:52:59,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:52:59" (1/1) ... [2021-01-06 19:52:59,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:52:59" (1/1) ... [2021-01-06 19:52:59,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:52:59" (1/1) ... [2021-01-06 19:52:59,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:52:59" (1/1) ... [2021-01-06 19:52:59,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:52:59" (1/1) ... [2021-01-06 19:52:59,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:52:59,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:52:59,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:52:59,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:52:59,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:52:59" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:52:59,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:52:59,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:52:59,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:52:59,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:53:00,472 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:53:00,473 INFO L299 CfgBuilder]: Removed 27 assume(true) statements. [2021-01-06 19:53:00,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:53:00 BoogieIcfgContainer [2021-01-06 19:53:00,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:53:00,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:53:00,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:53:00,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:53:00,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:52:58" (1/3) ... [2021-01-06 19:53:00,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677800e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:53:00, skipping insertion in model container [2021-01-06 19:53:00,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:52:59" (2/3) ... [2021-01-06 19:53:00,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677800e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:53:00, skipping insertion in model container [2021-01-06 19:53:00,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:53:00" (3/3) ... [2021-01-06 19:53:00,484 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c [2021-01-06 19:53:00,491 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:53:00,497 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:53:00,520 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:53:00,550 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:53:00,551 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:53:00,551 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:53:00,551 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:53:00,551 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:53:00,551 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:53:00,552 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:53:00,552 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:53:00,572 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2021-01-06 19:53:00,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 19:53:00,582 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:00,583 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] [2021-01-06 19:53:00,583 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:00,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:00,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1781508813, now seen corresponding path program 1 times [2021-01-06 19:53:00,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:00,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515251429] [2021-01-06 19:53:00,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:00,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515251429] [2021-01-06 19:53:00,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:00,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:53:00,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553157681] [2021-01-06 19:53:00,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:53:00,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:00,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:53:00,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:53:00,883 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 2 states. [2021-01-06 19:53:00,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:00,926 INFO L93 Difference]: Finished difference Result 201 states and 336 transitions. [2021-01-06 19:53:00,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:53:00,928 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 41 [2021-01-06 19:53:00,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:00,941 INFO L225 Difference]: With dead ends: 201 [2021-01-06 19:53:00,942 INFO L226 Difference]: Without dead ends: 124 [2021-01-06 19:53:00,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:53:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-01-06 19:53:00,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-01-06 19:53:00,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2021-01-06 19:53:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 214 transitions. [2021-01-06 19:53:00,997 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 214 transitions. Word has length 41 [2021-01-06 19:53:00,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:00,998 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 214 transitions. [2021-01-06 19:53:00,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:53:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 214 transitions. [2021-01-06 19:53:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 19:53:01,001 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:01,001 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] [2021-01-06 19:53:01,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:53:01,002 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:01,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:01,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2119091697, now seen corresponding path program 1 times [2021-01-06 19:53:01,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:01,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956360004] [2021-01-06 19:53:01,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:01,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956360004] [2021-01-06 19:53:01,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:01,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:53:01,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412273851] [2021-01-06 19:53:01,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:53:01,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:01,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:53:01,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:53:01,193 INFO L87 Difference]: Start difference. First operand 124 states and 214 transitions. Second operand 5 states. [2021-01-06 19:53:01,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:01,396 INFO L93 Difference]: Finished difference Result 196 states and 326 transitions. [2021-01-06 19:53:01,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:53:01,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2021-01-06 19:53:01,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:01,401 INFO L225 Difference]: With dead ends: 196 [2021-01-06 19:53:01,401 INFO L226 Difference]: Without dead ends: 124 [2021-01-06 19:53:01,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:53:01,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-01-06 19:53:01,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-01-06 19:53:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2021-01-06 19:53:01,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 164 transitions. [2021-01-06 19:53:01,425 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 164 transitions. Word has length 41 [2021-01-06 19:53:01,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:01,425 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 164 transitions. [2021-01-06 19:53:01,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:53:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 164 transitions. [2021-01-06 19:53:01,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:01,435 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:01,435 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] [2021-01-06 19:53:01,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:53:01,436 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:01,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:01,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1557003755, now seen corresponding path program 1 times [2021-01-06 19:53:01,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:01,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905747201] [2021-01-06 19:53:01,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:01,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905747201] [2021-01-06 19:53:01,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:01,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:01,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117154231] [2021-01-06 19:53:01,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:01,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:01,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:01,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:01,761 INFO L87 Difference]: Start difference. First operand 124 states and 164 transitions. Second operand 3 states. [2021-01-06 19:53:01,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:01,796 INFO L93 Difference]: Finished difference Result 254 states and 370 transitions. [2021-01-06 19:53:01,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:01,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:53:01,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:01,802 INFO L225 Difference]: With dead ends: 254 [2021-01-06 19:53:01,802 INFO L226 Difference]: Without dead ends: 186 [2021-01-06 19:53:01,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-01-06 19:53:01,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2021-01-06 19:53:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2021-01-06 19:53:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 260 transitions. [2021-01-06 19:53:01,830 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 260 transitions. Word has length 90 [2021-01-06 19:53:01,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:01,831 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 260 transitions. [2021-01-06 19:53:01,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:01,831 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 260 transitions. [2021-01-06 19:53:01,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:01,834 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:01,836 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] [2021-01-06 19:53:01,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:53:01,836 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:01,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:01,837 INFO L82 PathProgramCache]: Analyzing trace with hash -309494901, now seen corresponding path program 1 times [2021-01-06 19:53:01,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:01,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097637799] [2021-01-06 19:53:01,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:01,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097637799] [2021-01-06 19:53:01,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:01,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:01,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531874196] [2021-01-06 19:53:01,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:01,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:01,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:01,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:01,957 INFO L87 Difference]: Start difference. First operand 184 states and 260 transitions. Second operand 3 states. [2021-01-06 19:53:01,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:01,984 INFO L93 Difference]: Finished difference Result 428 states and 648 transitions. [2021-01-06 19:53:01,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:01,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:53:01,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:01,987 INFO L225 Difference]: With dead ends: 428 [2021-01-06 19:53:01,988 INFO L226 Difference]: Without dead ends: 300 [2021-01-06 19:53:01,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:01,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-01-06 19:53:02,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2021-01-06 19:53:02,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2021-01-06 19:53:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 441 transitions. [2021-01-06 19:53:02,015 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 441 transitions. Word has length 90 [2021-01-06 19:53:02,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:02,015 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 441 transitions. [2021-01-06 19:53:02,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 441 transitions. [2021-01-06 19:53:02,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:02,016 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:02,017 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] [2021-01-06 19:53:02,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:53:02,017 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:02,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:02,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1050927103, now seen corresponding path program 1 times [2021-01-06 19:53:02,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:02,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693978557] [2021-01-06 19:53:02,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:02,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693978557] [2021-01-06 19:53:02,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:02,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:02,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121002263] [2021-01-06 19:53:02,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:02,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:02,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:02,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:02,162 INFO L87 Difference]: Start difference. First operand 298 states and 441 transitions. Second operand 3 states. [2021-01-06 19:53:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:02,203 INFO L93 Difference]: Finished difference Result 758 states and 1171 transitions. [2021-01-06 19:53:02,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:02,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:53:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:02,208 INFO L225 Difference]: With dead ends: 758 [2021-01-06 19:53:02,208 INFO L226 Difference]: Without dead ends: 516 [2021-01-06 19:53:02,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:02,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-01-06 19:53:02,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 514. [2021-01-06 19:53:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2021-01-06 19:53:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 781 transitions. [2021-01-06 19:53:02,255 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 781 transitions. Word has length 90 [2021-01-06 19:53:02,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:02,256 INFO L481 AbstractCegarLoop]: Abstraction has 514 states and 781 transitions. [2021-01-06 19:53:02,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:02,258 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 781 transitions. [2021-01-06 19:53:02,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:02,259 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:02,260 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] [2021-01-06 19:53:02,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:53:02,260 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:02,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:02,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1796509833, now seen corresponding path program 1 times [2021-01-06 19:53:02,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:02,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140104749] [2021-01-06 19:53:02,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:02,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140104749] [2021-01-06 19:53:02,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:02,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:02,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830035979] [2021-01-06 19:53:02,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:02,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:02,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:02,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:02,422 INFO L87 Difference]: Start difference. First operand 514 states and 781 transitions. Second operand 3 states. [2021-01-06 19:53:02,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:02,495 INFO L93 Difference]: Finished difference Result 1382 states and 2151 transitions. [2021-01-06 19:53:02,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:02,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:53:02,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:02,504 INFO L225 Difference]: With dead ends: 1382 [2021-01-06 19:53:02,504 INFO L226 Difference]: Without dead ends: 924 [2021-01-06 19:53:02,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:02,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2021-01-06 19:53:02,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 922. [2021-01-06 19:53:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2021-01-06 19:53:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1417 transitions. [2021-01-06 19:53:02,551 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1417 transitions. Word has length 90 [2021-01-06 19:53:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:02,553 INFO L481 AbstractCegarLoop]: Abstraction has 922 states and 1417 transitions. [2021-01-06 19:53:02,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1417 transitions. [2021-01-06 19:53:02,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:02,554 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:02,555 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] [2021-01-06 19:53:02,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:53:02,555 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:02,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:02,556 INFO L82 PathProgramCache]: Analyzing trace with hash -259221845, now seen corresponding path program 1 times [2021-01-06 19:53:02,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:02,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076600752] [2021-01-06 19:53:02,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:02,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:02,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076600752] [2021-01-06 19:53:02,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:02,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:02,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878274266] [2021-01-06 19:53:02,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:02,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:02,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:02,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:02,655 INFO L87 Difference]: Start difference. First operand 922 states and 1417 transitions. Second operand 3 states. [2021-01-06 19:53:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:02,724 INFO L93 Difference]: Finished difference Result 2558 states and 3979 transitions. [2021-01-06 19:53:02,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:02,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:53:02,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:02,733 INFO L225 Difference]: With dead ends: 2558 [2021-01-06 19:53:02,734 INFO L226 Difference]: Without dead ends: 1692 [2021-01-06 19:53:02,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2021-01-06 19:53:02,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1690. [2021-01-06 19:53:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2021-01-06 19:53:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2601 transitions. [2021-01-06 19:53:02,803 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2601 transitions. Word has length 90 [2021-01-06 19:53:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:02,803 INFO L481 AbstractCegarLoop]: Abstraction has 1690 states and 2601 transitions. [2021-01-06 19:53:02,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2601 transitions. [2021-01-06 19:53:02,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:02,805 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:02,805 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] [2021-01-06 19:53:02,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:53:02,806 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:02,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:02,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1420392415, now seen corresponding path program 1 times [2021-01-06 19:53:02,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:02,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014033211] [2021-01-06 19:53:02,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:02,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014033211] [2021-01-06 19:53:02,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:02,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:02,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364208009] [2021-01-06 19:53:02,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:02,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:02,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:02,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:02,910 INFO L87 Difference]: Start difference. First operand 1690 states and 2601 transitions. Second operand 3 states. [2021-01-06 19:53:03,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:03,053 INFO L93 Difference]: Finished difference Result 4766 states and 7371 transitions. [2021-01-06 19:53:03,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:03,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:53:03,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:03,079 INFO L225 Difference]: With dead ends: 4766 [2021-01-06 19:53:03,079 INFO L226 Difference]: Without dead ends: 3132 [2021-01-06 19:53:03,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states. [2021-01-06 19:53:03,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 3130. [2021-01-06 19:53:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2021-01-06 19:53:03,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 4793 transitions. [2021-01-06 19:53:03,323 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 4793 transitions. Word has length 90 [2021-01-06 19:53:03,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:03,323 INFO L481 AbstractCegarLoop]: Abstraction has 3130 states and 4793 transitions. [2021-01-06 19:53:03,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 4793 transitions. [2021-01-06 19:53:03,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:03,327 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:03,328 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] [2021-01-06 19:53:03,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:53:03,328 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:03,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:03,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1758185557, now seen corresponding path program 1 times [2021-01-06 19:53:03,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:03,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239414094] [2021-01-06 19:53:03,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:03,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239414094] [2021-01-06 19:53:03,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:03,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:03,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738264902] [2021-01-06 19:53:03,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:03,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:03,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:03,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:03,476 INFO L87 Difference]: Start difference. First operand 3130 states and 4793 transitions. Second operand 3 states. [2021-01-06 19:53:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:03,734 INFO L93 Difference]: Finished difference Result 8894 states and 13627 transitions. [2021-01-06 19:53:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:03,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:53:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:03,767 INFO L225 Difference]: With dead ends: 8894 [2021-01-06 19:53:03,767 INFO L226 Difference]: Without dead ends: 5820 [2021-01-06 19:53:03,773 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:03,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5820 states. [2021-01-06 19:53:04,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5820 to 5818. [2021-01-06 19:53:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5818 states. [2021-01-06 19:53:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5818 states to 5818 states and 8825 transitions. [2021-01-06 19:53:04,117 INFO L78 Accepts]: Start accepts. Automaton has 5818 states and 8825 transitions. Word has length 90 [2021-01-06 19:53:04,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:04,117 INFO L481 AbstractCegarLoop]: Abstraction has 5818 states and 8825 transitions. [2021-01-06 19:53:04,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 5818 states and 8825 transitions. [2021-01-06 19:53:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:04,122 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:04,122 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] [2021-01-06 19:53:04,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:53:04,122 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:04,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:04,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1318796341, now seen corresponding path program 1 times [2021-01-06 19:53:04,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:04,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109451327] [2021-01-06 19:53:04,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:04,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109451327] [2021-01-06 19:53:04,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:04,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:53:04,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355276264] [2021-01-06 19:53:04,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:53:04,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:04,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:53:04,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:53:04,340 INFO L87 Difference]: Start difference. First operand 5818 states and 8825 transitions. Second operand 6 states. [2021-01-06 19:53:04,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:04,782 INFO L93 Difference]: Finished difference Result 11580 states and 17594 transitions. [2021-01-06 19:53:04,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:53:04,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2021-01-06 19:53:04,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:04,817 INFO L225 Difference]: With dead ends: 11580 [2021-01-06 19:53:04,817 INFO L226 Difference]: Without dead ends: 5818 [2021-01-06 19:53:04,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:53:04,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5818 states. [2021-01-06 19:53:05,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5818 to 5818. [2021-01-06 19:53:05,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5818 states. [2021-01-06 19:53:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5818 states to 5818 states and 8761 transitions. [2021-01-06 19:53:05,206 INFO L78 Accepts]: Start accepts. Automaton has 5818 states and 8761 transitions. Word has length 90 [2021-01-06 19:53:05,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:05,206 INFO L481 AbstractCegarLoop]: Abstraction has 5818 states and 8761 transitions. [2021-01-06 19:53:05,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:53:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 5818 states and 8761 transitions. [2021-01-06 19:53:05,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:05,207 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:05,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:05,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:53:05,208 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:05,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:05,209 INFO L82 PathProgramCache]: Analyzing trace with hash -297727987, now seen corresponding path program 1 times [2021-01-06 19:53:05,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:05,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343022536] [2021-01-06 19:53:05,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:05,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343022536] [2021-01-06 19:53:05,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:05,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:53:05,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034817034] [2021-01-06 19:53:05,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:53:05,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:05,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:53:05,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:53:05,326 INFO L87 Difference]: Start difference. First operand 5818 states and 8761 transitions. Second operand 6 states. [2021-01-06 19:53:05,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:05,769 INFO L93 Difference]: Finished difference Result 11580 states and 17466 transitions. [2021-01-06 19:53:05,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:53:05,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2021-01-06 19:53:05,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:05,817 INFO L225 Difference]: With dead ends: 11580 [2021-01-06 19:53:05,817 INFO L226 Difference]: Without dead ends: 5818 [2021-01-06 19:53:05,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:53:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5818 states. [2021-01-06 19:53:06,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5818 to 5818. [2021-01-06 19:53:06,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5818 states. [2021-01-06 19:53:06,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5818 states to 5818 states and 8697 transitions. [2021-01-06 19:53:06,186 INFO L78 Accepts]: Start accepts. Automaton has 5818 states and 8697 transitions. Word has length 90 [2021-01-06 19:53:06,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:06,187 INFO L481 AbstractCegarLoop]: Abstraction has 5818 states and 8697 transitions. [2021-01-06 19:53:06,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:53:06,187 INFO L276 IsEmpty]: Start isEmpty. Operand 5818 states and 8697 transitions. [2021-01-06 19:53:06,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:06,188 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:06,188 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] [2021-01-06 19:53:06,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:53:06,189 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:06,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:06,190 INFO L82 PathProgramCache]: Analyzing trace with hash 519920463, now seen corresponding path program 1 times [2021-01-06 19:53:06,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:06,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384378593] [2021-01-06 19:53:06,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:06,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384378593] [2021-01-06 19:53:06,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:06,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:53:06,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632845664] [2021-01-06 19:53:06,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:53:06,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:06,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:53:06,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:53:06,353 INFO L87 Difference]: Start difference. First operand 5818 states and 8697 transitions. Second operand 9 states. [2021-01-06 19:53:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:10,058 INFO L93 Difference]: Finished difference Result 86486 states and 129671 transitions. [2021-01-06 19:53:10,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 19:53:10,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2021-01-06 19:53:10,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:10,279 INFO L225 Difference]: With dead ends: 86486 [2021-01-06 19:53:10,280 INFO L226 Difference]: Without dead ends: 80724 [2021-01-06 19:53:10,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:53:10,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80724 states. [2021-01-06 19:53:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80724 to 11578. [2021-01-06 19:53:12,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11578 states. [2021-01-06 19:53:12,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11578 states to 11578 states and 17081 transitions. [2021-01-06 19:53:12,367 INFO L78 Accepts]: Start accepts. Automaton has 11578 states and 17081 transitions. Word has length 90 [2021-01-06 19:53:12,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:12,368 INFO L481 AbstractCegarLoop]: Abstraction has 11578 states and 17081 transitions. [2021-01-06 19:53:12,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:53:12,368 INFO L276 IsEmpty]: Start isEmpty. Operand 11578 states and 17081 transitions. [2021-01-06 19:53:12,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 19:53:12,369 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:12,369 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] [2021-01-06 19:53:12,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:53:12,370 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:12,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:12,371 INFO L82 PathProgramCache]: Analyzing trace with hash 78162119, now seen corresponding path program 1 times [2021-01-06 19:53:12,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:12,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100247330] [2021-01-06 19:53:12,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:12,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100247330] [2021-01-06 19:53:12,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:12,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:53:12,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152728101] [2021-01-06 19:53:12,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:53:12,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:12,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:53:12,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:53:12,772 INFO L87 Difference]: Start difference. First operand 11578 states and 17081 transitions. Second operand 9 states. [2021-01-06 19:53:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:14,403 INFO L93 Difference]: Finished difference Result 28864 states and 42748 transitions. [2021-01-06 19:53:14,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:53:14,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2021-01-06 19:53:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:14,439 INFO L225 Difference]: With dead ends: 28864 [2021-01-06 19:53:14,440 INFO L226 Difference]: Without dead ends: 17342 [2021-01-06 19:53:14,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:53:14,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17342 states. [2021-01-06 19:53:15,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17342 to 11578. [2021-01-06 19:53:15,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11578 states. [2021-01-06 19:53:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11578 states to 11578 states and 16953 transitions. [2021-01-06 19:53:15,458 INFO L78 Accepts]: Start accepts. Automaton has 11578 states and 16953 transitions. Word has length 92 [2021-01-06 19:53:15,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:15,458 INFO L481 AbstractCegarLoop]: Abstraction has 11578 states and 16953 transitions. [2021-01-06 19:53:15,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:53:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 11578 states and 16953 transitions. [2021-01-06 19:53:15,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 19:53:15,459 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:15,459 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] [2021-01-06 19:53:15,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:53:15,460 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:15,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:15,461 INFO L82 PathProgramCache]: Analyzing trace with hash 11668607, now seen corresponding path program 1 times [2021-01-06 19:53:15,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:15,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129109233] [2021-01-06 19:53:15,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:15,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129109233] [2021-01-06 19:53:15,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:15,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:15,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54039841] [2021-01-06 19:53:15,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:15,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:15,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:15,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:15,515 INFO L87 Difference]: Start difference. First operand 11578 states and 16953 transitions. Second operand 3 states. [2021-01-06 19:53:16,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:16,674 INFO L93 Difference]: Finished difference Result 29246 states and 42619 transitions. [2021-01-06 19:53:16,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:16,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2021-01-06 19:53:16,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:16,701 INFO L225 Difference]: With dead ends: 29246 [2021-01-06 19:53:16,702 INFO L226 Difference]: Without dead ends: 17724 [2021-01-06 19:53:16,718 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17724 states. [2021-01-06 19:53:18,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17724 to 17722. [2021-01-06 19:53:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17722 states. [2021-01-06 19:53:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17722 states to 17722 states and 25337 transitions. [2021-01-06 19:53:18,073 INFO L78 Accepts]: Start accepts. Automaton has 17722 states and 25337 transitions. Word has length 92 [2021-01-06 19:53:18,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:18,073 INFO L481 AbstractCegarLoop]: Abstraction has 17722 states and 25337 transitions. [2021-01-06 19:53:18,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:18,073 INFO L276 IsEmpty]: Start isEmpty. Operand 17722 states and 25337 transitions. [2021-01-06 19:53:18,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 19:53:18,074 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:18,074 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] [2021-01-06 19:53:18,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:53:18,075 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:18,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:18,075 INFO L82 PathProgramCache]: Analyzing trace with hash 2008302822, now seen corresponding path program 1 times [2021-01-06 19:53:18,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:18,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077168904] [2021-01-06 19:53:18,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:18,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077168904] [2021-01-06 19:53:18,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:18,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:53:18,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987783167] [2021-01-06 19:53:18,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:53:18,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:18,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:53:18,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:53:18,193 INFO L87 Difference]: Start difference. First operand 17722 states and 25337 transitions. Second operand 8 states. [2021-01-06 19:53:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:20,460 INFO L93 Difference]: Finished difference Result 29151 states and 41457 transitions. [2021-01-06 19:53:20,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:53:20,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2021-01-06 19:53:20,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:20,504 INFO L225 Difference]: With dead ends: 29151 [2021-01-06 19:53:20,505 INFO L226 Difference]: Without dead ends: 29149 [2021-01-06 19:53:20,516 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 [2021-01-06 19:53:20,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29149 states. [2021-01-06 19:53:21,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29149 to 18106. [2021-01-06 19:53:21,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18106 states. [2021-01-06 19:53:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18106 states to 18106 states and 25593 transitions. [2021-01-06 19:53:21,903 INFO L78 Accepts]: Start accepts. Automaton has 18106 states and 25593 transitions. Word has length 93 [2021-01-06 19:53:21,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:21,904 INFO L481 AbstractCegarLoop]: Abstraction has 18106 states and 25593 transitions. [2021-01-06 19:53:21,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:53:21,904 INFO L276 IsEmpty]: Start isEmpty. Operand 18106 states and 25593 transitions. [2021-01-06 19:53:21,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 19:53:21,905 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:21,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:21,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:53:21,905 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:21,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:21,906 INFO L82 PathProgramCache]: Analyzing trace with hash 411535013, now seen corresponding path program 1 times [2021-01-06 19:53:21,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:21,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90413489] [2021-01-06 19:53:21,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:21,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:21,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90413489] [2021-01-06 19:53:21,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:21,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:21,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871599202] [2021-01-06 19:53:21,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:21,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:21,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:21,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:21,972 INFO L87 Difference]: Start difference. First operand 18106 states and 25593 transitions. Second operand 3 states. [2021-01-06 19:53:23,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:23,590 INFO L93 Difference]: Finished difference Result 41600 states and 59005 transitions. [2021-01-06 19:53:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:23,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2021-01-06 19:53:23,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:23,627 INFO L225 Difference]: With dead ends: 41600 [2021-01-06 19:53:23,627 INFO L226 Difference]: Without dead ends: 23550 [2021-01-06 19:53:23,649 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:23,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23550 states. [2021-01-06 19:53:25,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23550 to 23548. [2021-01-06 19:53:25,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23548 states. [2021-01-06 19:53:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23548 states to 23548 states and 33275 transitions. [2021-01-06 19:53:25,625 INFO L78 Accepts]: Start accepts. Automaton has 23548 states and 33275 transitions. Word has length 93 [2021-01-06 19:53:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:25,625 INFO L481 AbstractCegarLoop]: Abstraction has 23548 states and 33275 transitions. [2021-01-06 19:53:25,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:25,626 INFO L276 IsEmpty]: Start isEmpty. Operand 23548 states and 33275 transitions. [2021-01-06 19:53:25,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-01-06 19:53:25,638 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:25,639 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:53:25,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:53:25,639 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:25,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:25,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1787662099, now seen corresponding path program 1 times [2021-01-06 19:53:25,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:25,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695367501] [2021-01-06 19:53:25,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:25,817 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-06 19:53:25,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695367501] [2021-01-06 19:53:25,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:25,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:53:25,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565525544] [2021-01-06 19:53:25,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:53:25,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:25,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:53:25,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:53:25,819 INFO L87 Difference]: Start difference. First operand 23548 states and 33275 transitions. Second operand 9 states. [2021-01-06 19:53:36,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:36,634 INFO L93 Difference]: Finished difference Result 194188 states and 274307 transitions. [2021-01-06 19:53:36,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:53:36,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2021-01-06 19:53:36,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:37,100 INFO L225 Difference]: With dead ends: 194188 [2021-01-06 19:53:37,100 INFO L226 Difference]: Without dead ends: 170698 [2021-01-06 19:53:37,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:53:37,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170698 states. [2021-01-06 19:53:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170698 to 47036. [2021-01-06 19:53:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47036 states. [2021-01-06 19:53:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47036 states to 47036 states and 66235 transitions. [2021-01-06 19:53:41,583 INFO L78 Accepts]: Start accepts. Automaton has 47036 states and 66235 transitions. Word has length 129 [2021-01-06 19:53:41,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:41,583 INFO L481 AbstractCegarLoop]: Abstraction has 47036 states and 66235 transitions. [2021-01-06 19:53:41,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:53:41,584 INFO L276 IsEmpty]: Start isEmpty. Operand 47036 states and 66235 transitions. [2021-01-06 19:53:41,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-01-06 19:53:41,599 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:41,599 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:53:41,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:53:41,600 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:41,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:41,600 INFO L82 PathProgramCache]: Analyzing trace with hash 18879283, now seen corresponding path program 1 times [2021-01-06 19:53:41,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:41,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682771488] [2021-01-06 19:53:41,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-06 19:53:41,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682771488] [2021-01-06 19:53:41,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:41,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:53:41,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701477862] [2021-01-06 19:53:41,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:53:41,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:41,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:53:41,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:53:41,816 INFO L87 Difference]: Start difference. First operand 47036 states and 66235 transitions. Second operand 9 states. [2021-01-06 19:53:55,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:55,510 INFO L93 Difference]: Finished difference Result 217676 states and 307267 transitions. [2021-01-06 19:53:55,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:53:55,511 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2021-01-06 19:53:55,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:55,997 INFO L225 Difference]: With dead ends: 217676 [2021-01-06 19:53:55,997 INFO L226 Difference]: Without dead ends: 194186 [2021-01-06 19:53:56,126 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:53:56,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194186 states. [2021-01-06 19:54:03,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194186 to 82172. [2021-01-06 19:54:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82172 states. [2021-01-06 19:54:03,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82172 states to 82172 states and 115387 transitions. [2021-01-06 19:54:03,527 INFO L78 Accepts]: Start accepts. Automaton has 82172 states and 115387 transitions. Word has length 129 [2021-01-06 19:54:03,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:03,528 INFO L481 AbstractCegarLoop]: Abstraction has 82172 states and 115387 transitions. [2021-01-06 19:54:03,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:54:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand 82172 states and 115387 transitions. [2021-01-06 19:54:03,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-01-06 19:54:03,545 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:03,545 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:54:03,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:54:03,545 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:03,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:03,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1150519123, now seen corresponding path program 1 times [2021-01-06 19:54:03,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:03,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807762712] [2021-01-06 19:54:03,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 19:54:03,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807762712] [2021-01-06 19:54:03,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:03,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:54:03,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198794534] [2021-01-06 19:54:03,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:54:03,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:03,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:54:03,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:54:03,903 INFO L87 Difference]: Start difference. First operand 82172 states and 115387 transitions. Second operand 9 states. [2021-01-06 19:54:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:19,537 INFO L93 Difference]: Finished difference Result 241164 states and 340227 transitions. [2021-01-06 19:54:19,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:54:19,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2021-01-06 19:54:19,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:20,029 INFO L225 Difference]: With dead ends: 241164 [2021-01-06 19:54:20,030 INFO L226 Difference]: Without dead ends: 217674 [2021-01-06 19:54:20,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:54:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217674 states. [2021-01-06 19:54:29,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217674 to 105660. [2021-01-06 19:54:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105660 states. [2021-01-06 19:54:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105660 states to 105660 states and 148347 transitions. [2021-01-06 19:54:29,644 INFO L78 Accepts]: Start accepts. Automaton has 105660 states and 148347 transitions. Word has length 129 [2021-01-06 19:54:29,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:29,644 INFO L481 AbstractCegarLoop]: Abstraction has 105660 states and 148347 transitions. [2021-01-06 19:54:29,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:54:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 105660 states and 148347 transitions. [2021-01-06 19:54:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-01-06 19:54:29,662 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:29,662 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:54:29,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:54:29,663 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:29,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:29,664 INFO L82 PathProgramCache]: Analyzing trace with hash -84939917, now seen corresponding path program 1 times [2021-01-06 19:54:29,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:29,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675497256] [2021-01-06 19:54:29,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:29,824 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:54:29,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675497256] [2021-01-06 19:54:29,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:29,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:54:29,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187744750] [2021-01-06 19:54:29,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:54:29,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:29,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:54:29,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:54:29,826 INFO L87 Difference]: Start difference. First operand 105660 states and 148347 transitions. Second operand 9 states. [2021-01-06 19:54:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:49,105 INFO L93 Difference]: Finished difference Result 264652 states and 373187 transitions. [2021-01-06 19:54:49,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:54:49,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2021-01-06 19:54:49,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:49,578 INFO L225 Difference]: With dead ends: 264652 [2021-01-06 19:54:49,579 INFO L226 Difference]: Without dead ends: 241162 [2021-01-06 19:54:49,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:54:49,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241162 states. [2021-01-06 19:55:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241162 to 129148. [2021-01-06 19:55:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129148 states. [2021-01-06 19:55:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129148 states to 129148 states and 181307 transitions. [2021-01-06 19:55:01,843 INFO L78 Accepts]: Start accepts. Automaton has 129148 states and 181307 transitions. Word has length 129 [2021-01-06 19:55:01,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:55:01,843 INFO L481 AbstractCegarLoop]: Abstraction has 129148 states and 181307 transitions. [2021-01-06 19:55:01,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:55:01,843 INFO L276 IsEmpty]: Start isEmpty. Operand 129148 states and 181307 transitions. [2021-01-06 19:55:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-01-06 19:55:01,861 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:55:01,861 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:55:01,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:55:01,861 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:55:01,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:55:01,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1505935469, now seen corresponding path program 1 times [2021-01-06 19:55:01,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:55:01,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291476764] [2021-01-06 19:55:01,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:55:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:55:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:55:02,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291476764] [2021-01-06 19:55:02,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:55:02,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:55:02,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850692236] [2021-01-06 19:55:02,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:55:02,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:55:02,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:55:02,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:55:02,043 INFO L87 Difference]: Start difference. First operand 129148 states and 181307 transitions. Second operand 9 states. [2021-01-06 19:55:25,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:55:25,621 INFO L93 Difference]: Finished difference Result 288140 states and 406147 transitions. [2021-01-06 19:55:25,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:55:25,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2021-01-06 19:55:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:55:26,220 INFO L225 Difference]: With dead ends: 288140 [2021-01-06 19:55:26,220 INFO L226 Difference]: Without dead ends: 264650 [2021-01-06 19:55:26,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:55:26,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264650 states. [2021-01-06 19:55:41,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264650 to 152636. [2021-01-06 19:55:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152636 states. [2021-01-06 19:55:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152636 states to 152636 states and 214267 transitions. [2021-01-06 19:55:41,720 INFO L78 Accepts]: Start accepts. Automaton has 152636 states and 214267 transitions. Word has length 129 [2021-01-06 19:55:41,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:55:41,720 INFO L481 AbstractCegarLoop]: Abstraction has 152636 states and 214267 transitions. [2021-01-06 19:55:41,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:55:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 152636 states and 214267 transitions. [2021-01-06 19:55:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-01-06 19:55:41,737 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:55:41,737 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:55:41,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:55:41,737 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:55:41,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:55:41,738 INFO L82 PathProgramCache]: Analyzing trace with hash -2071755853, now seen corresponding path program 1 times [2021-01-06 19:55:41,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:55:41,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240648291] [2021-01-06 19:55:41,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:55:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:55:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 19:55:41,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240648291] [2021-01-06 19:55:41,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:55:41,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:55:41,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732510342] [2021-01-06 19:55:41,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:55:41,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:55:41,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:55:41,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:55:41,910 INFO L87 Difference]: Start difference. First operand 152636 states and 214267 transitions. Second operand 9 states. [2021-01-06 19:56:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:10,431 INFO L93 Difference]: Finished difference Result 311628 states and 439107 transitions. [2021-01-06 19:56:10,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:56:10,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2021-01-06 19:56:10,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:11,000 INFO L225 Difference]: With dead ends: 311628 [2021-01-06 19:56:11,001 INFO L226 Difference]: Without dead ends: 288138 [2021-01-06 19:56:11,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:56:11,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288138 states.