/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.BOUNDED-12.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:46:25,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:46:25,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:46:25,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:46:25,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:46:25,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:46:25,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:46:25,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:46:25,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:46:25,269 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:46:25,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:46:25,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:46:25,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:46:25,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:46:25,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:46:25,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:46:25,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:46:25,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:46:25,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:46:25,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:46:25,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:46:25,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:46:25,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:46:25,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:46:25,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:46:25,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:46:25,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:46:25,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:46:25,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:46:25,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:46:25,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:46:25,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:46:25,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:46:25,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:46:25,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:46:25,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:46:25,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:46:25,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:46:25,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:46:25,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:46:25,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:46:25,351 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:25,403 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:46:25,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:46:25,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:46:25,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:46:25,409 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:46:25,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:46:25,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:46:25,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:46:25,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:46:25,410 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:46:25,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:46:25,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:46:25,412 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:46:25,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:46:25,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:46:25,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:46:25,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:46:25,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:46:25,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:46:25,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:46:25,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:46:25,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:46:25,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:46:25,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:46:25,415 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:46:25,415 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:25,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:46:25,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:46:25,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:46:25,926 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:46:25,927 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:46:25,928 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.BOUNDED-12.pals.c [2021-01-06 19:46:26,008 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b3d67531a/c4ee1b3bdcfc49bb9e29c3d84f47931b/FLAGe4970dbd2 [2021-01-06 19:46:26,658 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:46:26,659 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2021-01-06 19:46:26,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b3d67531a/c4ee1b3bdcfc49bb9e29c3d84f47931b/FLAGe4970dbd2 [2021-01-06 19:46:26,997 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b3d67531a/c4ee1b3bdcfc49bb9e29c3d84f47931b [2021-01-06 19:46:27,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:46:27,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:46:27,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:46:27,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:46:27,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:46:27,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:46:26" (1/1) ... [2021-01-06 19:46:27,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3ebf3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:27, skipping insertion in model container [2021-01-06 19:46:27,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:46:26" (1/1) ... [2021-01-06 19:46:27,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:46:27,109 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~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:27,480 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.BOUNDED-12.pals.c[16977,16990] [2021-01-06 19:46:27,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:46:27,509 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~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:27,635 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.BOUNDED-12.pals.c[16977,16990] [2021-01-06 19:46:27,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:46:27,679 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:46:27,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:27 WrapperNode [2021-01-06 19:46:27,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:46:27,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:46:27,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:46:27,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:46:27,692 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:27" (1/1) ... [2021-01-06 19:46:27,707 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:27" (1/1) ... [2021-01-06 19:46:27,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:46:27,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:46:27,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:46:27,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:46:27,769 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:27" (1/1) ... [2021-01-06 19:46:27,769 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:27" (1/1) ... [2021-01-06 19:46:27,784 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:27" (1/1) ... [2021-01-06 19:46:27,785 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:27" (1/1) ... [2021-01-06 19:46:27,808 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:27" (1/1) ... [2021-01-06 19:46:27,827 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:27" (1/1) ... [2021-01-06 19:46:27,837 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:27" (1/1) ... [2021-01-06 19:46:27,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:46:27,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:46:27,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:46:27,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:46:27,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:27" (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:27,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:46:27,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:46:27,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:46:27,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:46:28,855 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:46:28,856 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2021-01-06 19:46:28,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:46:28 BoogieIcfgContainer [2021-01-06 19:46:28,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:46:28,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:46:28,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:46:28,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:46:28,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:46:26" (1/3) ... [2021-01-06 19:46:28,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb6ca1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:46:28, skipping insertion in model container [2021-01-06 19:46:28,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:27" (2/3) ... [2021-01-06 19:46:28,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb6ca1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:46:28, skipping insertion in model container [2021-01-06 19:46:28,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:46:28" (3/3) ... [2021-01-06 19:46:28,869 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2021-01-06 19:46:28,876 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:46:28,882 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:46:28,912 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:46:28,942 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:46:28,942 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:46:28,942 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:46:28,942 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:46:28,942 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:46:28,943 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:46:28,943 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:46:28,943 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:46:28,963 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2021-01-06 19:46:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:46:28,972 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:28,973 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] [2021-01-06 19:46:28,974 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:28,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:28,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1929732074, now seen corresponding path program 1 times [2021-01-06 19:46:28,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:28,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955706146] [2021-01-06 19:46:28,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:29,291 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:29,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955706146] [2021-01-06 19:46:29,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:29,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:46:29,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881908540] [2021-01-06 19:46:29,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:46:29,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:29,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:46:29,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:46:29,330 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 5 states. [2021-01-06 19:46:29,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:29,544 INFO L93 Difference]: Finished difference Result 247 states and 408 transitions. [2021-01-06 19:46:29,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:46:29,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2021-01-06 19:46:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:29,568 INFO L225 Difference]: With dead ends: 247 [2021-01-06 19:46:29,569 INFO L226 Difference]: Without dead ends: 141 [2021-01-06 19:46:29,576 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:29,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-01-06 19:46:29,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-01-06 19:46:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2021-01-06 19:46:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 198 transitions. [2021-01-06 19:46:29,659 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 198 transitions. Word has length 37 [2021-01-06 19:46:29,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:29,660 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 198 transitions. [2021-01-06 19:46:29,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:46:29,660 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 198 transitions. [2021-01-06 19:46:29,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 19:46:29,673 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:29,673 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] [2021-01-06 19:46:29,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:46:29,675 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:29,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:29,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2008203596, now seen corresponding path program 1 times [2021-01-06 19:46:29,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:29,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380172890] [2021-01-06 19:46:29,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:29,959 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:29,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380172890] [2021-01-06 19:46:29,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:29,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:29,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954580818] [2021-01-06 19:46:29,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:29,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:29,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:29,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:29,966 INFO L87 Difference]: Start difference. First operand 141 states and 198 transitions. Second operand 3 states. [2021-01-06 19:46:30,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:30,025 INFO L93 Difference]: Finished difference Result 317 states and 480 transitions. [2021-01-06 19:46:30,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:30,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2021-01-06 19:46:30,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:30,033 INFO L225 Difference]: With dead ends: 317 [2021-01-06 19:46:30,033 INFO L226 Difference]: Without dead ends: 223 [2021-01-06 19:46:30,037 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:30,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-01-06 19:46:30,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2021-01-06 19:46:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2021-01-06 19:46:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 327 transitions. [2021-01-06 19:46:30,082 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 327 transitions. Word has length 77 [2021-01-06 19:46:30,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:30,083 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 327 transitions. [2021-01-06 19:46:30,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:30,084 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 327 transitions. [2021-01-06 19:46:30,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:46:30,088 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:30,088 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:30,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:46:30,089 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:30,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:30,092 INFO L82 PathProgramCache]: Analyzing trace with hash 823495780, now seen corresponding path program 1 times [2021-01-06 19:46:30,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:30,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648958275] [2021-01-06 19:46:30,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:30,254 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:30,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648958275] [2021-01-06 19:46:30,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:30,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:30,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409142343] [2021-01-06 19:46:30,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:30,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:30,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:30,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:30,258 INFO L87 Difference]: Start difference. First operand 221 states and 327 transitions. Second operand 3 states. [2021-01-06 19:46:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:30,289 INFO L93 Difference]: Finished difference Result 545 states and 847 transitions. [2021-01-06 19:46:30,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:30,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2021-01-06 19:46:30,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:30,293 INFO L225 Difference]: With dead ends: 545 [2021-01-06 19:46:30,293 INFO L226 Difference]: Without dead ends: 371 [2021-01-06 19:46:30,295 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:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-01-06 19:46:30,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2021-01-06 19:46:30,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2021-01-06 19:46:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 564 transitions. [2021-01-06 19:46:30,331 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 564 transitions. Word has length 78 [2021-01-06 19:46:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:30,332 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 564 transitions. [2021-01-06 19:46:30,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 564 transitions. [2021-01-06 19:46:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 19:46:30,336 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:30,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:30,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:46:30,336 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:30,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:30,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1276515004, now seen corresponding path program 1 times [2021-01-06 19:46:30,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:30,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820121459] [2021-01-06 19:46:30,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:30,495 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:30,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820121459] [2021-01-06 19:46:30,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:30,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:30,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106909233] [2021-01-06 19:46:30,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:30,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:30,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:30,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:30,498 INFO L87 Difference]: Start difference. First operand 369 states and 564 transitions. Second operand 3 states. [2021-01-06 19:46:30,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:30,534 INFO L93 Difference]: Finished difference Result 965 states and 1518 transitions. [2021-01-06 19:46:30,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:30,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2021-01-06 19:46:30,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:30,539 INFO L225 Difference]: With dead ends: 965 [2021-01-06 19:46:30,539 INFO L226 Difference]: Without dead ends: 643 [2021-01-06 19:46:30,540 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:30,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-01-06 19:46:30,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2021-01-06 19:46:30,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2021-01-06 19:46:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 996 transitions. [2021-01-06 19:46:30,567 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 996 transitions. Word has length 79 [2021-01-06 19:46:30,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:30,570 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 996 transitions. [2021-01-06 19:46:30,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 996 transitions. [2021-01-06 19:46:30,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:46:30,572 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:30,572 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:30,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:46:30,572 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:30,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:30,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1327982836, now seen corresponding path program 1 times [2021-01-06 19:46:30,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:30,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395953129] [2021-01-06 19:46:30,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:30,758 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:30,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395953129] [2021-01-06 19:46:30,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:30,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:30,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980789873] [2021-01-06 19:46:30,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:30,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:30,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:30,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:30,763 INFO L87 Difference]: Start difference. First operand 641 states and 996 transitions. Second operand 3 states. [2021-01-06 19:46:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:30,837 INFO L93 Difference]: Finished difference Result 1733 states and 2734 transitions. [2021-01-06 19:46:30,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:30,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2021-01-06 19:46:30,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:30,853 INFO L225 Difference]: With dead ends: 1733 [2021-01-06 19:46:30,853 INFO L226 Difference]: Without dead ends: 1139 [2021-01-06 19:46:30,855 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:30,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2021-01-06 19:46:30,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1137. [2021-01-06 19:46:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1137 states. [2021-01-06 19:46:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1776 transitions. [2021-01-06 19:46:30,912 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1776 transitions. Word has length 80 [2021-01-06 19:46:30,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:30,912 INFO L481 AbstractCegarLoop]: Abstraction has 1137 states and 1776 transitions. [2021-01-06 19:46:30,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1776 transitions. [2021-01-06 19:46:30,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 19:46:30,913 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:30,914 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:30,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:46:30,914 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:30,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:30,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1219881940, now seen corresponding path program 1 times [2021-01-06 19:46:30,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:30,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958243165] [2021-01-06 19:46:30,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:30,991 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:30,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958243165] [2021-01-06 19:46:30,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:30,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:30,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885157866] [2021-01-06 19:46:30,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:30,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:30,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:30,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:30,994 INFO L87 Difference]: Start difference. First operand 1137 states and 1776 transitions. Second operand 3 states. [2021-01-06 19:46:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:31,074 INFO L93 Difference]: Finished difference Result 3125 states and 4914 transitions. [2021-01-06 19:46:31,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:31,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2021-01-06 19:46:31,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:31,086 INFO L225 Difference]: With dead ends: 3125 [2021-01-06 19:46:31,086 INFO L226 Difference]: Without dead ends: 2035 [2021-01-06 19:46:31,089 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:31,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2021-01-06 19:46:31,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 2033. [2021-01-06 19:46:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2033 states. [2021-01-06 19:46:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 3168 transitions. [2021-01-06 19:46:31,165 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 3168 transitions. Word has length 81 [2021-01-06 19:46:31,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:31,166 INFO L481 AbstractCegarLoop]: Abstraction has 2033 states and 3168 transitions. [2021-01-06 19:46:31,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:31,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 3168 transitions. [2021-01-06 19:46:31,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 19:46:31,167 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:31,167 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:31,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:46:31,168 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:31,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:31,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1035004540, now seen corresponding path program 1 times [2021-01-06 19:46:31,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:31,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088201448] [2021-01-06 19:46:31,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:31,240 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:31,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088201448] [2021-01-06 19:46:31,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:31,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:31,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826677033] [2021-01-06 19:46:31,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:31,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:31,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:31,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:31,243 INFO L87 Difference]: Start difference. First operand 2033 states and 3168 transitions. Second operand 3 states. [2021-01-06 19:46:31,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:31,395 INFO L93 Difference]: Finished difference Result 5621 states and 8770 transitions. [2021-01-06 19:46:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:31,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2021-01-06 19:46:31,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:31,416 INFO L225 Difference]: With dead ends: 5621 [2021-01-06 19:46:31,417 INFO L226 Difference]: Without dead ends: 3635 [2021-01-06 19:46:31,424 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:31,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3635 states. [2021-01-06 19:46:31,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3635 to 3633. [2021-01-06 19:46:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3633 states. [2021-01-06 19:46:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 5616 transitions. [2021-01-06 19:46:31,595 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 5616 transitions. Word has length 82 [2021-01-06 19:46:31,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:31,595 INFO L481 AbstractCegarLoop]: Abstraction has 3633 states and 5616 transitions. [2021-01-06 19:46:31,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 5616 transitions. [2021-01-06 19:46:31,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-06 19:46:31,596 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:31,597 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:31,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:46:31,597 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:31,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:31,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1846622820, now seen corresponding path program 1 times [2021-01-06 19:46:31,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:31,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832423585] [2021-01-06 19:46:31,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:31,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832423585] [2021-01-06 19:46:31,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:31,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:46:31,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223338391] [2021-01-06 19:46:31,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:46:31,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:31,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:46:31,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:46:31,947 INFO L87 Difference]: Start difference. First operand 3633 states and 5616 transitions. Second operand 8 states. [2021-01-06 19:46:32,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:32,963 INFO L93 Difference]: Finished difference Result 22653 states and 34710 transitions. [2021-01-06 19:46:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 19:46:32,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2021-01-06 19:46:32,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:33,084 INFO L225 Difference]: With dead ends: 22653 [2021-01-06 19:46:33,085 INFO L226 Difference]: Without dead ends: 19067 [2021-01-06 19:46:33,096 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:33,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19067 states. [2021-01-06 19:46:34,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19067 to 19057. [2021-01-06 19:46:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19057 states. [2021-01-06 19:46:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19057 states to 19057 states and 29072 transitions. [2021-01-06 19:46:34,215 INFO L78 Accepts]: Start accepts. Automaton has 19057 states and 29072 transitions. Word has length 83 [2021-01-06 19:46:34,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:34,215 INFO L481 AbstractCegarLoop]: Abstraction has 19057 states and 29072 transitions. [2021-01-06 19:46:34,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:46:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 19057 states and 29072 transitions. [2021-01-06 19:46:34,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 19:46:34,216 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:34,217 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:34,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:46:34,217 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:34,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:34,218 INFO L82 PathProgramCache]: Analyzing trace with hash -927768561, now seen corresponding path program 1 times [2021-01-06 19:46:34,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:34,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073770086] [2021-01-06 19:46:34,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:34,416 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:34,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073770086] [2021-01-06 19:46:34,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:34,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:46:34,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466306076] [2021-01-06 19:46:34,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:46:34,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:34,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:46:34,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:46:34,419 INFO L87 Difference]: Start difference. First operand 19057 states and 29072 transitions. Second operand 8 states. [2021-01-06 19:46:37,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:37,621 INFO L93 Difference]: Finished difference Result 106847 states and 163447 transitions. [2021-01-06 19:46:37,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 19:46:37,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2021-01-06 19:46:37,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:37,905 INFO L225 Difference]: With dead ends: 106847 [2021-01-06 19:46:37,905 INFO L226 Difference]: Without dead ends: 87837 [2021-01-06 19:46:37,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:46:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87837 states. [2021-01-06 19:46:40,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87837 to 38065. [2021-01-06 19:46:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38065 states. [2021-01-06 19:46:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38065 states to 38065 states and 57328 transitions. [2021-01-06 19:46:41,008 INFO L78 Accepts]: Start accepts. Automaton has 38065 states and 57328 transitions. Word has length 84 [2021-01-06 19:46:41,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:41,008 INFO L481 AbstractCegarLoop]: Abstraction has 38065 states and 57328 transitions. [2021-01-06 19:46:41,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:46:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 38065 states and 57328 transitions. [2021-01-06 19:46:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:46:41,009 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:41,010 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:41,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:46:41,010 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:41,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:41,011 INFO L82 PathProgramCache]: Analyzing trace with hash 920622579, now seen corresponding path program 1 times [2021-01-06 19:46:41,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:41,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617569246] [2021-01-06 19:46:41,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:41,159 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,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617569246] [2021-01-06 19:46:41,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:41,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:46:41,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138339805] [2021-01-06 19:46:41,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:46:41,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:41,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:46:41,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:46:41,162 INFO L87 Difference]: Start difference. First operand 38065 states and 57328 transitions. Second operand 8 states. [2021-01-06 19:46:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:44,209 INFO L93 Difference]: Finished difference Result 79155 states and 117681 transitions. [2021-01-06 19:46:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:46:44,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2021-01-06 19:46:44,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:44,423 INFO L225 Difference]: With dead ends: 79155 [2021-01-06 19:46:44,423 INFO L226 Difference]: Without dead ends: 79153 [2021-01-06 19:46:44,450 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:44,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79153 states. [2021-01-06 19:46:46,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79153 to 40369. [2021-01-06 19:46:46,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40369 states. [2021-01-06 19:46:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40369 states to 40369 states and 59632 transitions. [2021-01-06 19:46:46,821 INFO L78 Accepts]: Start accepts. Automaton has 40369 states and 59632 transitions. Word has length 85 [2021-01-06 19:46:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:46,821 INFO L481 AbstractCegarLoop]: Abstraction has 40369 states and 59632 transitions. [2021-01-06 19:46:46,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:46:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 40369 states and 59632 transitions. [2021-01-06 19:46:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 19:46:46,822 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:46,823 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:46,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:46:46,823 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:46,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:46,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1472892313, now seen corresponding path program 1 times [2021-01-06 19:46:46,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:46,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248319199] [2021-01-06 19:46:46,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:46,881 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:46,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248319199] [2021-01-06 19:46:46,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:46,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:46,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735783017] [2021-01-06 19:46:46,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:46,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:46,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:46,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:46,884 INFO L87 Difference]: Start difference. First operand 40369 states and 59632 transitions. Second operand 3 states. [2021-01-06 19:46:49,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:49,192 INFO L93 Difference]: Finished difference Result 98711 states and 145940 transitions. [2021-01-06 19:46:49,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:49,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2021-01-06 19:46:49,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:49,318 INFO L225 Difference]: With dead ends: 98711 [2021-01-06 19:46:49,319 INFO L226 Difference]: Without dead ends: 58389 [2021-01-06 19:46:49,386 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:49,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58389 states. [2021-01-06 19:46:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58389 to 58387. [2021-01-06 19:46:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58387 states. [2021-01-06 19:46:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58387 states to 58387 states and 86002 transitions. [2021-01-06 19:46:52,194 INFO L78 Accepts]: Start accepts. Automaton has 58387 states and 86002 transitions. Word has length 86 [2021-01-06 19:46:52,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:52,195 INFO L481 AbstractCegarLoop]: Abstraction has 58387 states and 86002 transitions. [2021-01-06 19:46:52,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:52,195 INFO L276 IsEmpty]: Start isEmpty. Operand 58387 states and 86002 transitions. [2021-01-06 19:46:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 19:46:52,229 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:52,229 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] [2021-01-06 19:46:52,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:46:52,230 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:52,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:52,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1072838691, now seen corresponding path program 1 times [2021-01-06 19:46:52,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:52,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11843025] [2021-01-06 19:46:52,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:52,705 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:46:52,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11843025] [2021-01-06 19:46:52,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382357302] [2021-01-06 19:46:52,707 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:46:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:52,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 11 conjunts are in the unsatisfiable core [2021-01-06 19:46:52,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:46:53,226 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:46:53,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:46:53,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 7 [2021-01-06 19:46:53,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685597748] [2021-01-06 19:46:53,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:46:53,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:53,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:46:53,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:46:53,231 INFO L87 Difference]: Start difference. First operand 58387 states and 86002 transitions. Second operand 7 states. [2021-01-06 19:46:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:57,821 INFO L93 Difference]: Finished difference Result 144430 states and 213468 transitions. [2021-01-06 19:46:57,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:46:57,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2021-01-06 19:46:57,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:58,218 INFO L225 Difference]: With dead ends: 144430 [2021-01-06 19:46:58,218 INFO L226 Difference]: Without dead ends: 104108 [2021-01-06 19:46:58,283 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:46:58,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104108 states. [2021-01-06 19:47:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104108 to 96659. [2021-01-06 19:47:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96659 states. [2021-01-06 19:47:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96659 states to 96659 states and 141874 transitions. [2021-01-06 19:47:03,138 INFO L78 Accepts]: Start accepts. Automaton has 96659 states and 141874 transitions. Word has length 117 [2021-01-06 19:47:03,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:47:03,138 INFO L481 AbstractCegarLoop]: Abstraction has 96659 states and 141874 transitions. [2021-01-06 19:47:03,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:47:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 96659 states and 141874 transitions. [2021-01-06 19:47:03,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 19:47:03,169 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:47:03,169 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:47:03,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-06 19:47:03,384 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:47:03,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:47:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1628565047, now seen corresponding path program 1 times [2021-01-06 19:47:03,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:47:03,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221853761] [2021-01-06 19:47:03,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:47:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:47:03,470 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:47:03,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221853761] [2021-01-06 19:47:03,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:47:03,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:47:03,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753049473] [2021-01-06 19:47:03,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:47:03,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:47:03,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:47:03,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:47:03,479 INFO L87 Difference]: Start difference. First operand 96659 states and 141874 transitions. Second operand 3 states. [2021-01-06 19:47:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:47:10,557 INFO L93 Difference]: Finished difference Result 257623 states and 377716 transitions. [2021-01-06 19:47:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:47:10,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2021-01-06 19:47:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:47:10,895 INFO L225 Difference]: With dead ends: 257623 [2021-01-06 19:47:10,895 INFO L226 Difference]: Without dead ends: 174101 [2021-01-06 19:47:11,164 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:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174101 states. [2021-01-06 19:47:19,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174101 to 174099. [2021-01-06 19:47:19,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174099 states. [2021-01-06 19:47:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174099 states to 174099 states and 253074 transitions. [2021-01-06 19:47:19,478 INFO L78 Accepts]: Start accepts. Automaton has 174099 states and 253074 transitions. Word has length 118 [2021-01-06 19:47:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:47:19,478 INFO L481 AbstractCegarLoop]: Abstraction has 174099 states and 253074 transitions. [2021-01-06 19:47:19,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:47:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 174099 states and 253074 transitions. [2021-01-06 19:47:19,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 19:47:19,525 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:47:19,526 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:47:19,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:47:19,526 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:47:19,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:47:19,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1618503993, now seen corresponding path program 1 times [2021-01-06 19:47:19,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:47:19,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736579324] [2021-01-06 19:47:19,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:47:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:47:19,688 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 19:47:19,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736579324] [2021-01-06 19:47:19,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:47:19,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:47:19,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63601182] [2021-01-06 19:47:19,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:47:19,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:47:19,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:47:19,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:47:19,690 INFO L87 Difference]: Start difference. First operand 174099 states and 253074 transitions. Second operand 8 states. [2021-01-06 19:47:35,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:47:35,889 INFO L93 Difference]: Finished difference Result 480433 states and 704057 transitions. [2021-01-06 19:47:35,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 19:47:35,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 118 [2021-01-06 19:47:35,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:47:36,835 INFO L225 Difference]: With dead ends: 480433 [2021-01-06 19:47:36,835 INFO L226 Difference]: Without dead ends: 398511 [2021-01-06 19:47:36,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:47:37,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398511 states. [2021-01-06 19:47:50,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398511 to 248547. [2021-01-06 19:47:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248547 states. [2021-01-06 19:47:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248547 states to 248547 states and 361170 transitions. [2021-01-06 19:47:51,206 INFO L78 Accepts]: Start accepts. Automaton has 248547 states and 361170 transitions. Word has length 118 [2021-01-06 19:47:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:47:51,206 INFO L481 AbstractCegarLoop]: Abstraction has 248547 states and 361170 transitions. [2021-01-06 19:47:51,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:47:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 248547 states and 361170 transitions. [2021-01-06 19:47:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 19:47:51,255 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:47:51,255 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:47:51,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:47:51,256 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:47:51,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:47:51,256 INFO L82 PathProgramCache]: Analyzing trace with hash -876083369, now seen corresponding path program 1 times [2021-01-06 19:47:51,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:47:51,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165410780] [2021-01-06 19:47:51,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:47:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:47:51,333 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:47:51,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165410780] [2021-01-06 19:47:51,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:47:51,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:47:51,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466030889] [2021-01-06 19:47:51,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:47:51,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:47:51,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:47:51,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:47:51,335 INFO L87 Difference]: Start difference. First operand 248547 states and 361170 transitions. Second operand 3 states. [2021-01-06 19:48:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:48:09,029 INFO L93 Difference]: Finished difference Result 606480 states and 880914 transitions. [2021-01-06 19:48:09,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:48:09,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2021-01-06 19:48:09,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:48:09,847 INFO L225 Difference]: With dead ends: 606480 [2021-01-06 19:48:09,848 INFO L226 Difference]: Without dead ends: 410638 [2021-01-06 19:48:10,066 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:48:10,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410638 states. [2021-01-06 19:48:30,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410638 to 393228. [2021-01-06 19:48:30,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393228 states. [2021-01-06 19:48:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393228 states to 393228 states and 566536 transitions. [2021-01-06 19:48:32,660 INFO L78 Accepts]: Start accepts. Automaton has 393228 states and 566536 transitions. Word has length 118 [2021-01-06 19:48:32,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:48:32,660 INFO L481 AbstractCegarLoop]: Abstraction has 393228 states and 566536 transitions. [2021-01-06 19:48:32,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:48:32,661 INFO L276 IsEmpty]: Start isEmpty. Operand 393228 states and 566536 transitions. [2021-01-06 19:48:32,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 19:48:32,729 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:48:32,729 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:48:32,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:48:32,729 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:48:32,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:48:32,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1916354679, now seen corresponding path program 1 times [2021-01-06 19:48:32,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:48:32,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237178368] [2021-01-06 19:48:32,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:48:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:48:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:48:32,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237178368] [2021-01-06 19:48:32,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:48:32,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:48:32,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510594138] [2021-01-06 19:48:32,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:48:32,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:48:32,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:48:32,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:48:32,905 INFO L87 Difference]: Start difference. First operand 393228 states and 566536 transitions. Second operand 3 states. [2021-01-06 19:48:59,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:48:59,788 INFO L93 Difference]: Finished difference Result 735818 states and 1059934 transitions. [2021-01-06 19:48:59,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:48:59,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2021-01-06 19:48:59,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:49:00,943 INFO L225 Difference]: With dead ends: 735818 [2021-01-06 19:49:00,944 INFO L226 Difference]: Without dead ends: 539016 [2021-01-06 19:49:01,211 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:49:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539016 states. [2021-01-06 19:49:27,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539016 to 497974. [2021-01-06 19:49:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497974 states. [2021-01-06 19:49:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497974 states to 497974 states and 710780 transitions. [2021-01-06 19:49:29,576 INFO L78 Accepts]: Start accepts. Automaton has 497974 states and 710780 transitions. Word has length 118 [2021-01-06 19:49:29,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:49:29,577 INFO L481 AbstractCegarLoop]: Abstraction has 497974 states and 710780 transitions. [2021-01-06 19:49:29,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:49:29,577 INFO L276 IsEmpty]: Start isEmpty. Operand 497974 states and 710780 transitions. [2021-01-06 19:49:29,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 19:49:29,687 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:49:29,687 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:49:29,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:49:29,688 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:49:29,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:49:29,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1951266553, now seen corresponding path program 1 times [2021-01-06 19:49:29,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:49:29,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525861456] [2021-01-06 19:49:29,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:49:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:49:29,779 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:49:29,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525861456] [2021-01-06 19:49:29,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:49:29,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:49:29,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773372025] [2021-01-06 19:49:29,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:49:29,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:49:29,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:49:29,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:49:29,781 INFO L87 Difference]: Start difference. First operand 497974 states and 710780 transitions. Second operand 3 states.