/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-var-start-time.6.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:46:34,221 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:46:34,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:46:34,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:46:34,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:46:34,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:46:34,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:46:34,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:46:34,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:46:34,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:46:34,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:46:34,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:46:34,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:46:34,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:46:34,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:46:34,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:46:34,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:46:34,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:46:34,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:46:34,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:46:34,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:46:34,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:46:34,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:46:34,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:46:34,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:46:34,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:46:34,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:46:34,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:46:34,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:46:34,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:46:34,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:46:34,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:46:34,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:46:34,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:46:34,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:46:34,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:46:34,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:46:34,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:46:34,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:46:34,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:46:34,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:46:34,352 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:46:34,405 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:46:34,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:46:34,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:46:34,410 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:46:34,410 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:46:34,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:46:34,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:46:34,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:46:34,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:46:34,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:46:34,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:46:34,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:46:34,414 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:46:34,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:46:34,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:46:34,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:46:34,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:46:34,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:46:34,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:46:34,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:46:34,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:46:34,416 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:46:34,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:46:34,416 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:46:34,417 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:46:34,417 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:46:34,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:46:34,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:46:34,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:46:34,856 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:46:34,857 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:46:34,858 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c [2021-01-06 19:46:34,948 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/fc8a2991d/b20574d4164f48d299fc81b3f1b6c37e/FLAG041bf9f6a [2021-01-06 19:46:35,592 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:46:35,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c [2021-01-06 19:46:35,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/fc8a2991d/b20574d4164f48d299fc81b3f1b6c37e/FLAG041bf9f6a [2021-01-06 19:46:35,919 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/fc8a2991d/b20574d4164f48d299fc81b3f1b6c37e [2021-01-06 19:46:35,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:46:35,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:46:35,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:46:35,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:46:35,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:46:35,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:46:35" (1/1) ... [2021-01-06 19:46:35,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2579d7cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:35, skipping insertion in model container [2021-01-06 19:46:35,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:46:35" (1/1) ... [2021-01-06 19:46:35,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:46:36,018 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[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_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[~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[~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[~send2~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[~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[~send3~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[~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[~send4~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[~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[~send5~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[~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[~send6~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[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~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~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[~alive1~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[~alive2~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[~alive3~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[~alive4~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[~alive5~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[~alive6~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[~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[~c1~0,] [2021-01-06 19:46:36,343 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-var-start-time.6.1.ufo.UNBOUNDED.pals.c[17005,17018] [2021-01-06 19:46:36,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:46:36,358 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[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_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[~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[~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[~send2~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[~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[~send3~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[~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[~send4~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[~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[~send5~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[~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[~send6~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[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~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~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[~alive1~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[~alive2~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[~alive3~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[~alive4~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[~alive5~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[~alive6~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[~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[~c1~0,] [2021-01-06 19:46:36,479 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-var-start-time.6.1.ufo.UNBOUNDED.pals.c[17005,17018] [2021-01-06 19:46:36,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:46:36,518 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:46:36,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:36 WrapperNode [2021-01-06 19:46:36,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:46:36,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:46:36,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:46:36,522 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:46:36,530 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:46:36" (1/1) ... [2021-01-06 19:46:36,556 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:46:36" (1/1) ... [2021-01-06 19:46:36,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:46:36,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:46:36,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:46:36,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:46:36,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:36" (1/1) ... [2021-01-06 19:46:36,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:36" (1/1) ... [2021-01-06 19:46:36,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:36" (1/1) ... [2021-01-06 19:46:36,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:36" (1/1) ... [2021-01-06 19:46:36,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:36" (1/1) ... [2021-01-06 19:46:36,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:36" (1/1) ... [2021-01-06 19:46:36,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:36" (1/1) ... [2021-01-06 19:46:36,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:46:36,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:46:36,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:46:36,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:46:36,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:36" (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:46:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:46:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:46:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:46:36,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:46:37,655 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:46:37,656 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2021-01-06 19:46:37,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:46:37 BoogieIcfgContainer [2021-01-06 19:46:37,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:46:37,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:46:37,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:46:37,670 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:46:37,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:46:35" (1/3) ... [2021-01-06 19:46:37,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1213a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:46:37, skipping insertion in model container [2021-01-06 19:46:37,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:36" (2/3) ... [2021-01-06 19:46:37,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1213a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:46:37, skipping insertion in model container [2021-01-06 19:46:37,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:46:37" (3/3) ... [2021-01-06 19:46:37,675 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c [2021-01-06 19:46:37,682 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:46:37,688 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:46:37,713 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:46:37,759 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:46:37,759 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:46:37,759 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:46:37,759 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:46:37,760 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:46:37,760 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:46:37,760 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:46:37,760 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:46:37,782 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2021-01-06 19:46:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-06 19:46:37,797 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:37,798 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] [2021-01-06 19:46:37,799 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:37,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:37,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1143199986, now seen corresponding path program 1 times [2021-01-06 19:46:37,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:37,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406396308] [2021-01-06 19:46:37,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:38,142 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:46:38,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406396308] [2021-01-06 19:46:38,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:38,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:46:38,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22182453] [2021-01-06 19:46:38,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:46:38,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:38,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:46:38,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:46:38,167 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 5 states. [2021-01-06 19:46:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:38,294 INFO L93 Difference]: Finished difference Result 245 states and 409 transitions. [2021-01-06 19:46:38,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:46:38,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2021-01-06 19:46:38,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:38,308 INFO L225 Difference]: With dead ends: 245 [2021-01-06 19:46:38,308 INFO L226 Difference]: Without dead ends: 142 [2021-01-06 19:46:38,312 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:46:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-01-06 19:46:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-01-06 19:46:38,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2021-01-06 19:46:38,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2021-01-06 19:46:38,405 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 38 [2021-01-06 19:46:38,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:38,405 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2021-01-06 19:46:38,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:46:38,407 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2021-01-06 19:46:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:46:38,417 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:38,417 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:38,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:46:38,418 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:38,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:38,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1334845828, now seen corresponding path program 1 times [2021-01-06 19:46:38,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:38,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606327675] [2021-01-06 19:46:38,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:38,622 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:46:38,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606327675] [2021-01-06 19:46:38,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:38,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:38,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056284051] [2021-01-06 19:46:38,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:38,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:38,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:38,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:38,627 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 3 states. [2021-01-06 19:46:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:38,657 INFO L93 Difference]: Finished difference Result 320 states and 486 transitions. [2021-01-06 19:46:38,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:38,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2021-01-06 19:46:38,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:38,660 INFO L225 Difference]: With dead ends: 320 [2021-01-06 19:46:38,661 INFO L226 Difference]: Without dead ends: 225 [2021-01-06 19:46:38,662 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:46:38,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-01-06 19:46:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2021-01-06 19:46:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2021-01-06 19:46:38,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 331 transitions. [2021-01-06 19:46:38,680 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 331 transitions. Word has length 78 [2021-01-06 19:46:38,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:38,681 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 331 transitions. [2021-01-06 19:46:38,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 331 transitions. [2021-01-06 19:46:38,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 19:46:38,682 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:38,683 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:38,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:46:38,683 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:38,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:38,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1690434603, now seen corresponding path program 1 times [2021-01-06 19:46:38,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:38,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479033742] [2021-01-06 19:46:38,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:38,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:46:38,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479033742] [2021-01-06 19:46:38,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:38,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:38,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458565139] [2021-01-06 19:46:38,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:38,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:38,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:38,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:38,848 INFO L87 Difference]: Start difference. First operand 223 states and 331 transitions. Second operand 3 states. [2021-01-06 19:46:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:38,896 INFO L93 Difference]: Finished difference Result 551 states and 859 transitions. [2021-01-06 19:46:38,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:38,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2021-01-06 19:46:38,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:38,900 INFO L225 Difference]: With dead ends: 551 [2021-01-06 19:46:38,901 INFO L226 Difference]: Without dead ends: 375 [2021-01-06 19:46:38,904 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:46:38,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-01-06 19:46:38,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2021-01-06 19:46:38,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2021-01-06 19:46:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 572 transitions. [2021-01-06 19:46:38,946 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 572 transitions. Word has length 79 [2021-01-06 19:46:38,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:38,947 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 572 transitions. [2021-01-06 19:46:38,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 572 transitions. [2021-01-06 19:46:38,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:46:38,948 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:38,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:38,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:46:38,949 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:38,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:38,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1185859852, now seen corresponding path program 1 times [2021-01-06 19:46:38,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:38,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381634077] [2021-01-06 19:46:38,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:39,046 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:46:39,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381634077] [2021-01-06 19:46:39,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:39,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:39,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008123615] [2021-01-06 19:46:39,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:39,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:39,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:39,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:39,052 INFO L87 Difference]: Start difference. First operand 373 states and 572 transitions. Second operand 3 states. [2021-01-06 19:46:39,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:39,085 INFO L93 Difference]: Finished difference Result 977 states and 1542 transitions. [2021-01-06 19:46:39,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:39,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2021-01-06 19:46:39,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:39,089 INFO L225 Difference]: With dead ends: 977 [2021-01-06 19:46:39,090 INFO L226 Difference]: Without dead ends: 651 [2021-01-06 19:46:39,091 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:46:39,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2021-01-06 19:46:39,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649. [2021-01-06 19:46:39,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2021-01-06 19:46:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1012 transitions. [2021-01-06 19:46:39,119 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1012 transitions. Word has length 80 [2021-01-06 19:46:39,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:39,119 INFO L481 AbstractCegarLoop]: Abstraction has 649 states and 1012 transitions. [2021-01-06 19:46:39,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1012 transitions. [2021-01-06 19:46:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 19:46:39,120 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:39,120 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:39,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:46:39,121 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:39,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:39,121 INFO L82 PathProgramCache]: Analyzing trace with hash 600169947, now seen corresponding path program 1 times [2021-01-06 19:46:39,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:39,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012641100] [2021-01-06 19:46:39,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:39,286 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:46:39,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012641100] [2021-01-06 19:46:39,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:39,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:39,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456696944] [2021-01-06 19:46:39,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:39,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:39,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:39,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:39,290 INFO L87 Difference]: Start difference. First operand 649 states and 1012 transitions. Second operand 3 states. [2021-01-06 19:46:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:39,357 INFO L93 Difference]: Finished difference Result 1757 states and 2782 transitions. [2021-01-06 19:46:39,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:39,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2021-01-06 19:46:39,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:39,365 INFO L225 Difference]: With dead ends: 1757 [2021-01-06 19:46:39,365 INFO L226 Difference]: Without dead ends: 1155 [2021-01-06 19:46:39,366 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:46:39,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2021-01-06 19:46:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1153. [2021-01-06 19:46:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2021-01-06 19:46:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1808 transitions. [2021-01-06 19:46:39,409 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1808 transitions. Word has length 81 [2021-01-06 19:46:39,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:39,409 INFO L481 AbstractCegarLoop]: Abstraction has 1153 states and 1808 transitions. [2021-01-06 19:46:39,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1808 transitions. [2021-01-06 19:46:39,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 19:46:39,410 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:39,410 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:39,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:46:39,411 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:39,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:39,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1228760164, now seen corresponding path program 1 times [2021-01-06 19:46:39,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:39,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633206128] [2021-01-06 19:46:39,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:39,500 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:46:39,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633206128] [2021-01-06 19:46:39,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:39,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:39,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348596878] [2021-01-06 19:46:39,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:39,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:39,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:39,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:39,503 INFO L87 Difference]: Start difference. First operand 1153 states and 1808 transitions. Second operand 3 states. [2021-01-06 19:46:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:39,567 INFO L93 Difference]: Finished difference Result 3173 states and 5010 transitions. [2021-01-06 19:46:39,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:39,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2021-01-06 19:46:39,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:39,580 INFO L225 Difference]: With dead ends: 3173 [2021-01-06 19:46:39,580 INFO L226 Difference]: Without dead ends: 2067 [2021-01-06 19:46:39,582 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:46:39,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2021-01-06 19:46:39,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2065. [2021-01-06 19:46:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2021-01-06 19:46:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 3232 transitions. [2021-01-06 19:46:39,657 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 3232 transitions. Word has length 82 [2021-01-06 19:46:39,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:39,659 INFO L481 AbstractCegarLoop]: Abstraction has 2065 states and 3232 transitions. [2021-01-06 19:46:39,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 3232 transitions. [2021-01-06 19:46:39,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-06 19:46:39,660 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:39,660 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:39,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:46:39,661 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:39,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:39,662 INFO L82 PathProgramCache]: Analyzing trace with hash -991115381, now seen corresponding path program 1 times [2021-01-06 19:46:39,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:39,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639930915] [2021-01-06 19:46:39,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:39,968 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:46:39,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639930915] [2021-01-06 19:46:39,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:39,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:46:39,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414963179] [2021-01-06 19:46:39,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:46:39,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:39,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:46:39,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:46:39,970 INFO L87 Difference]: Start difference. First operand 2065 states and 3232 transitions. Second operand 8 states. [2021-01-06 19:46:40,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:40,535 INFO L93 Difference]: Finished difference Result 12877 states and 20102 transitions. [2021-01-06 19:46:40,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 19:46:40,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2021-01-06 19:46:40,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:40,593 INFO L225 Difference]: With dead ends: 12877 [2021-01-06 19:46:40,593 INFO L226 Difference]: Without dead ends: 10859 [2021-01-06 19:46:40,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:46:40,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10859 states. [2021-01-06 19:46:41,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10859 to 10849. [2021-01-06 19:46:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2021-01-06 19:46:41,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 16880 transitions. [2021-01-06 19:46:41,196 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 16880 transitions. Word has length 83 [2021-01-06 19:46:41,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:41,197 INFO L481 AbstractCegarLoop]: Abstraction has 10849 states and 16880 transitions. [2021-01-06 19:46:41,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:46:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 16880 transitions. [2021-01-06 19:46:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 19:46:41,198 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:41,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:41,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:46:41,198 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:41,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:41,199 INFO L82 PathProgramCache]: Analyzing trace with hash 120110007, now seen corresponding path program 1 times [2021-01-06 19:46:41,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:41,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712984268] [2021-01-06 19:46:41,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:41,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712984268] [2021-01-06 19:46:41,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:41,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:41,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128848988] [2021-01-06 19:46:41,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:41,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:41,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:41,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:41,260 INFO L87 Difference]: Start difference. First operand 10849 states and 16880 transitions. Second operand 3 states. [2021-01-06 19:46:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:42,036 INFO L93 Difference]: Finished difference Result 29861 states and 46290 transitions. [2021-01-06 19:46:42,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:42,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2021-01-06 19:46:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:42,112 INFO L225 Difference]: With dead ends: 29861 [2021-01-06 19:46:42,112 INFO L226 Difference]: Without dead ends: 19059 [2021-01-06 19:46:42,131 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:46:42,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19059 states. [2021-01-06 19:46:43,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19059 to 19057. [2021-01-06 19:46:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19057 states. [2021-01-06 19:46:43,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19057 states to 19057 states and 29264 transitions. [2021-01-06 19:46:43,118 INFO L78 Accepts]: Start accepts. Automaton has 19057 states and 29264 transitions. Word has length 84 [2021-01-06 19:46:43,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:43,119 INFO L481 AbstractCegarLoop]: Abstraction has 19057 states and 29264 transitions. [2021-01-06 19:46:43,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:43,119 INFO L276 IsEmpty]: Start isEmpty. Operand 19057 states and 29264 transitions. [2021-01-06 19:46:43,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 19:46:43,120 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:43,121 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:43,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:46:43,121 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:43,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:43,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1337229271, now seen corresponding path program 1 times [2021-01-06 19:46:43,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:43,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346790616] [2021-01-06 19:46:43,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:43,289 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:46:43,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346790616] [2021-01-06 19:46:43,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:43,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:46:43,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072131191] [2021-01-06 19:46:43,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:46:43,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:43,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:46:43,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:46:43,298 INFO L87 Difference]: Start difference. First operand 19057 states and 29264 transitions. Second operand 8 states. [2021-01-06 19:46:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:46,508 INFO L93 Difference]: Finished difference Result 106847 states and 164503 transitions. [2021-01-06 19:46:46,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 19:46:46,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2021-01-06 19:46:46,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:46,785 INFO L225 Difference]: With dead ends: 106847 [2021-01-06 19:46:46,786 INFO L226 Difference]: Without dead ends: 87837 [2021-01-06 19:46:46,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:46:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87837 states. [2021-01-06 19:46:49,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87837 to 38065. [2021-01-06 19:46:49,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38065 states. [2021-01-06 19:46:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38065 states to 38065 states and 57712 transitions. [2021-01-06 19:46:49,992 INFO L78 Accepts]: Start accepts. Automaton has 38065 states and 57712 transitions. Word has length 84 [2021-01-06 19:46:49,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:49,992 INFO L481 AbstractCegarLoop]: Abstraction has 38065 states and 57712 transitions. [2021-01-06 19:46:49,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:46:49,992 INFO L276 IsEmpty]: Start isEmpty. Operand 38065 states and 57712 transitions. [2021-01-06 19:46:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:46:49,994 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:49,994 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] [2021-01-06 19:46:49,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:46:49,995 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:49,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:49,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1112242464, now seen corresponding path program 1 times [2021-01-06 19:46:49,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:49,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98569464] [2021-01-06 19:46:49,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:50,137 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:46:50,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98569464] [2021-01-06 19:46:50,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:50,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:46:50,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915022056] [2021-01-06 19:46:50,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:46:50,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:50,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:46:50,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:46:50,143 INFO L87 Difference]: Start difference. First operand 38065 states and 57712 transitions. Second operand 8 states. [2021-01-06 19:46:53,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:53,625 INFO L93 Difference]: Finished difference Result 79155 states and 118449 transitions. [2021-01-06 19:46:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:46:53,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2021-01-06 19:46:53,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:53,803 INFO L225 Difference]: With dead ends: 79155 [2021-01-06 19:46:53,804 INFO L226 Difference]: Without dead ends: 79153 [2021-01-06 19:46:53,822 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:46:53,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79153 states. [2021-01-06 19:46:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79153 to 40369. [2021-01-06 19:46:56,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40369 states. [2021-01-06 19:46:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40369 states to 40369 states and 60016 transitions. [2021-01-06 19:46:56,254 INFO L78 Accepts]: Start accepts. Automaton has 40369 states and 60016 transitions. Word has length 85 [2021-01-06 19:46:56,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:56,254 INFO L481 AbstractCegarLoop]: Abstraction has 40369 states and 60016 transitions. [2021-01-06 19:46:56,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:46:56,255 INFO L276 IsEmpty]: Start isEmpty. Operand 40369 states and 60016 transitions. [2021-01-06 19:46:56,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 19:46:56,256 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:56,256 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] [2021-01-06 19:46:56,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:46:56,257 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:56,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:56,257 INFO L82 PathProgramCache]: Analyzing trace with hash 172356833, now seen corresponding path program 1 times [2021-01-06 19:46:56,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:56,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87830317] [2021-01-06 19:46:56,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:56,338 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:46:56,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87830317] [2021-01-06 19:46:56,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:56,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:56,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864432357] [2021-01-06 19:46:56,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:56,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:56,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:56,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:56,340 INFO L87 Difference]: Start difference. First operand 40369 states and 60016 transitions. Second operand 3 states. [2021-01-06 19:46:58,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:58,419 INFO L93 Difference]: Finished difference Result 99063 states and 147412 transitions. [2021-01-06 19:46:58,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:58,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2021-01-06 19:46:58,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:58,524 INFO L225 Difference]: With dead ends: 99063 [2021-01-06 19:46:58,525 INFO L226 Difference]: Without dead ends: 58741 [2021-01-06 19:46:58,581 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:46:58,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58741 states. [2021-01-06 19:47:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58741 to 58387. [2021-01-06 19:47:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58387 states. [2021-01-06 19:47:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58387 states to 58387 states and 86386 transitions. [2021-01-06 19:47:01,409 INFO L78 Accepts]: Start accepts. Automaton has 58387 states and 86386 transitions. Word has length 86 [2021-01-06 19:47:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:47:01,409 INFO L481 AbstractCegarLoop]: Abstraction has 58387 states and 86386 transitions. [2021-01-06 19:47:01,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:47:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 58387 states and 86386 transitions. [2021-01-06 19:47:01,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 19:47:01,441 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:47:01,442 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] [2021-01-06 19:47:01,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:47:01,442 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:47:01,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:47:01,443 INFO L82 PathProgramCache]: Analyzing trace with hash 668753880, now seen corresponding path program 1 times [2021-01-06 19:47:01,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:47:01,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220083667] [2021-01-06 19:47:01,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:47:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:47:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:47:01,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220083667] [2021-01-06 19:47:01,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804233489] [2021-01-06 19:47:01,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:47:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:47:01,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 19:47:01,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:47:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:47:02,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:47:02,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2021-01-06 19:47:02,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47736288] [2021-01-06 19:47:02,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 19:47:02,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:47:02,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 19:47:02,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-01-06 19:47:02,234 INFO L87 Difference]: Start difference. First operand 58387 states and 86386 transitions. Second operand 12 states. [2021-01-06 19:47:25,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:47:25,243 INFO L93 Difference]: Finished difference Result 482131 states and 707378 transitions. [2021-01-06 19:47:25,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-01-06 19:47:25,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2021-01-06 19:47:25,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:47:26,124 INFO L225 Difference]: With dead ends: 482131 [2021-01-06 19:47:26,124 INFO L226 Difference]: Without dead ends: 423793 [2021-01-06 19:47:26,555 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=666, Invalid=2640, Unknown=0, NotChecked=0, Total=3306 [2021-01-06 19:47:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423793 states. [2021-01-06 19:47:39,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423793 to 212131. [2021-01-06 19:47:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212131 states. [2021-01-06 19:47:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212131 states to 212131 states and 309698 transitions. [2021-01-06 19:47:39,980 INFO L78 Accepts]: Start accepts. Automaton has 212131 states and 309698 transitions. Word has length 118 [2021-01-06 19:47:39,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:47:39,981 INFO L481 AbstractCegarLoop]: Abstraction has 212131 states and 309698 transitions. [2021-01-06 19:47:39,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 19:47:39,981 INFO L276 IsEmpty]: Start isEmpty. Operand 212131 states and 309698 transitions. [2021-01-06 19:47:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 19:47:40,054 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:47:40,055 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:47:40,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-06 19:47:40,271 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:47:40,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:47:40,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1707736999, now seen corresponding path program 1 times [2021-01-06 19:47:40,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:47:40,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131572855] [2021-01-06 19:47:40,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:47:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:47:40,355 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:47:40,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131572855] [2021-01-06 19:47:40,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:47:40,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:47:40,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457388507] [2021-01-06 19:47:40,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:47:40,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:47:40,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:47:40,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:47:40,363 INFO L87 Difference]: Start difference. First operand 212131 states and 309698 transitions. Second operand 3 states. [2021-01-06 19:47:56,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:47:56,736 INFO L93 Difference]: Finished difference Result 534472 states and 780774 transitions. [2021-01-06 19:47:56,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:47:56,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2021-01-06 19:47:56,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:47:57,529 INFO L225 Difference]: With dead ends: 534472 [2021-01-06 19:47:57,529 INFO L226 Difference]: Without dead ends: 349574 [2021-01-06 19:47:57,694 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:47:57,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349574 states. [2021-01-06 19:48:16,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349574 to 349572. [2021-01-06 19:48:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349572 states. [2021-01-06 19:48:17,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349572 states to 349572 states and 506180 transitions. [2021-01-06 19:48:17,295 INFO L78 Accepts]: Start accepts. Automaton has 349572 states and 506180 transitions. Word has length 118 [2021-01-06 19:48:17,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:48:17,296 INFO L481 AbstractCegarLoop]: Abstraction has 349572 states and 506180 transitions. [2021-01-06 19:48:17,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:48:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 349572 states and 506180 transitions. [2021-01-06 19:48:17,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 19:48:17,376 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:48:17,376 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:48:17,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:48:17,377 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:48:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:48:17,377 INFO L82 PathProgramCache]: Analyzing trace with hash 322125977, now seen corresponding path program 1 times [2021-01-06 19:48:17,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:48:17,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67371620] [2021-01-06 19:48:17,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:48:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:48:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:48:17,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67371620] [2021-01-06 19:48:17,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:48:17,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:48:17,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805899979] [2021-01-06 19:48:17,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:48:17,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:48:17,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:48:17,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:48:17,449 INFO L87 Difference]: Start difference. First operand 349572 states and 506180 transitions. Second operand 3 states.