/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/concurrent_mult.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:32:20,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:32:20,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:32:20,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:32:20,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:32:20,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:32:20,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:32:20,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:32:20,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:32:20,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:32:20,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:32:20,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:32:20,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:32:20,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:32:20,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:32:20,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:32:20,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:32:20,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:32:20,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:32:20,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:32:20,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:32:20,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:32:20,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:32:20,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:32:20,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:32:20,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:32:20,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:32:20,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:32:20,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:32:20,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:32:20,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:32:20,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:32:20,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:32:20,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:32:20,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:32:20,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:32:20,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:32:20,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:32:20,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:32:20,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:32:20,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:32:20,194 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 20:32:20,224 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:32:20,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:32:20,225 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:32:20,225 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:32:20,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:32:20,226 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:32:20,226 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:32:20,226 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:32:20,226 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:32:20,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:32:20,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:32:20,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:32:20,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:32:20,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:32:20,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:32:20,227 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:32:20,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:32:20,227 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:32:20,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:32:20,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:32:20,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:32:20,228 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:32:20,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:32:20,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:32:20,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:32:20,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:32:20,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:32:20,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:32:20,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:32:20,229 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:32:20,229 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:32:20,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:32:20,229 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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/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 [2022-03-15 20:32:20,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:32:20,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:32:20,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:32:20,454 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 20:32:20,454 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 20:32:20,455 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/concurrent_mult.bpl [2022-03-15 20:32:20,455 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/concurrent_mult.bpl' [2022-03-15 20:32:20,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:32:20,474 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 20:32:20,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:32:20,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:32:20,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:32:20,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:20" (1/1) ... [2022-03-15 20:32:20,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:20" (1/1) ... [2022-03-15 20:32:20,493 INFO L137 Inliner]: procedures = 2, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 20:32:20,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:32:20,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:32:20,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:32:20,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:32:20,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:20" (1/1) ... [2022-03-15 20:32:20,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:20" (1/1) ... [2022-03-15 20:32:20,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:20" (1/1) ... [2022-03-15 20:32:20,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:20" (1/1) ... [2022-03-15 20:32:20,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:20" (1/1) ... [2022-03-15 20:32:20,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:20" (1/1) ... [2022-03-15 20:32:20,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:20" (1/1) ... [2022-03-15 20:32:20,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:32:20,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:32:20,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:32:20,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:32:20,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:20" (1/1) ... [2022-03-15 20:32:20,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:32:20,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:32:20,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 20:32:20,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 20:32:20,581 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mult given in one single declaration [2022-03-15 20:32:20,581 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2022-03-15 20:32:20,581 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2022-03-15 20:32:20,582 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 20:32:20,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:32:20,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:32:20,582 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 20:32:20,612 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:32:20,613 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:32:20,672 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:32:20,676 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:32:20,677 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 20:32:20,678 INFO L202 PluginConnector]: Adding new model concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:32:20 BoogieIcfgContainer [2022-03-15 20:32:20,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:32:20,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:32:20,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:32:20,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:32:20,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:20" (1/2) ... [2022-03-15 20:32:20,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651b2f9 and model type concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:32:20, skipping insertion in model container [2022-03-15 20:32:20,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:32:20" (2/2) ... [2022-03-15 20:32:20,683 INFO L111 eAbstractionObserver]: Analyzing ICFG concurrent_mult.bpl [2022-03-15 20:32:20,687 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:32:20,687 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:32:20,687 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 20:32:20,687 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:32:20,703 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_z not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,703 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_z not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,704 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,704 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,704 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,704 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_a not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,704 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,704 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_a not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,705 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,705 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_a not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,705 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,705 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_a not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,705 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_b not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,706 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_z not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,706 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_z not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,706 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_b not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,706 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_z not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,706 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_z not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,706 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,707 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,707 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,707 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,707 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_z not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,707 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_z not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,708 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,708 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,708 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,708 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_a not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,708 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,708 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_a not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,709 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,709 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_a not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,709 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,709 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_a not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,709 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_b not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,709 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_z not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,710 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_z not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,710 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_b not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,710 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_z not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,710 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_z not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,710 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,710 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,711 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,711 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,714 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_z not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,714 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,716 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_z not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,716 WARN L322 ript$VariableManager]: TermVariabe multThread1of1ForFork1_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:20,718 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 20:32:20,762 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:32:20,767 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:32:20,767 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 20:32:20,789 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:32:20,795 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 25 transitions, 66 flow [2022-03-15 20:32:20,797 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 25 transitions, 66 flow [2022-03-15 20:32:20,799 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 25 transitions, 66 flow [2022-03-15 20:32:20,837 INFO L129 PetriNetUnfolder]: 2/23 cut-off events. [2022-03-15 20:32:20,837 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 20:32:20,839 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 2/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2022-03-15 20:32:20,840 INFO L116 LiptonReduction]: Number of co-enabled transitions 126 [2022-03-15 20:32:21,001 INFO L131 LiptonReduction]: Checked pairs total: 92 [2022-03-15 20:32:21,001 INFO L133 LiptonReduction]: Total number of compositions: 10 [2022-03-15 20:32:21,006 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 15 transitions, 46 flow [2022-03-15 20:32:21,014 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:21,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:32:21,018 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:32:21,019 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:32:21,019 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:32:21,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:32:21,023 INFO L85 PathProgramCache]: Analyzing trace with hash 281138315, now seen corresponding path program 1 times [2022-03-15 20:32:21,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:32:21,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619313961] [2022-03-15 20:32:21,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:32:21,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:32:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:32:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:21,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:32:21,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619313961] [2022-03-15 20:32:21,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619313961] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:32:21,227 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:32:21,227 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:32:21,228 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [559039327] [2022-03-15 20:32:21,229 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:32:21,233 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:32:21,282 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 26 transitions. [2022-03-15 20:32:21,282 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:32:21,430 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [77#(and (<= 0 ULTIMATE.start_z1) (<= ULTIMATE.start_z1 0)), 78#(and (<= 0 multThread1of1ForFork1_z) (<= multThread1of1ForFork1_z 0))] [2022-03-15 20:32:21,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:32:21,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:32:21,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:32:21,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:32:21,449 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:21,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:32:21,613 INFO L93 Difference]: Finished difference Result 49 states and 89 transitions. [2022-03-15 20:32:21,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:32:21,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 20:32:21,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:32:21,621 INFO L225 Difference]: With dead ends: 49 [2022-03-15 20:32:21,622 INFO L226 Difference]: Without dead ends: 46 [2022-03-15 20:32:21,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:32:21,631 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:32:21,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 3 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:32:21,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-03-15 20:32:21,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 30. [2022-03-15 20:32:21,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:21,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2022-03-15 20:32:21,666 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 56 transitions. Word has length 10 [2022-03-15 20:32:21,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:32:21,666 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 56 transitions. [2022-03-15 20:32:21,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 56 transitions. [2022-03-15 20:32:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:32:21,669 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:32:21,669 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:32:21,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:32:21,669 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:32:21,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:32:21,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1104354772, now seen corresponding path program 1 times [2022-03-15 20:32:21,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:32:21,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292271158] [2022-03-15 20:32:21,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:32:21,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:32:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:32:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:21,826 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:32:21,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292271158] [2022-03-15 20:32:21,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292271158] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:32:21,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575255308] [2022-03-15 20:32:21,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:32:21,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:32:21,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:32:21,831 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:32:21,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 20:32:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:32:21,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:32:21,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:32:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:22,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:32:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:22,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575255308] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:32:22,328 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:32:22,328 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-03-15 20:32:22,329 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [122719546] [2022-03-15 20:32:22,329 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:32:22,330 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:32:22,334 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 33 transitions. [2022-03-15 20:32:22,335 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:32:22,583 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [281#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_b) (<= multThread1of1ForFork0_b multThread1of1ForFork1_z)), 283#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a))), 286#(and (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a)) (<= multThread1of1ForFork1_z multThread1of1ForFork0_b)), 284#(and (<= multThread1of1ForFork0_z ULTIMATE.start_y) (<= 0 multThread1of1ForFork0_z)), 282#(and (<= ULTIMATE.start_z1 multThread1of1ForFork1_a) (<= 0 ULTIMATE.start_z1)), 280#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z)), 279#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 285#(and (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) ULTIMATE.start_y) (<= 0 (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)))] [2022-03-15 20:32:22,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 20:32:22,583 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:32:22,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 20:32:22,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:32:22,584 INFO L87 Difference]: Start difference. First operand 30 states and 56 transitions. Second operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:32:23,422 INFO L93 Difference]: Finished difference Result 74 states and 133 transitions. [2022-03-15 20:32:23,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 20:32:23,422 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:32:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:32:23,423 INFO L225 Difference]: With dead ends: 74 [2022-03-15 20:32:23,423 INFO L226 Difference]: Without dead ends: 66 [2022-03-15 20:32:23,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=575, Invalid=2181, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 20:32:23,424 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 152 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:32:23,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 9 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:32:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-03-15 20:32:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 35. [2022-03-15 20:32:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 34 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 70 transitions. [2022-03-15 20:32:23,429 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 70 transitions. Word has length 11 [2022-03-15 20:32:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:32:23,430 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 70 transitions. [2022-03-15 20:32:23,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 70 transitions. [2022-03-15 20:32:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:32:23,430 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:32:23,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:32:23,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 20:32:23,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:32:23,648 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:32:23,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:32:23,648 INFO L85 PathProgramCache]: Analyzing trace with hash 217445737, now seen corresponding path program 1 times [2022-03-15 20:32:23,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:32:23,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944865264] [2022-03-15 20:32:23,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:32:23,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:32:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:32:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:23,759 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:32:23,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944865264] [2022-03-15 20:32:23,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944865264] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:32:23,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88251925] [2022-03-15 20:32:23,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:32:23,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:32:23,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:32:23,761 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:32:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:32:23,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:32:23,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:32:23,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 20:32:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:23,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:32:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:24,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88251925] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:32:24,059 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:32:24,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-03-15 20:32:24,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1446585095] [2022-03-15 20:32:24,059 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:32:24,059 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:32:24,062 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 33 transitions. [2022-03-15 20:32:24,062 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:32:24,316 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [560#(and (<= multThread1of1ForFork0_z (+ multThread1of1ForFork1_z multThread1of1ForFork1_b)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z)), 565#(and (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_a) (<= 0 (+ multThread1of1ForFork1_z multThread1of1ForFork1_b))), 557#(and (or (<= 0 multThread1of1ForFork1_z) (< 0 multThread1of1ForFork0_a)) (or (<= multThread1of1ForFork1_z 0) (< 0 multThread1of1ForFork0_a))), 559#(and (<= ULTIMATE.start_z1 (+ multThread1of1ForFork1_z multThread1of1ForFork1_b)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)), 561#(and (<= ULTIMATE.start_z1 multThread1of1ForFork1_b) (<= multThread1of1ForFork1_b ULTIMATE.start_z1)), 564#(and (<= multThread1of1ForFork0_z ULTIMATE.start_x) (<= (+ multThread1of1ForFork0_i ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a))), 537#(or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z))), 558#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_a) (<= 0 multThread1of1ForFork1_z)), 562#(and (<= multThread1of1ForFork1_b multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_b)), 563#(and (<= multThread1of1ForFork0_z ULTIMATE.start_x) (<= ULTIMATE.start_x multThread1of1ForFork0_z))] [2022-03-15 20:32:24,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 20:32:24,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:32:24,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 20:32:24,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:32:24,318 INFO L87 Difference]: Start difference. First operand 35 states and 70 transitions. Second operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:25,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:32:25,376 INFO L93 Difference]: Finished difference Result 82 states and 152 transitions. [2022-03-15 20:32:25,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 20:32:25,376 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:32:25,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:32:25,377 INFO L225 Difference]: With dead ends: 82 [2022-03-15 20:32:25,377 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 20:32:25,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=638, Invalid=2332, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 20:32:25,378 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 184 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:32:25,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 9 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:32:25,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 20:32:25,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 40. [2022-03-15 20:32:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 39 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:25,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 76 transitions. [2022-03-15 20:32:25,383 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 76 transitions. Word has length 11 [2022-03-15 20:32:25,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:32:25,383 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 76 transitions. [2022-03-15 20:32:25,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 76 transitions. [2022-03-15 20:32:25,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:32:25,384 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:32:25,384 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:32:25,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 20:32:25,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-03-15 20:32:25,600 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:32:25,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:32:25,601 INFO L85 PathProgramCache]: Analyzing trace with hash 854261163, now seen corresponding path program 2 times [2022-03-15 20:32:25,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:32:25,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652590087] [2022-03-15 20:32:25,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:32:25,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:32:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:32:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:25,702 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:32:25,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652590087] [2022-03-15 20:32:25,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652590087] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:32:25,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025453730] [2022-03-15 20:32:25,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:32:25,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:32:25,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:32:25,712 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:32:25,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 20:32:25,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:32:25,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:32:25,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 20:32:25,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:32:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:25,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:32:26,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:26,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025453730] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:32:26,151 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:32:26,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-03-15 20:32:26,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1549073803] [2022-03-15 20:32:26,151 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:32:26,152 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:32:26,153 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 40 transitions. [2022-03-15 20:32:26,153 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:32:26,542 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [879#(and (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) (* 2 ULTIMATE.start_y)) (<= 0 (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)))), 869#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 878#(and (<= 0 (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) (* 2 ULTIMATE.start_y))), 876#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z))), 871#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z)), 877#(and (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 2)) (<= (+ (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z))), 872#(and (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 2)) (<= (* multThread1of1ForFork0_b 2) multThread1of1ForFork1_z)), 874#(and (<= multThread1of1ForFork0_z (* 2 ULTIMATE.start_y)) (<= 0 multThread1of1ForFork0_z)), 873#(and (<= 0 ULTIMATE.start_z1) (<= ULTIMATE.start_z1 (* multThread1of1ForFork1_a 2))), 870#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z)), 875#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z)))] [2022-03-15 20:32:26,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:32:26,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:32:26,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:32:26,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 20:32:26,544 INFO L87 Difference]: Start difference. First operand 40 states and 76 transitions. Second operand has 23 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 22 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:27,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:32:27,915 INFO L93 Difference]: Finished difference Result 96 states and 175 transitions. [2022-03-15 20:32:27,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 20:32:27,916 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 22 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:32:27,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:32:27,916 INFO L225 Difference]: With dead ends: 96 [2022-03-15 20:32:27,916 INFO L226 Difference]: Without dead ends: 88 [2022-03-15 20:32:27,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=853, Invalid=3569, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 20:32:27,918 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 235 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:32:27,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 13 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:32:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-03-15 20:32:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 45. [2022-03-15 20:32:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 44 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 90 transitions. [2022-03-15 20:32:27,923 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 90 transitions. Word has length 12 [2022-03-15 20:32:27,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:32:27,923 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 90 transitions. [2022-03-15 20:32:27,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 22 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:27,923 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 90 transitions. [2022-03-15 20:32:27,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:32:27,923 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:32:27,924 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:32:27,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 20:32:28,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:32:28,124 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:32:28,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:32:28,125 INFO L85 PathProgramCache]: Analyzing trace with hash -32647872, now seen corresponding path program 1 times [2022-03-15 20:32:28,126 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:32:28,126 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317739551] [2022-03-15 20:32:28,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:32:28,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:32:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:32:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:28,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:32:28,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317739551] [2022-03-15 20:32:28,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317739551] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:32:28,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142666463] [2022-03-15 20:32:28,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:32:28,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:32:28,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:32:28,252 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:32:28,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 20:32:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:32:28,271 WARN L261 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 20:32:28,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:32:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:28,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:32:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:28,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142666463] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:32:28,785 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:32:28,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 20:32:28,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [531773287] [2022-03-15 20:32:28,785 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:32:28,786 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:32:28,788 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 42 transitions. [2022-03-15 20:32:28,788 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:32:29,487 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [1223#(and (or (< 1 multThread1of1ForFork0_a) (<= multThread1of1ForFork0_b multThread1of1ForFork1_z) (not (< 0 multThread1of1ForFork0_a))) (or (< 1 multThread1of1ForFork0_a) (<= multThread1of1ForFork1_z multThread1of1ForFork0_b) (not (< 0 multThread1of1ForFork0_a)))), 1227#(and (or (<= multThread1of1ForFork1_b multThread1of1ForFork0_z) (not (< 0 multThread1of1ForFork1_a))) (or (<= (+ multThread1of1ForFork0_z 1) (+ multThread1of1ForFork1_b multThread1of1ForFork1_a)) (not (< 0 multThread1of1ForFork1_a)))), 1226#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)) (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a))) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z))), 1230#(and (<= (+ multThread1of1ForFork0_i ULTIMATE.start_y ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a) (+ multThread1of1ForFork0_i ULTIMATE.start_y ULTIMATE.start_x))), 1234#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)) (not (< 0 multThread1of1ForFork0_a))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a) (+ multThread1of1ForFork1_i multThread1of1ForFork0_b multThread1of1ForFork0_a)) (not (< 0 multThread1of1ForFork0_a)))), 1221#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 1225#(and (or (not (< 0 multThread1of1ForFork1_a)) (<= (+ ULTIMATE.start_z1 1) (+ multThread1of1ForFork1_b multThread1of1ForFork1_a))) (or (not (< 0 multThread1of1ForFork1_a)) (<= multThread1of1ForFork1_b ULTIMATE.start_z1))), 1224#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i ULTIMATE.start_z1 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)))), 1229#(and (<= (+ multThread1of1ForFork0_z 1) (+ ULTIMATE.start_y ULTIMATE.start_x)) (<= (+ multThread1of1ForFork0_i ULTIMATE.start_y ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a 1))), 1232#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a multThread1of1ForFork0_i) (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a)))), 1231#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 1) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a)))), 1228#(and (or (<= (+ multThread1of1ForFork0_z 1) (+ ULTIMATE.start_y ULTIMATE.start_x)) (not (< 0 ULTIMATE.start_y))) (or (<= ULTIMATE.start_x multThread1of1ForFork0_z) (not (< 0 ULTIMATE.start_y)))), 1222#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 1233#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a)) (not (< 0 multThread1of1ForFork0_a))) (or (<= (+ multThread1of1ForFork1_z 1) (+ multThread1of1ForFork0_b multThread1of1ForFork0_a)) (not (< 0 multThread1of1ForFork0_a)))), 1220#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z))] [2022-03-15 20:32:29,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 20:32:29,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:32:29,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 20:32:29,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1850, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 20:32:29,489 INFO L87 Difference]: Start difference. First operand 45 states and 90 transitions. Second operand has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:37,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:32:37,428 INFO L93 Difference]: Finished difference Result 208 states and 325 transitions. [2022-03-15 20:32:37,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-15 20:32:37,428 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:32:37,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:32:37,430 INFO L225 Difference]: With dead ends: 208 [2022-03-15 20:32:37,430 INFO L226 Difference]: Without dead ends: 196 [2022-03-15 20:32:37,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4677 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2375, Invalid=14917, Unknown=0, NotChecked=0, Total=17292 [2022-03-15 20:32:37,434 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 556 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:32:37,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [556 Valid, 2 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:32:37,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-03-15 20:32:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 48. [2022-03-15 20:32:37,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 47 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:37,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 98 transitions. [2022-03-15 20:32:37,451 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 98 transitions. Word has length 12 [2022-03-15 20:32:37,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:32:37,451 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 98 transitions. [2022-03-15 20:32:37,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 98 transitions. [2022-03-15 20:32:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:32:37,453 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:32:37,453 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:32:37,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 20:32:37,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:32:37,667 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:32:37,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:32:37,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1757024181, now seen corresponding path program 2 times [2022-03-15 20:32:37,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:32:37,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225674446] [2022-03-15 20:32:37,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:32:37,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:32:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:32:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:37,807 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:32:37,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225674446] [2022-03-15 20:32:37,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225674446] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:32:37,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812284268] [2022-03-15 20:32:37,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:32:37,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:32:37,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:32:37,832 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:32:37,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 20:32:37,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:32:37,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:32:37,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 20:32:37,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:32:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:38,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:32:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:38,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812284268] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:32:38,259 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:32:38,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2022-03-15 20:32:38,260 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [9090365] [2022-03-15 20:32:38,260 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:32:38,260 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:32:38,262 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 40 transitions. [2022-03-15 20:32:38,262 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:32:38,624 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [1810#(and (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) (* multThread1of1ForFork0_a 2)) (<= 0 (+ multThread1of1ForFork1_z multThread1of1ForFork1_b))), 1809#(and (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_a 2)) (<= 0 multThread1of1ForFork1_z)), 1814#(and (<= (+ (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2))) (<= multThread1of1ForFork0_z (* 2 ULTIMATE.start_x))), 1780#(or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z))), 1813#(and (<= multThread1of1ForFork0_z (* 2 ULTIMATE.start_x)) (<= (* 2 ULTIMATE.start_x) multThread1of1ForFork0_z)), 1811#(and (<= ULTIMATE.start_z1 (* multThread1of1ForFork1_b 2)) (<= (* multThread1of1ForFork1_b 2) ULTIMATE.start_z1)), 1815#(and (<= 0 (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) (* multThread1of1ForFork0_a 2))), 1805#(and (<= multThread1of1ForFork0_z (+ multThread1of1ForFork1_z multThread1of1ForFork1_b)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z)), 1812#(and (<= (* multThread1of1ForFork1_b 2) multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z (* multThread1of1ForFork1_b 2))), 1808#(and (or (<= 0 multThread1of1ForFork1_z) (< 0 multThread1of1ForFork0_a)) (or (<= multThread1of1ForFork1_z 0) (< 0 multThread1of1ForFork0_a))), 1807#(and (<= multThread1of1ForFork0_z (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) multThread1of1ForFork0_z)), 1806#(and (<= ULTIMATE.start_z1 (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) ULTIMATE.start_z1)), 1804#(and (<= ULTIMATE.start_z1 (+ multThread1of1ForFork1_z multThread1of1ForFork1_b)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1))] [2022-03-15 20:32:38,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:32:38,625 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:32:38,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:32:38,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 20:32:38,625 INFO L87 Difference]: Start difference. First operand 48 states and 98 transitions. Second operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:32:39,968 INFO L93 Difference]: Finished difference Result 116 states and 218 transitions. [2022-03-15 20:32:39,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 20:32:39,968 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:32:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:32:39,969 INFO L225 Difference]: With dead ends: 116 [2022-03-15 20:32:39,969 INFO L226 Difference]: Without dead ends: 106 [2022-03-15 20:32:39,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=836, Invalid=3454, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 20:32:39,973 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 214 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:32:39,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 13 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:32:39,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-03-15 20:32:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 53. [2022-03-15 20:32:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 2.0) internal successors, (104), 52 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 104 transitions. [2022-03-15 20:32:39,985 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 104 transitions. Word has length 12 [2022-03-15 20:32:39,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:32:39,985 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 104 transitions. [2022-03-15 20:32:39,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:39,986 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 104 transitions. [2022-03-15 20:32:39,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:32:39,988 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:32:39,988 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:32:40,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 20:32:40,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:32:40,203 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:32:40,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:32:40,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1691293876, now seen corresponding path program 3 times [2022-03-15 20:32:40,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:32:40,205 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457400269] [2022-03-15 20:32:40,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:32:40,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:32:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:32:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:40,296 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:32:40,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457400269] [2022-03-15 20:32:40,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457400269] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:32:40,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007524233] [2022-03-15 20:32:40,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:32:40,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:32:40,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:32:40,298 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:32:40,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 20:32:40,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:32:40,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:32:40,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 20:32:40,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:32:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:40,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:32:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:40,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007524233] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:32:40,737 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:32:40,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-03-15 20:32:40,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1316677381] [2022-03-15 20:32:40,737 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:32:40,737 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:32:40,739 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2022-03-15 20:32:40,739 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:32:41,220 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [2208#(and (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z))), 2206#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z))), 2198#(and (<= 0 ULTIMATE.start_z1) (<= ULTIMATE.start_z1 (* multThread1of1ForFork1_a 3))), 2199#(and (<= multThread1of1ForFork0_z (* 3 ULTIMATE.start_y)) (<= 0 multThread1of1ForFork0_z)), 2204#(and (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) multThread1of1ForFork1_z)), 2211#(and (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) (* 3 ULTIMATE.start_y)) (<= 0 (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z))), 2203#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z)), 2205#(and (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 3)) (<= (* multThread1of1ForFork0_b 3) multThread1of1ForFork1_z)), 2201#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 2207#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z))), 2200#(and (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) (* 3 ULTIMATE.start_y)) (<= 0 (+ multThread1of1ForFork0_z multThread1of1ForFork0_b))), 2210#(and (<= 0 (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) (* 3 ULTIMATE.start_y))), 2202#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z)), 2209#(and (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 3)) (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z)))] [2022-03-15 20:32:41,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 20:32:41,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:32:41,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 20:32:41,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1748, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:32:41,222 INFO L87 Difference]: Start difference. First operand 53 states and 104 transitions. Second operand has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:43,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:32:43,151 INFO L93 Difference]: Finished difference Result 127 states and 236 transitions. [2022-03-15 20:32:43,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 20:32:43,151 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:32:43,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:32:43,152 INFO L225 Difference]: With dead ends: 127 [2022-03-15 20:32:43,152 INFO L226 Difference]: Without dead ends: 119 [2022-03-15 20:32:43,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1204, Invalid=5276, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 20:32:43,154 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 293 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:32:43,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 17 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:32:43,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-03-15 20:32:43,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 59. [2022-03-15 20:32:43,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 2.103448275862069) internal successors, (122), 58 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:43,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 122 transitions. [2022-03-15 20:32:43,157 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 122 transitions. Word has length 13 [2022-03-15 20:32:43,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:32:43,157 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 122 transitions. [2022-03-15 20:32:43,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:43,157 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 122 transitions. [2022-03-15 20:32:43,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:32:43,158 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:32:43,158 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:32:43,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 20:32:43,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:32:43,361 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:32:43,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:32:43,362 INFO L85 PathProgramCache]: Analyzing trace with hash 804384841, now seen corresponding path program 2 times [2022-03-15 20:32:43,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:32:43,363 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810173248] [2022-03-15 20:32:43,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:32:43,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:32:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:32:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:43,547 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:32:43,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810173248] [2022-03-15 20:32:43,548 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810173248] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:32:43,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947795252] [2022-03-15 20:32:43,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:32:43,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:32:43,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:32:43,549 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:32:43,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 20:32:43,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:32:43,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:32:43,569 WARN L261 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 20:32:43,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:32:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:43,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:32:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:44,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947795252] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:32:44,155 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:32:44,155 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2022-03-15 20:32:44,155 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [717667816] [2022-03-15 20:32:44,155 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:32:44,155 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:32:44,157 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 51 transitions. [2022-03-15 20:32:44,157 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:32:45,060 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [2643#(and (or (not (< 0 multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork0_z 2) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_b))) (or (<= multThread1of1ForFork1_b multThread1of1ForFork0_z) (not (< 0 multThread1of1ForFork1_a)))), 2654#(and (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b) (+ multThread1of1ForFork0_a (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)))) (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ 2 (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 2647#(and (<= (+ (* 2 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 2))) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 2)) (+ (* 2 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x))), 2649#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 1) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a)))), 2636#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 2638#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 2648#(and (or (not (< 1 multThread1of1ForFork0_a)) (<= (* multThread1of1ForFork0_b 2) multThread1of1ForFork1_z) (< 2 multThread1of1ForFork0_a)) (or (not (< 1 multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 2)) (< 2 multThread1of1ForFork0_a))), 2653#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z 2 (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2))))), 2641#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork0_z 2 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b))) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z))), 2637#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 2644#(and (or (not (< 0 ULTIMATE.start_y)) (<= (+ multThread1of1ForFork0_z 2) (+ (* 2 ULTIMATE.start_y) ULTIMATE.start_x))) (or (<= ULTIMATE.start_x multThread1of1ForFork0_z) (not (< 0 ULTIMATE.start_y)))), 2652#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a (* multThread1of1ForFork1_i 2) 1))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b 2 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 2640#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ 2 ULTIMATE.start_z1 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 2646#(and (<= (+ (* 2 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a 1)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a 1) (+ (* 2 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x))), 2642#(and (or (not (< 0 multThread1of1ForFork1_a)) (<= multThread1of1ForFork1_b ULTIMATE.start_z1)) (or (<= (+ 2 ULTIMATE.start_z1) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_b)) (not (< 0 multThread1of1ForFork1_a)))), 2639#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a))), 2645#(and (<= (+ (* 2 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a 2)) (<= (+ multThread1of1ForFork0_z 2) (+ (* 2 ULTIMATE.start_y) ULTIMATE.start_x))), 2651#(and (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z))) (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z 2) (+ multThread1of1ForFork0_a (* multThread1of1ForFork0_b 2))))), 2650#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 2) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 2))) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))))] [2022-03-15 20:32:45,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 20:32:45,060 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:32:45,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 20:32:45,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2500, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 20:32:45,061 INFO L87 Difference]: Start difference. First operand 59 states and 122 transitions. Second operand has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:57,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:32:57,085 INFO L93 Difference]: Finished difference Result 264 states and 415 transitions. [2022-03-15 20:32:57,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-03-15 20:32:57,086 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:32:57,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:32:57,090 INFO L225 Difference]: With dead ends: 264 [2022-03-15 20:32:57,090 INFO L226 Difference]: Without dead ends: 252 [2022-03-15 20:32:57,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7045 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=2929, Invalid=22193, Unknown=0, NotChecked=0, Total=25122 [2022-03-15 20:32:57,094 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 793 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2677 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 2677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:32:57,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [793 Valid, 3 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 2677 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:32:57,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-03-15 20:32:57,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 60. [2022-03-15 20:32:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.135593220338983) internal successors, (126), 59 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 126 transitions. [2022-03-15 20:32:57,103 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 126 transitions. Word has length 13 [2022-03-15 20:32:57,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:32:57,103 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 126 transitions. [2022-03-15 20:32:57,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:57,103 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 126 transitions. [2022-03-15 20:32:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:32:57,103 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:32:57,104 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:32:57,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 20:32:57,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:32:57,319 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:32:57,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:32:57,320 INFO L85 PathProgramCache]: Analyzing trace with hash -919991468, now seen corresponding path program 3 times [2022-03-15 20:32:57,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:32:57,321 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026091110] [2022-03-15 20:32:57,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:32:57,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:32:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:32:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:57,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:32:57,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026091110] [2022-03-15 20:32:57,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026091110] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:32:57,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306862507] [2022-03-15 20:32:57,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:32:57,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:32:57,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:32:57,464 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:32:57,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 20:32:57,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:32:57,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:32:57,487 WARN L261 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 20:32:57,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:32:57,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:57,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:32:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:58,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306862507] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:32:58,089 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:32:58,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2022-03-15 20:32:58,089 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [909137400] [2022-03-15 20:32:58,089 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:32:58,090 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:32:58,091 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 51 transitions. [2022-03-15 20:32:58,091 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:32:58,985 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [3376#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b 2) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2))) (not (< 0 multThread1of1ForFork0_a))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2)) (+ multThread1of1ForFork1_i multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2))) (not (< 0 multThread1of1ForFork0_a)))), 3364#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 3365#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z 2) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2))))), 3374#(and (<= (+ (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x) ULTIMATE.start_y) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2))) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2)) (+ (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x) ULTIMATE.start_y))), 3372#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)) (not (< 0 multThread1of1ForFork0_a))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a 1) (+ multThread1of1ForFork1_i multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2))) (not (< 0 multThread1of1ForFork0_a)))), 3360#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 3359#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i 2 ULTIMATE.start_z1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) ULTIMATE.start_z1))), 3363#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) multThread1of1ForFork0_z)) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z 2) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2))))), 3361#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 3368#(and (or (<= (* multThread1of1ForFork1_b 2) multThread1of1ForFork0_z) (not (< 1 multThread1of1ForFork1_a))) (or (<= (+ multThread1of1ForFork0_z 2) (+ multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2))) (not (< 1 multThread1of1ForFork1_a)))), 3358#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i ULTIMATE.start_z1 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)))), 3367#(and (or (not (< 1 multThread1of1ForFork1_a)) (<= (* multThread1of1ForFork1_b 2) ULTIMATE.start_z1)) (or (not (< 1 multThread1of1ForFork1_a)) (<= (+ 2 ULTIMATE.start_z1) (+ multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2))))), 3366#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a 1) (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2)))) (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)))), 3371#(and (or (<= (+ multThread1of1ForFork1_z 2) (+ multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2))) (not (< 0 multThread1of1ForFork0_a))) (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a)) (not (< 0 multThread1of1ForFork0_a)))), 3370#(and (or (< 1 multThread1of1ForFork0_a) (<= multThread1of1ForFork0_b multThread1of1ForFork1_z) (not (< 0 multThread1of1ForFork0_a))) (or (< 1 multThread1of1ForFork0_a) (<= multThread1of1ForFork1_z multThread1of1ForFork0_b) (not (< 0 multThread1of1ForFork0_a)))), 3369#(and (or (not (< 1 ULTIMATE.start_y)) (<= (* 2 ULTIMATE.start_x) multThread1of1ForFork0_z)) (or (not (< 1 ULTIMATE.start_y)) (<= (+ multThread1of1ForFork0_z 2) (+ (* 2 ULTIMATE.start_x) ULTIMATE.start_y)))), 3373#(and (<= (+ multThread1of1ForFork0_z 2) (+ (* 2 ULTIMATE.start_x) ULTIMATE.start_y)) (<= (+ (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x) ULTIMATE.start_y) (+ multThread1of1ForFork0_z 2 (* multThread1of1ForFork0_a 2)))), 3362#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)) (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a))) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z))), 3375#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b 2) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2))) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2)) (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2)))))] [2022-03-15 20:32:58,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 20:32:58,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:32:58,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 20:32:58,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2498, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 20:32:58,986 INFO L87 Difference]: Start difference. First operand 60 states and 126 transitions. Second operand has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:33:14,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:33:14,382 INFO L93 Difference]: Finished difference Result 309 states and 482 transitions. [2022-03-15 20:33:14,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-03-15 20:33:14,382 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:33:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:33:14,396 INFO L225 Difference]: With dead ends: 309 [2022-03-15 20:33:14,396 INFO L226 Difference]: Without dead ends: 294 [2022-03-15 20:33:14,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9307 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=3732, Invalid=27420, Unknown=0, NotChecked=0, Total=31152 [2022-03-15 20:33:14,398 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 943 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2548 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 2548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:33:14,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [943 Valid, 6 Invalid, 2768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 2548 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:33:14,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-03-15 20:33:14,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 62. [2022-03-15 20:33:14,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 2.1311475409836067) internal successors, (130), 61 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:33:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 130 transitions. [2022-03-15 20:33:14,401 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 130 transitions. Word has length 13 [2022-03-15 20:33:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:33:14,401 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 130 transitions. [2022-03-15 20:33:14,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:33:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 130 transitions. [2022-03-15 20:33:14,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:33:14,402 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:33:14,402 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:33:14,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 20:33:14,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-03-15 20:33:14,602 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:33:14,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:33:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1458917801, now seen corresponding path program 3 times [2022-03-15 20:33:14,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:33:14,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319009672] [2022-03-15 20:33:14,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:33:14,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:33:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:33:14,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:33:14,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:33:14,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319009672] [2022-03-15 20:33:14,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319009672] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:33:14,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433000635] [2022-03-15 20:33:14,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:33:14,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:33:14,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:33:14,739 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:33:14,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 20:33:14,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:33:14,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:33:14,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 20:33:14,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:33:14,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:33:14,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:33:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:33:15,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433000635] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:33:15,153 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:33:15,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2022-03-15 20:33:15,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [895169930] [2022-03-15 20:33:15,153 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:33:15,153 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:33:15,155 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2022-03-15 20:33:15,155 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:33:15,562 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [4166#(and (<= multThread1of1ForFork0_z (+ multThread1of1ForFork1_z multThread1of1ForFork1_b)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z)), 4172#(and (<= (* multThread1of1ForFork1_b 3) multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z (* multThread1of1ForFork1_b 3))), 4165#(and (<= ULTIMATE.start_z1 (+ multThread1of1ForFork1_z multThread1of1ForFork1_b)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)), 4161#(and (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_a 3)) (<= 0 multThread1of1ForFork1_z)), 4162#(and (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) (* multThread1of1ForFork0_a 3)) (<= 0 (+ multThread1of1ForFork1_z multThread1of1ForFork1_b))), 4170#(and (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))), 4171#(and (<= ULTIMATE.start_z1 (* multThread1of1ForFork1_b 3)) (<= (* multThread1of1ForFork1_b 3) ULTIMATE.start_z1)), 4173#(and (<= multThread1of1ForFork0_z (* 3 ULTIMATE.start_x)) (<= (* 3 ULTIMATE.start_x) multThread1of1ForFork0_z)), 4160#(and (or (<= 0 multThread1of1ForFork1_z) (< 0 multThread1of1ForFork0_a)) (or (<= multThread1of1ForFork1_z 0) (< 0 multThread1of1ForFork0_a))), 4174#(and (<= multThread1of1ForFork0_z (* 3 ULTIMATE.start_x)) (<= (+ (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 3)))), 4164#(and (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) (* multThread1of1ForFork0_a 3)) (<= 0 (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))), 4167#(and (<= ULTIMATE.start_z1 (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) ULTIMATE.start_z1)), 4169#(and (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) ULTIMATE.start_z1) (<= ULTIMATE.start_z1 (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))), 4163#(and (<= 0 (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) (* multThread1of1ForFork0_a 3))), 4132#(or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z))), 4168#(and (<= multThread1of1ForFork0_z (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) multThread1of1ForFork0_z))] [2022-03-15 20:33:15,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 20:33:15,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:33:15,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 20:33:15,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1644, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 20:33:15,564 INFO L87 Difference]: Start difference. First operand 62 states and 130 transitions. Second operand has 29 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:33:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:33:16,930 INFO L93 Difference]: Finished difference Result 150 states and 285 transitions. [2022-03-15 20:33:16,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 20:33:16,930 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:33:16,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:33:16,931 INFO L225 Difference]: With dead ends: 150 [2022-03-15 20:33:16,931 INFO L226 Difference]: Without dead ends: 140 [2022-03-15 20:33:16,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1053, Invalid=4799, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 20:33:16,932 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 245 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:33:16,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 17 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:33:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-03-15 20:33:16,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 66. [2022-03-15 20:33:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.0307692307692307) internal successors, (132), 65 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:33:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 132 transitions. [2022-03-15 20:33:16,936 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 132 transitions. Word has length 13 [2022-03-15 20:33:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:33:16,936 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 132 transitions. [2022-03-15 20:33:16,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:33:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 132 transitions. [2022-03-15 20:33:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:33:16,937 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:33:16,937 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:33:16,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 20:33:17,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 20:33:17,153 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:33:17,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:33:17,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1869504203, now seen corresponding path program 4 times [2022-03-15 20:33:17,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:33:17,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168820325] [2022-03-15 20:33:17,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:33:17,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:33:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:33:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:33:17,273 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:33:17,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168820325] [2022-03-15 20:33:17,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168820325] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:33:17,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620341825] [2022-03-15 20:33:17,273 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:33:17,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:33:17,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:33:17,274 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:33:17,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 20:33:17,303 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:33:17,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:33:17,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 20:33:17,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:33:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:33:17,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:33:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:33:17,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620341825] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:33:17,640 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:33:17,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2022-03-15 20:33:17,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1327641578] [2022-03-15 20:33:17,640 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:33:17,641 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:33:17,642 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2022-03-15 20:33:17,642 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:33:18,216 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [4642#(and (<= ULTIMATE.start_z1 (* multThread1of1ForFork1_a 4)) (<= 0 ULTIMATE.start_z1)), 4649#(and (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z)) (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z))), 4643#(and (<= multThread1of1ForFork0_z (* ULTIMATE.start_y 4)) (<= 0 multThread1of1ForFork0_z)), 4637#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z)), 4639#(and (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) multThread1of1ForFork1_z)), 4648#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z))), 4647#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z))), 4644#(and (<= 0 (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) (* ULTIMATE.start_y 4))), 4645#(and (<= 0 (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) (* ULTIMATE.start_y 4))), 4650#(and (<= 0 (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) (* ULTIMATE.start_y 4))), 4646#(and (<= 0 (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) (* ULTIMATE.start_y 4))), 4638#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z)), 4651#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4))) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z))), 4640#(and (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) multThread1of1ForFork1_z) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)))), 4652#(and (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 4)) (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 4)) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z))), 4641#(and (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 4)) (<= (* multThread1of1ForFork0_b 4) multThread1of1ForFork1_z)), 4636#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z))] [2022-03-15 20:33:18,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 20:33:18,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:33:18,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 20:33:18,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2277, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 20:33:18,217 INFO L87 Difference]: Start difference. First operand 66 states and 132 transitions. Second operand has 31 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:33:20,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:33:20,256 INFO L93 Difference]: Finished difference Result 162 states and 305 transitions. [2022-03-15 20:33:20,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 20:33:20,257 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:33:20,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:33:20,257 INFO L225 Difference]: With dead ends: 162 [2022-03-15 20:33:20,257 INFO L226 Difference]: Without dead ends: 154 [2022-03-15 20:33:20,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1815 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1613, Invalid=7317, Unknown=0, NotChecked=0, Total=8930 [2022-03-15 20:33:20,259 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 388 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:33:20,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 21 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:33:20,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-03-15 20:33:20,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 73. [2022-03-15 20:33:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 2.138888888888889) internal successors, (154), 72 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:33:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 154 transitions. [2022-03-15 20:33:20,267 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 154 transitions. Word has length 14 [2022-03-15 20:33:20,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:33:20,268 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 154 transitions. [2022-03-15 20:33:20,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:33:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 154 transitions. [2022-03-15 20:33:20,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:33:20,269 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:33:20,269 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:33:20,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 20:33:20,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 20:33:20,486 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:33:20,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:33:20,486 INFO L85 PathProgramCache]: Analyzing trace with hash 982595168, now seen corresponding path program 4 times [2022-03-15 20:33:20,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:33:20,487 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037309841] [2022-03-15 20:33:20,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:33:20,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:33:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:33:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:33:20,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:33:20,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037309841] [2022-03-15 20:33:20,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037309841] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:33:20,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582155274] [2022-03-15 20:33:20,647 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:33:20,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:33:20,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:33:20,648 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:33:20,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 20:33:20,667 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:33:20,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:33:20,668 WARN L261 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 20:33:20,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:33:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:33:20,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:33:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:33:21,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582155274] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:33:21,288 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:33:21,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2022-03-15 20:33:21,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [344711755] [2022-03-15 20:33:21,288 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:33:21,289 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:33:21,290 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 60 transitions. [2022-03-15 20:33:21,290 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:33:22,483 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [5181#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i) (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a 2))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b 3) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 5178#(and (or (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 3)) (< 3 multThread1of1ForFork0_a) (not (< 2 multThread1of1ForFork0_a))) (or (< 3 multThread1of1ForFork0_a) (not (< 2 multThread1of1ForFork0_a)) (<= (* multThread1of1ForFork0_b 3) multThread1of1ForFork1_z))), 5174#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a))), 5183#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 3) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 5171#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 5169#(and (or (<= (+ multThread1of1ForFork0_z 3) (+ (* 3 ULTIMATE.start_y) ULTIMATE.start_x)) (not (< 0 ULTIMATE.start_y))) (or (<= ULTIMATE.start_x multThread1of1ForFork0_z) (not (< 0 ULTIMATE.start_y)))), 5186#(and (<= (+ (* 3 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 2) 1)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 2) 1) (+ (* 3 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x))), 5167#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 3) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 5185#(and (<= (+ (* 3 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a 2)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a 2) (+ (* 3 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x))), 5168#(and (or (<= (+ multThread1of1ForFork0_z 3) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_b)) (not (< 0 multThread1of1ForFork1_a))) (or (<= multThread1of1ForFork1_b multThread1of1ForFork0_z) (not (< 0 multThread1of1ForFork1_a)))), 5176#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 2) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 2))) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)))), 5170#(and (<= (+ (* 3 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a 3)) (<= (+ multThread1of1ForFork0_z 3) (+ (* 3 ULTIMATE.start_y) ULTIMATE.start_x))), 5179#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 3) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z multThread1of1ForFork0_a)))), 5187#(and (<= (+ (* 3 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z multThread1of1ForFork0_a) (+ (* 3 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x))), 5172#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 5182#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i) (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 2) 1))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 3 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 5177#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) multThread1of1ForFork1_z))), 5175#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 1) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z)))), 5165#(and (or (<= (+ (* multThread1of1ForFork1_i 3) 3 ULTIMATE.start_z1) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a))) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1))), 5173#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 5180#(and (or (not (< 2 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z))) (or (not (< 2 multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z 3) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_a)))), 5184#(and (or (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_a)) (not (< 2 multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) 3) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< 2 multThread1of1ForFork0_a)))), 5166#(and (or (not (< 0 multThread1of1ForFork1_a)) (<= multThread1of1ForFork1_b ULTIMATE.start_z1)) (or (not (< 0 multThread1of1ForFork1_a)) (<= (+ 3 ULTIMATE.start_z1) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_b))))] [2022-03-15 20:33:22,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 20:33:22,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:33:22,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 20:33:22,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3246, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 20:33:22,484 INFO L87 Difference]: Start difference. First operand 73 states and 154 transitions. Second operand has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:33:39,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:33:39,338 INFO L93 Difference]: Finished difference Result 334 states and 530 transitions. [2022-03-15 20:33:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-03-15 20:33:39,339 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:33:39,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:33:39,340 INFO L225 Difference]: With dead ends: 334 [2022-03-15 20:33:39,340 INFO L226 Difference]: Without dead ends: 322 [2022-03-15 20:33:39,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9733 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=3521, Invalid=30519, Unknown=0, NotChecked=0, Total=34040 [2022-03-15 20:33:39,342 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1080 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 3967 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 4168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 3967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:33:39,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1080 Valid, 4 Invalid, 4168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 3967 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 20:33:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-03-15 20:33:39,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 74. [2022-03-15 20:33:39,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 2.164383561643836) internal successors, (158), 73 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:33:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 158 transitions. [2022-03-15 20:33:39,346 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 158 transitions. Word has length 14 [2022-03-15 20:33:39,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:33:39,347 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 158 transitions. [2022-03-15 20:33:39,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:33:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 158 transitions. [2022-03-15 20:33:39,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:33:39,347 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:33:39,347 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:33:39,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 20:33:39,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 20:33:39,565 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:33:39,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:33:39,566 INFO L85 PathProgramCache]: Analyzing trace with hash -741781141, now seen corresponding path program 5 times [2022-03-15 20:33:39,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:33:39,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495179126] [2022-03-15 20:33:39,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:33:39,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:33:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:33:39,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:33:39,748 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:33:39,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495179126] [2022-03-15 20:33:39,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495179126] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:33:39,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683707946] [2022-03-15 20:33:39,748 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:33:39,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:33:39,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:33:39,750 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:33:39,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 20:33:39,778 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 20:33:39,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:33:39,779 WARN L261 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 20:33:39,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:33:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:33:40,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:33:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:33:40,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683707946] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:33:40,518 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:33:40,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2022-03-15 20:33:40,518 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [582140212] [2022-03-15 20:33:40,518 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:33:40,519 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:33:40,521 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 62 transitions. [2022-03-15 20:33:40,521 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:33:41,898 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [6049#(and (or (not (< 1 ULTIMATE.start_y)) (<= (+ multThread1of1ForFork0_z 4) (+ (* 2 ULTIMATE.start_y) (* 2 ULTIMATE.start_x)))) (or (not (< 1 ULTIMATE.start_y)) (<= (* 2 ULTIMATE.start_x) multThread1of1ForFork0_z))), 6051#(and (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b 2 (* multThread1of1ForFork0_a 2)) (+ (* 2 ULTIMATE.start_y) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x))) (<= (+ (* 2 ULTIMATE.start_y) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b 2 (* multThread1of1ForFork0_a 2)))), 6052#(and (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 2)) (+ (* 2 ULTIMATE.start_y) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x))) (<= (+ (* 2 ULTIMATE.start_y) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 2)))), 6043#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b 2 (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork1_i 2)))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork1_i 2) 4) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 6038#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 6055#(and (or (not (< 1 multThread1of1ForFork0_a)) (<= (* multThread1of1ForFork0_b 2) multThread1of1ForFork1_z) (< 2 multThread1of1ForFork0_a)) (or (not (< 1 multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 2)) (< 2 multThread1of1ForFork0_a))), 6044#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ ULTIMATE.start_z1 (* multThread1of1ForFork1_i 2) 4) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) ULTIMATE.start_z1))), 6047#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) multThread1of1ForFork0_z)) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork1_i 2) 4) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 6053#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z 4) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 2)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z)))), 6056#(and (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z))) (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z 4) (+ (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 2))))), 6041#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z 2) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2))))), 6059#(and (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)))) (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 2) 4 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 6046#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a))), 6037#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork0_z 2 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b))) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z))), 6039#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 6040#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 6050#(and (<= (+ (* 2 ULTIMATE.start_y) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) 4)) (<= (+ multThread1of1ForFork0_z 4) (+ (* 2 ULTIMATE.start_y) (* 2 ULTIMATE.start_x)))), 6042#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z multThread1of1ForFork1_b) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork1_i 2)))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b 2 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 6057#(and (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ 2 (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b))) (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b 2) (+ (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2))))), 6048#(and (or (<= (* multThread1of1ForFork1_b 2) multThread1of1ForFork0_z) (not (< 1 multThread1of1ForFork1_a))) (or (<= (+ multThread1of1ForFork0_z 4) (+ (* multThread1of1ForFork1_a 2) (* multThread1of1ForFork1_b 2))) (not (< 1 multThread1of1ForFork1_a)))), 6036#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ 2 ULTIMATE.start_z1 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 6054#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z 2 (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z multThread1of1ForFork1_b 2) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2))))), 6058#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork1_i 2) 4 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2))))), 6045#(and (or (not (< 1 multThread1of1ForFork1_a)) (<= (* multThread1of1ForFork1_b 2) ULTIMATE.start_z1)) (or (<= (+ ULTIMATE.start_z1 4) (+ (* multThread1of1ForFork1_a 2) (* multThread1of1ForFork1_b 2))) (not (< 1 multThread1of1ForFork1_a))))] [2022-03-15 20:33:41,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 20:33:41,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:33:41,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 20:33:41,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3362, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 20:33:41,899 INFO L87 Difference]: Start difference. First operand 74 states and 158 transitions. Second operand has 38 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 38 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:34:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:34:07,480 INFO L93 Difference]: Finished difference Result 384 states and 601 transitions. [2022-03-15 20:34:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2022-03-15 20:34:07,480 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 38 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:34:07,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:34:07,481 INFO L225 Difference]: With dead ends: 384 [2022-03-15 20:34:07,481 INFO L226 Difference]: Without dead ends: 369 [2022-03-15 20:34:07,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13829 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=4671, Invalid=40485, Unknown=0, NotChecked=0, Total=45156 [2022-03-15 20:34:07,484 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1390 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 4137 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 4441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 4137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:34:07,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1390 Valid, 8 Invalid, 4441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 4137 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 20:34:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-03-15 20:34:07,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 75. [2022-03-15 20:34:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 2.189189189189189) internal successors, (162), 74 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:34:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 162 transitions. [2022-03-15 20:34:07,487 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 162 transitions. Word has length 14 [2022-03-15 20:34:07,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:34:07,487 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 162 transitions. [2022-03-15 20:34:07,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 38 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:34:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 162 transitions. [2022-03-15 20:34:07,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:34:07,487 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:34:07,488 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:34:07,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-15 20:34:07,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 20:34:07,688 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:34:07,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:34:07,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1637128128, now seen corresponding path program 6 times [2022-03-15 20:34:07,689 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:34:07,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040657168] [2022-03-15 20:34:07,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:34:07,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:34:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:34:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:34:07,838 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:34:07,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040657168] [2022-03-15 20:34:07,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040657168] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:34:07,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511385674] [2022-03-15 20:34:07,838 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:34:07,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:34:07,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:34:07,839 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:34:07,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 20:34:07,868 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:34:07,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:34:07,869 WARN L261 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 20:34:07,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:34:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:34:08,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:34:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:34:08,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511385674] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:34:08,491 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:34:08,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2022-03-15 20:34:08,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1169685737] [2022-03-15 20:34:08,491 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:34:08,492 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:34:08,495 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 60 transitions. [2022-03-15 20:34:08,495 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:34:09,600 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [7024#(and (or (not (< 2 multThread1of1ForFork1_a)) (<= (* multThread1of1ForFork1_b 3) ULTIMATE.start_z1)) (or (<= (+ 3 ULTIMATE.start_z1) (+ multThread1of1ForFork1_a (* multThread1of1ForFork1_b 3))) (not (< 2 multThread1of1ForFork1_a)))), 7030#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b 2) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2))) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2) (* multThread1of1ForFork0_i 3) 1) (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 3))))), 7035#(and (or (not (< 0 multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b 3) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 3)))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 3)) (+ multThread1of1ForFork1_i multThread1of1ForFork0_b (* multThread1of1ForFork0_a 3))) (not (< 0 multThread1of1ForFork0_a)))), 7031#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b 3) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 3)))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 3) (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 3))) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)))), 7019#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)) (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a))) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z))), 7032#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a)) (not (< 0 multThread1of1ForFork0_a))) (or (<= (+ multThread1of1ForFork1_z 3) (+ multThread1of1ForFork0_b (* multThread1of1ForFork0_a 3))) (not (< 0 multThread1of1ForFork0_a)))), 7020#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i 2 ULTIMATE.start_z1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) ULTIMATE.start_z1))), 7033#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)) (not (< 0 multThread1of1ForFork0_a))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a 2) (+ multThread1of1ForFork1_i multThread1of1ForFork0_b (* multThread1of1ForFork0_a 3))) (not (< 0 multThread1of1ForFork0_a)))), 7017#(and (or (< 1 multThread1of1ForFork0_a) (<= multThread1of1ForFork0_b multThread1of1ForFork1_z) (not (< 0 multThread1of1ForFork0_a))) (or (< 1 multThread1of1ForFork0_a) (<= multThread1of1ForFork1_z multThread1of1ForFork0_b) (not (< 0 multThread1of1ForFork0_a)))), 7018#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i ULTIMATE.start_z1 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)))), 7021#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) multThread1of1ForFork0_z)) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z 2) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2))))), 7022#(and (or (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) ULTIMATE.start_z1) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a))) (or (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i 3 ULTIMATE.start_z1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 3))))), 7029#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a 2 (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 3)))) (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)))), 7016#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 7034#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b 2) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2))) (not (< 0 multThread1of1ForFork0_a))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2) 1) (+ multThread1of1ForFork1_i multThread1of1ForFork0_b (* multThread1of1ForFork0_a 3))) (not (< 0 multThread1of1ForFork0_a)))), 7015#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 7025#(and (or (not (< 2 multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork0_z 3) (+ multThread1of1ForFork1_a (* multThread1of1ForFork1_b 3)))) (or (not (< 2 multThread1of1ForFork1_a)) (<= (* multThread1of1ForFork1_b 3) multThread1of1ForFork0_z))), 7036#(and (<= (+ (* 3 ULTIMATE.start_x) ULTIMATE.start_y (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 3))) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 3)) (+ (* 3 ULTIMATE.start_x) ULTIMATE.start_y (* multThread1of1ForFork0_i 3)))), 7014#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 7027#(and (<= (+ (* 3 ULTIMATE.start_x) ULTIMATE.start_y (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z 3 (* multThread1of1ForFork0_a 3))) (<= (+ multThread1of1ForFork0_z 3) (+ (* 3 ULTIMATE.start_x) ULTIMATE.start_y))), 7026#(and (or (not (< 2 ULTIMATE.start_y)) (<= (* 3 ULTIMATE.start_x) multThread1of1ForFork0_z)) (or (not (< 2 ULTIMATE.start_y)) (<= (+ multThread1of1ForFork0_z 3) (+ (* 3 ULTIMATE.start_x) ULTIMATE.start_y)))), 7028#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (<= (+ multThread1of1ForFork1_z 3 (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 3))) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)))), 7023#(and (or (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) multThread1of1ForFork0_z) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a))) (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z 3) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 3))) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a))))] [2022-03-15 20:34:09,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 20:34:09,601 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:34:09,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 20:34:09,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=3241, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 20:34:09,601 INFO L87 Difference]: Start difference. First operand 75 states and 162 transitions. Second operand has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:34:33,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:34:33,033 INFO L93 Difference]: Finished difference Result 431 states and 671 transitions. [2022-03-15 20:34:33,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2022-03-15 20:34:33,033 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:34:33,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:34:33,034 INFO L225 Difference]: With dead ends: 431 [2022-03-15 20:34:33,034 INFO L226 Difference]: Without dead ends: 413 [2022-03-15 20:34:33,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16459 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=5522, Invalid=45780, Unknown=0, NotChecked=0, Total=51302 [2022-03-15 20:34:33,037 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1492 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 3543 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 3917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 3543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:34:33,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1492 Valid, 12 Invalid, 3917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 3543 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 20:34:33,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-03-15 20:34:33,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 76. [2022-03-15 20:34:33,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 2.16) internal successors, (162), 75 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:34:33,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 162 transitions. [2022-03-15 20:34:33,041 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 162 transitions. Word has length 14 [2022-03-15 20:34:33,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:34:33,041 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 162 transitions. [2022-03-15 20:34:33,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:34:33,041 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 162 transitions. [2022-03-15 20:34:33,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:34:33,041 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:34:33,041 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:34:33,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 20:34:33,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 20:34:33,242 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:34:33,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:34:33,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1926095861, now seen corresponding path program 4 times [2022-03-15 20:34:33,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:34:33,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679792480] [2022-03-15 20:34:33,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:34:33,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:34:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:34:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:34:33,364 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:34:33,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679792480] [2022-03-15 20:34:33,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679792480] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:34:33,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030041681] [2022-03-15 20:34:33,364 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:34:33,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:34:33,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:34:33,365 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:34:33,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 20:34:33,388 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:34:33,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:34:33,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 20:34:33,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:34:33,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:34:33,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:34:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:34:33,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030041681] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:34:33,864 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:34:33,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 29 [2022-03-15 20:34:33,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [837248562] [2022-03-15 20:34:33,864 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:34:33,865 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:34:33,866 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2022-03-15 20:34:33,866 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:34:34,469 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [8073#(and (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) (* multThread1of1ForFork0_a 4)) (<= 0 (+ multThread1of1ForFork1_z multThread1of1ForFork1_b))), 8033#(or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z))), 8071#(and (or (<= 0 multThread1of1ForFork1_z) (< 0 multThread1of1ForFork0_a)) (or (<= multThread1of1ForFork1_z 0) (< 0 multThread1of1ForFork0_a))), 8075#(and (<= ULTIMATE.start_z1 (* multThread1of1ForFork1_b 4)) (<= (* multThread1of1ForFork1_b 4) ULTIMATE.start_z1)), 8074#(and (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) ULTIMATE.start_z1) (<= ULTIMATE.start_z1 (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z))), 8080#(and (<= multThread1of1ForFork0_z (* multThread1of1ForFork1_b 4)) (<= (* multThread1of1ForFork1_b 4) multThread1of1ForFork0_z)), 8082#(and (<= multThread1of1ForFork0_z (* ULTIMATE.start_x 4)) (<= (+ (* multThread1of1ForFork0_i 4) (* ULTIMATE.start_x 4)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z))), 8069#(and (<= multThread1of1ForFork0_z (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) multThread1of1ForFork0_z)), 8076#(and (<= 0 (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) (* multThread1of1ForFork0_a 4))), 8077#(and (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) (* multThread1of1ForFork0_a 4)) (<= 0 (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))), 8072#(and (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_a 4)) (<= 0 multThread1of1ForFork1_z)), 8066#(and (<= ULTIMATE.start_z1 (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) ULTIMATE.start_z1)), 8081#(and (<= multThread1of1ForFork0_z (* ULTIMATE.start_x 4)) (<= (* ULTIMATE.start_x 4) multThread1of1ForFork0_z)), 8079#(and (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z))), 8070#(and (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))), 8078#(and (<= 0 (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z)) (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) (* multThread1of1ForFork0_a 4))), 8068#(and (<= multThread1of1ForFork0_z (+ multThread1of1ForFork1_z multThread1of1ForFork1_b)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z)), 8067#(and (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) ULTIMATE.start_z1) (<= ULTIMATE.start_z1 (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))), 8065#(and (<= ULTIMATE.start_z1 (+ multThread1of1ForFork1_z multThread1of1ForFork1_b)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1))] [2022-03-15 20:34:34,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 20:34:34,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:34:34,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 20:34:34,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2152, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 20:34:34,470 INFO L87 Difference]: Start difference. First operand 76 states and 162 transitions. Second operand has 33 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:34:36,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:34:36,973 INFO L93 Difference]: Finished difference Result 188 states and 360 transitions. [2022-03-15 20:34:36,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 20:34:36,973 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:34:36,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:34:36,974 INFO L225 Difference]: With dead ends: 188 [2022-03-15 20:34:36,974 INFO L226 Difference]: Without dead ends: 178 [2022-03-15 20:34:36,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1690 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1289, Invalid=6367, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 20:34:36,975 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 382 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:34:36,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 20 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:34:36,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-03-15 20:34:36,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 79. [2022-03-15 20:34:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 2.051282051282051) internal successors, (160), 78 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:34:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 160 transitions. [2022-03-15 20:34:36,979 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 160 transitions. Word has length 14 [2022-03-15 20:34:36,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:34:36,979 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 160 transitions. [2022-03-15 20:34:36,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:34:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 160 transitions. [2022-03-15 20:34:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:34:36,979 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:34:36,979 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:34:37,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 20:34:37,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:34:37,187 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:34:37,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:34:37,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1195910252, now seen corresponding path program 5 times [2022-03-15 20:34:37,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:34:37,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971250659] [2022-03-15 20:34:37,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:34:37,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:34:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:34:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:34:37,322 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:34:37,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971250659] [2022-03-15 20:34:37,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971250659] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:34:37,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800780722] [2022-03-15 20:34:37,322 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:34:37,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:34:37,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:34:37,323 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:34:37,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 20:34:37,344 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:34:37,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:34:37,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 20:34:37,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:34:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:34:37,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:34:37,765 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:34:37,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800780722] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:34:37,766 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:34:37,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2022-03-15 20:34:37,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [112917985] [2022-03-15 20:34:37,766 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:34:37,767 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:34:37,769 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 61 transitions. [2022-03-15 20:34:37,769 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:34:38,305 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [8641#(and (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a))) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)))), 8633#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z)), 8637#(and (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) multThread1of1ForFork1_z)), 8646#(and (<= (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z) (* 5 ULTIMATE.start_y)) (<= 0 (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z))), 8635#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z)), 8631#(and (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) (* 5 ULTIMATE.start_y)) (<= 0 (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z))), 8636#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (<= (+ multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i) (* multThread1of1ForFork0_b 2)) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a)))), 8640#(and (<= (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z) multThread1of1ForFork1_z) (<= multThread1of1ForFork1_z (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z))), 8634#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a)))), 8632#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 8627#(and (<= ULTIMATE.start_z1 (* 5 multThread1of1ForFork1_a)) (<= 0 ULTIMATE.start_z1)), 8643#(and (<= multThread1of1ForFork1_z (* 5 multThread1of1ForFork0_b)) (<= (* 5 multThread1of1ForFork0_b) multThread1of1ForFork1_z)), 8642#(and (<= (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a))) (<= multThread1of1ForFork1_z (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z))), 8644#(and (<= multThread1of1ForFork1_z (* 5 multThread1of1ForFork0_b)) (<= (+ (* 5 multThread1of1ForFork0_b) (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a)))), 8638#(and (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a))) (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z))), 8630#(and (<= 0 (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) (* 5 ULTIMATE.start_y))), 8629#(and (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) (* 5 ULTIMATE.start_y)) (<= 0 (+ multThread1of1ForFork0_z multThread1of1ForFork0_b))), 8628#(and (<= multThread1of1ForFork0_z (* 5 ULTIMATE.start_y)) (<= 0 multThread1of1ForFork0_z)), 8639#(and (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) multThread1of1ForFork1_z) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)))), 8645#(and (<= 0 (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) (* 5 ULTIMATE.start_y)))] [2022-03-15 20:34:38,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 20:34:38,306 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:34:38,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 20:34:38,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2875, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 20:34:38,306 INFO L87 Difference]: Start difference. First operand 79 states and 160 transitions. Second operand has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:34:41,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:34:41,214 INFO L93 Difference]: Finished difference Result 201 states and 382 transitions. [2022-03-15 20:34:41,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 20:34:41,215 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:34:41,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:34:41,215 INFO L225 Difference]: With dead ends: 201 [2022-03-15 20:34:41,215 INFO L226 Difference]: Without dead ends: 193 [2022-03-15 20:34:41,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2501 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2080, Invalid=9692, Unknown=0, NotChecked=0, Total=11772 [2022-03-15 20:34:41,217 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 498 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:34:41,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 25 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:34:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-03-15 20:34:41,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 87. [2022-03-15 20:34:41,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 2.1627906976744184) internal successors, (186), 86 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:34:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 186 transitions. [2022-03-15 20:34:41,219 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 186 transitions. Word has length 15 [2022-03-15 20:34:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:34:41,220 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 186 transitions. [2022-03-15 20:34:41,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:34:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 186 transitions. [2022-03-15 20:34:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:34:41,220 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:34:41,220 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:34:41,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 20:34:41,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 20:34:41,427 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:34:41,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:34:41,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2082819287, now seen corresponding path program 7 times [2022-03-15 20:34:41,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:34:41,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141071119] [2022-03-15 20:34:41,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:34:41,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:34:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:34:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:34:41,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:34:41,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141071119] [2022-03-15 20:34:41,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141071119] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:34:41,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206355560] [2022-03-15 20:34:41,613 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:34:41,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:34:41,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:34:41,614 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:34:41,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 20:34:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:34:41,635 WARN L261 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 20:34:41,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:34:41,997 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:34:41,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:34:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:34:42,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206355560] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:34:42,432 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:34:42,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2022-03-15 20:34:42,432 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [180443673] [2022-03-15 20:34:42,432 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:34:42,433 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:34:42,437 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 69 transitions. [2022-03-15 20:34:42,437 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:34:43,998 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [9274#(and (or (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i) (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z multThread1of1ForFork0_a 1)) (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)))), 9269#(and (<= (+ multThread1of1ForFork0_z 4) (+ (* ULTIMATE.start_y 4) ULTIMATE.start_x)) (<= (+ (* ULTIMATE.start_y 4) multThread1of1ForFork0_i ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a 4))), 9276#(and (or (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 4) 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< 3 multThread1of1ForFork0_a))) (or (not (< 3 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b) (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_a (* multThread1of1ForFork0_b 4))))), 9272#(and (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z multThread1of1ForFork0_a 1) (+ (* ULTIMATE.start_y 4) multThread1of1ForFork0_i ULTIMATE.start_x)) (<= (+ (* ULTIMATE.start_y 4) multThread1of1ForFork0_i ULTIMATE.start_x) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z multThread1of1ForFork0_a 1))), 9277#(and (<= (+ (* ULTIMATE.start_y 4) multThread1of1ForFork0_i ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 4))) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 4)) (+ (* ULTIMATE.start_y 4) multThread1of1ForFork0_i ULTIMATE.start_x))), 9265#(and (or (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a))) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z))), 9266#(and (or (not (< 0 multThread1of1ForFork1_a)) (<= multThread1of1ForFork1_b ULTIMATE.start_z1)) (or (not (< 0 multThread1of1ForFork1_a)) (<= (+ ULTIMATE.start_z1 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_b)))), 9254#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a))), 9263#(and (or (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 4)) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z)) (not (< 3 multThread1of1ForFork0_a))) (or (<= (+ multThread1of1ForFork1_z 4) (+ multThread1of1ForFork0_a (* multThread1of1ForFork0_b 4))) (not (< 3 multThread1of1ForFork0_a)))), 9273#(and (or (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i) (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z multThread1of1ForFork0_a 2 (* multThread1of1ForFork0_b 2))) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z 4 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)))), 9261#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 3) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z multThread1of1ForFork0_a)))), 9253#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 9259#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z multThread1of1ForFork0_b 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i) (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a 3)))), 9262#(and (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z))) (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 4) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 4))))), 9255#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) multThread1of1ForFork1_z))), 9270#(and (<= (+ (* ULTIMATE.start_y 4) multThread1of1ForFork0_i ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a 3)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a 3) (+ (* ULTIMATE.start_y 4) multThread1of1ForFork0_i ULTIMATE.start_x))), 9267#(and (or (<= multThread1of1ForFork1_b multThread1of1ForFork0_z) (not (< 0 multThread1of1ForFork1_a))) (or (<= (+ multThread1of1ForFork0_z 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_b)) (not (< 0 multThread1of1ForFork1_a)))), 9258#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 1) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z)))), 9256#(and (or (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a))) (or (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4))) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)))), 9271#(and (<= (+ (* ULTIMATE.start_y 4) multThread1of1ForFork0_i ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a 2 (* multThread1of1ForFork0_b 2))) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_a 2 (* multThread1of1ForFork0_b 2)) (+ (* ULTIMATE.start_y 4) multThread1of1ForFork0_i ULTIMATE.start_x))), 9252#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 9260#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 2) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 2))) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)))), 9268#(and (or (<= (+ multThread1of1ForFork0_z 4) (+ (* ULTIMATE.start_y 4) ULTIMATE.start_x)) (not (< 0 ULTIMATE.start_y))) (or (<= ULTIMATE.start_x multThread1of1ForFork0_z) (not (< 0 ULTIMATE.start_y)))), 9257#(and (or (< 4 multThread1of1ForFork0_a) (not (< 3 multThread1of1ForFork0_a)) (<= (* multThread1of1ForFork0_b 4) multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 4)) (< 4 multThread1of1ForFork0_a) (not (< 3 multThread1of1ForFork0_a)))), 9251#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 9275#(and (or (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i) (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 4))))), 9264#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 4) ULTIMATE.start_z1 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b))))] [2022-03-15 20:34:43,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 20:34:43,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:34:43,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 20:34:43,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=4088, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 20:34:43,999 INFO L87 Difference]: Start difference. First operand 87 states and 186 transitions. Second operand has 42 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 42 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:35:10,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:35:10,118 INFO L93 Difference]: Finished difference Result 413 states and 660 transitions. [2022-03-15 20:35:10,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2022-03-15 20:35:10,119 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 42 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:35:10,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:35:10,120 INFO L225 Difference]: With dead ends: 413 [2022-03-15 20:35:10,120 INFO L226 Difference]: Without dead ends: 401 [2022-03-15 20:35:10,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12844 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=4159, Invalid=40151, Unknown=0, NotChecked=0, Total=44310 [2022-03-15 20:35:10,122 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1419 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 5335 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 5597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 5335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:35:10,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1419 Valid, 5 Invalid, 5597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 5335 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 20:35:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-03-15 20:35:10,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 89. [2022-03-15 20:35:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 2.2045454545454546) internal successors, (194), 88 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:35:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 194 transitions. [2022-03-15 20:35:10,125 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 194 transitions. Word has length 15 [2022-03-15 20:35:10,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:35:10,126 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 194 transitions. [2022-03-15 20:35:10,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 42 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:35:10,126 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 194 transitions. [2022-03-15 20:35:10,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:35:10,126 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:35:10,126 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:35:10,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 20:35:10,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 20:35:10,335 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:35:10,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:35:10,336 INFO L85 PathProgramCache]: Analyzing trace with hash 487771700, now seen corresponding path program 8 times [2022-03-15 20:35:10,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:35:10,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655586340] [2022-03-15 20:35:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:35:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:35:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:35:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:35:10,496 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:35:10,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655586340] [2022-03-15 20:35:10,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655586340] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:35:10,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541495895] [2022-03-15 20:35:10,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:35:10,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:35:10,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:35:10,498 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:35:10,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 20:35:10,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:35:10,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:35:10,521 WARN L261 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 20:35:10,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:35:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:35:10,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:35:11,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:35:11,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541495895] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:35:11,354 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:35:11,354 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2022-03-15 20:35:11,354 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [452534690] [2022-03-15 20:35:11,354 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:35:11,355 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:35:11,357 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 73 transitions. [2022-03-15 20:35:11,357 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:35:12,937 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [10308#(and (or (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) 6) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (not (< 2 multThread1of1ForFork0_a))) (or (not (< 2 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) (* multThread1of1ForFork0_a 2))))), 10294#(and (or (not (< 2 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z))) (or (<= (+ multThread1of1ForFork1_z 6) (+ (* multThread1of1ForFork0_b 3) (* multThread1of1ForFork0_a 2))) (not (< 2 multThread1of1ForFork0_a)))), 10307#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 6) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2))))), 10286#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b 3) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z multThread1of1ForFork1_b) (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2) 1)))), 10283#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 10297#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 3) ULTIMATE.start_z1 6) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) ULTIMATE.start_z1))), 10300#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) multThread1of1ForFork0_z)) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 6) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 10285#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z 2) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2)))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z)))), 10282#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 10296#(and (or (<= (+ (* multThread1of1ForFork1_i 3) 3 ULTIMATE.start_z1) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a))) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1))), 10298#(and (or (<= (+ ULTIMATE.start_z1 6) (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork1_b 2))) (not (< 1 multThread1of1ForFork1_a))) (or (not (< 1 multThread1of1ForFork1_a)) (<= (* multThread1of1ForFork1_b 2) ULTIMATE.start_z1))), 10289#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z multThread1of1ForFork1_b 1) (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 2)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 3 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 10290#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) multThread1of1ForFork1_z))), 10304#(and (<= (+ (* 3 ULTIMATE.start_y) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2) 4)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2) 4) (+ (* 3 ULTIMATE.start_y) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x)))), 10305#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b 6) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (<= (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2) 4)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)))), 10301#(and (or (not (< 1 multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork0_z 6) (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork1_b 2)))) (or (<= (* multThread1of1ForFork1_b 2) multThread1of1ForFork0_z) (not (< 1 multThread1of1ForFork1_a)))), 10306#(and (or (<= (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 2 (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 2))) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 6 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 10288#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z 4) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 2)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z)))), 10310#(and (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2)) (+ (* 3 ULTIMATE.start_y) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x))) (<= (+ (* 3 ULTIMATE.start_y) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x)) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2)))), 10291#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z 6) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2)))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z)))), 10284#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 10303#(and (<= (+ multThread1of1ForFork0_z 6) (+ (* 3 ULTIMATE.start_y) (* 2 ULTIMATE.start_x))) (<= (+ (* 3 ULTIMATE.start_y) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) 6))), 10292#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z multThread1of1ForFork1_b 3) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2)))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 3) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 10293#(and (or (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 3)) (< 3 multThread1of1ForFork0_a) (not (< 2 multThread1of1ForFork0_a))) (or (< 3 multThread1of1ForFork0_a) (not (< 2 multThread1of1ForFork0_a)) (<= (* multThread1of1ForFork0_b 3) multThread1of1ForFork1_z))), 10299#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 3) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 10309#(and (<= (+ multThread1of1ForFork0_z 2 (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 2)) (+ (* 3 ULTIMATE.start_y) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x))) (<= (+ (* 3 ULTIMATE.start_y) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x)) (+ multThread1of1ForFork0_z 2 (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 2)))), 10302#(and (or (not (< 1 ULTIMATE.start_y)) (<= (+ multThread1of1ForFork0_z 6) (+ (* 3 ULTIMATE.start_y) (* 2 ULTIMATE.start_x)))) (or (not (< 1 ULTIMATE.start_y)) (<= (* 2 ULTIMATE.start_x) multThread1of1ForFork0_z))), 10295#(and (or (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) 3) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< 2 multThread1of1ForFork0_a))) (or (not (< 2 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b 3) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) (* multThread1of1ForFork0_a 2))))), 10287#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)))] [2022-03-15 20:35:12,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 20:35:12,938 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:35:12,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 20:35:12,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4352, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 20:35:12,938 INFO L87 Difference]: Start difference. First operand 89 states and 194 transitions. Second operand has 44 states, 43 states have (on average 1.697674418604651) internal successors, (73), 44 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:35:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:35:51,266 INFO L93 Difference]: Finished difference Result 475 states and 748 transitions. [2022-03-15 20:35:51,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2022-03-15 20:35:51,266 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.697674418604651) internal successors, (73), 44 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:35:51,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:35:51,267 INFO L225 Difference]: With dead ends: 475 [2022-03-15 20:35:51,267 INFO L226 Difference]: Without dead ends: 460 [2022-03-15 20:35:51,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19017 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=5694, Invalid=55562, Unknown=0, NotChecked=0, Total=61256 [2022-03-15 20:35:51,270 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1934 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 5908 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1934 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 6319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 5908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:35:51,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1934 Valid, 10 Invalid, 6319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 5908 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-03-15 20:35:51,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-03-15 20:35:51,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 90. [2022-03-15 20:35:51,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.2247191011235956) internal successors, (198), 89 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:35:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 198 transitions. [2022-03-15 20:35:51,273 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 198 transitions. Word has length 15 [2022-03-15 20:35:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:35:51,273 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 198 transitions. [2022-03-15 20:35:51,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.697674418604651) internal successors, (73), 44 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:35:51,274 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 198 transitions. [2022-03-15 20:35:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:35:51,274 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:35:51,274 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:35:51,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 20:35:51,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 20:35:51,481 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:35:51,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:35:51,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1428286327, now seen corresponding path program 9 times [2022-03-15 20:35:51,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:35:51,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063375827] [2022-03-15 20:35:51,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:35:51,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:35:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:35:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:35:51,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:35:51,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063375827] [2022-03-15 20:35:51,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063375827] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:35:51,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286539530] [2022-03-15 20:35:51,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:35:51,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:35:51,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:35:51,664 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:35:51,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 20:35:51,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:35:51,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:35:51,686 WARN L261 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 20:35:51,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:35:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:35:52,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:35:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:35:52,489 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286539530] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:35:52,489 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:35:52,489 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2022-03-15 20:35:52,490 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1559179701] [2022-03-15 20:35:52,490 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:35:52,490 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:35:52,493 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 73 transitions. [2022-03-15 20:35:52,493 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:35:53,828 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [11470#(and (or (<= (+ multThread1of1ForFork0_z 6 (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3) (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3))))), 11449#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ 2 ULTIMATE.start_z1 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 11455#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 11473#(and (or (<= (+ multThread1of1ForFork0_z 6) (+ (* multThread1of1ForFork1_a 2) (* multThread1of1ForFork1_b 3))) (not (< 2 multThread1of1ForFork1_a))) (or (not (< 2 multThread1of1ForFork1_a)) (<= (* multThread1of1ForFork1_b 3) multThread1of1ForFork0_z))), 11475#(and (<= (+ multThread1of1ForFork0_z 6) (+ (* 2 ULTIMATE.start_y) (* 3 ULTIMATE.start_x))) (<= (+ (* 2 ULTIMATE.start_y) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z 6 (* multThread1of1ForFork0_a 3)))), 11467#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork1_i 2) 4 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z 2 (* multThread1of1ForFork1_b 2) (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3))))), 11477#(and (<= (+ (* 2 ULTIMATE.start_y) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3)) (+ (* 2 ULTIMATE.start_y) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3)))), 11456#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 11465#(and (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b 4) (+ (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3)))) (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ 2 (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 11452#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) multThread1of1ForFork0_z)) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork1_i 2) 4) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 11461#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z 6 (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z)))), 11459#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b (* multThread1of1ForFork0_i 3) 1) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_a 3)))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b 2 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 11450#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork0_z 2 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b))) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z))), 11458#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z))) (or (<= (+ multThread1of1ForFork1_z 3 (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 3))) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)))), 11462#(and (or (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b (* multThread1of1ForFork0_i 3) 4) (+ multThread1of1ForFork0_z (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3))) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z 2 (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 11464#(and (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z))) (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z 6) (+ (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3))))), 11457#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 11463#(and (or (not (< 1 multThread1of1ForFork0_a)) (<= (* multThread1of1ForFork0_b 2) multThread1of1ForFork1_z) (< 2 multThread1of1ForFork0_a)) (or (not (< 1 multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 2)) (< 2 multThread1of1ForFork0_a))), 11476#(and (<= (+ (* 2 ULTIMATE.start_y) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b 3 (* multThread1of1ForFork0_a 3))) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b 3 (* multThread1of1ForFork0_a 3)) (+ (* 2 ULTIMATE.start_y) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3)))), 11451#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ ULTIMATE.start_z1 (* multThread1of1ForFork1_i 2) 4) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) ULTIMATE.start_z1))), 11468#(and (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z 2 (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3)))) (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 2) 4 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 11469#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b 6 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3) (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b 3 (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_a 3))))), 11453#(and (or (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a)) (<= (+ ULTIMATE.start_z1 6 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))) (or (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) ULTIMATE.start_z1) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a)))), 11474#(and (or (<= (+ multThread1of1ForFork0_z 6) (+ (* 2 ULTIMATE.start_y) (* 3 ULTIMATE.start_x))) (not (< 2 ULTIMATE.start_y))) (or (not (< 2 ULTIMATE.start_y)) (<= (* 3 ULTIMATE.start_x) multThread1of1ForFork0_z))), 11454#(and (or (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) multThread1of1ForFork0_z) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a))) (or (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork0_z 6 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))))), 11472#(and (or (not (< 2 multThread1of1ForFork1_a)) (<= (* multThread1of1ForFork1_b 3) ULTIMATE.start_z1)) (or (not (< 2 multThread1of1ForFork1_a)) (<= (+ ULTIMATE.start_z1 6) (+ (* multThread1of1ForFork1_a 2) (* multThread1of1ForFork1_b 3))))), 11466#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork1_i 2) 4) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2) (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_a 3) 1)))), 11460#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a))), 11471#(and (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) (+ (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3)))) (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ 6 (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))))] [2022-03-15 20:35:53,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 20:35:53,829 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:35:53,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 20:35:53,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4349, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 20:35:53,829 INFO L87 Difference]: Start difference. First operand 90 states and 198 transitions. Second operand has 44 states, 43 states have (on average 1.697674418604651) internal successors, (73), 44 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:36:36,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:36:36,968 INFO L93 Difference]: Finished difference Result 527 states and 822 transitions. [2022-03-15 20:36:36,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2022-03-15 20:36:36,969 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.697674418604651) internal successors, (73), 44 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:36:36,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:36:36,970 INFO L225 Difference]: With dead ends: 527 [2022-03-15 20:36:36,970 INFO L226 Difference]: Without dead ends: 509 [2022-03-15 20:36:36,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24241 ImplicationChecksByTransitivity, 41.8s TimeCoverageRelationStatistics Valid=6977, Invalid=67279, Unknown=0, NotChecked=0, Total=74256 [2022-03-15 20:36:36,973 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2227 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 5915 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2227 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 6421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 5915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:36:36,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2227 Valid, 15 Invalid, 6421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [506 Valid, 5915 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 20:36:36,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-03-15 20:36:36,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 90. [2022-03-15 20:36:36,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.2247191011235956) internal successors, (198), 89 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:36:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 198 transitions. [2022-03-15 20:36:36,976 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 198 transitions. Word has length 15 [2022-03-15 20:36:36,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:36:36,976 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 198 transitions. [2022-03-15 20:36:36,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.697674418604651) internal successors, (73), 44 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:36:36,977 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 198 transitions. [2022-03-15 20:36:36,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:36:36,977 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:36:36,977 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:36:36,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 20:36:37,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:36:37,178 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:36:37,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:36:37,178 INFO L85 PathProgramCache]: Analyzing trace with hash -696543020, now seen corresponding path program 10 times [2022-03-15 20:36:37,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:36:37,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346136128] [2022-03-15 20:36:37,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:36:37,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:36:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:36:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:36:37,349 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:36:37,350 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346136128] [2022-03-15 20:36:37,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346136128] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:36:37,350 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585472302] [2022-03-15 20:36:37,350 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:36:37,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:36:37,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:36:37,368 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:36:37,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 20:36:37,391 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:36:37,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:36:37,392 WARN L261 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 20:36:37,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:36:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:36:37,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:36:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:36:38,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585472302] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:36:38,194 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:36:38,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2022-03-15 20:36:38,194 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1687005548] [2022-03-15 20:36:38,194 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:36:38,194 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:36:38,197 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 69 transitions. [2022-03-15 20:36:38,197 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:36:39,742 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [12728#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) multThread1of1ForFork0_z)) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z 2) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2))))), 12739#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b 2) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2))) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_a 2 (* multThread1of1ForFork0_i 4) (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b)))), 12729#(and (or (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) multThread1of1ForFork0_z) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a))) (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z 3) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 3))) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a)))), 12731#(and (or (<= (* multThread1of1ForFork1_b 4) ULTIMATE.start_z1) (not (< 3 multThread1of1ForFork1_a))) (or (<= (+ ULTIMATE.start_z1 4) (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_a)) (not (< 3 multThread1of1ForFork1_a)))), 12742#(and (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 3) 1) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork1_i multThread1of1ForFork0_b)) (not (< 0 multThread1of1ForFork0_a))) (or (not (< 0 multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b 3) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 3))))), 12744#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b 4) (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z multThread1of1ForFork1_a)) (not (< 0 multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z multThread1of1ForFork1_a) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork1_i multThread1of1ForFork0_b)) (not (< 0 multThread1of1ForFork0_a)))), 12727#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)) (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a))) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z))), 12725#(and (or (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) ULTIMATE.start_z1) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a))) (or (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i 3 ULTIMATE.start_z1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 3))))), 12726#(and (or (not (< (+ multThread1of1ForFork1_i 3) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) ULTIMATE.start_z1)) (or (not (< (+ multThread1of1ForFork1_i 3) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i ULTIMATE.start_z1 4) (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z multThread1of1ForFork1_a)))), 12730#(and (or (not (< (+ multThread1of1ForFork1_i 3) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z 4) (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z multThread1of1ForFork1_a))) (or (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) multThread1of1ForFork0_z) (not (< (+ multThread1of1ForFork1_i 3) multThread1of1ForFork1_a)))), 12732#(and (or (not (< 3 multThread1of1ForFork1_a)) (<= (* multThread1of1ForFork1_b 4) multThread1of1ForFork0_z)) (or (<= (+ multThread1of1ForFork0_z 4) (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_a)) (not (< 3 multThread1of1ForFork1_a)))), 12740#(and (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_a 2 (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork1_i multThread1of1ForFork0_b)) (not (< 0 multThread1of1ForFork0_a))) (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b 2) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2))) (not (< 0 multThread1of1ForFork0_a)))), 12720#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 12743#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b 4) (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z multThread1of1ForFork1_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork0_i 4)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b)))), 12738#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)) (not (< 0 multThread1of1ForFork0_a))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a 3) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork1_i multThread1of1ForFork0_b)) (not (< 0 multThread1of1ForFork0_a)))), 12741#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 3) (* multThread1of1ForFork0_i 4) 1) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b 3) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 3))))), 12737#(and (or (not (< 0 multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z 4) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_b))) (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a)) (not (< 0 multThread1of1ForFork0_a)))), 12723#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i ULTIMATE.start_z1 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)))), 12722#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a 3 (* multThread1of1ForFork0_i 4)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b)))), 12724#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i 2 ULTIMATE.start_z1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) ULTIMATE.start_z1))), 12721#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork0_i 4) 4) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z multThread1of1ForFork0_b)))), 12733#(and (or (<= (+ multThread1of1ForFork0_z 4) (+ ULTIMATE.start_y (* ULTIMATE.start_x 4))) (not (< 3 ULTIMATE.start_y))) (or (not (< 3 ULTIMATE.start_y)) (<= (* ULTIMATE.start_x 4) multThread1of1ForFork0_z))), 12719#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 12718#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 12736#(and (or (< 1 multThread1of1ForFork0_a) (<= multThread1of1ForFork0_b multThread1of1ForFork1_z) (not (< 0 multThread1of1ForFork0_a))) (or (< 1 multThread1of1ForFork0_a) (<= multThread1of1ForFork1_z multThread1of1ForFork0_b) (not (< 0 multThread1of1ForFork0_a)))), 12734#(and (<= (+ multThread1of1ForFork0_z 4) (+ ULTIMATE.start_y (* ULTIMATE.start_x 4))) (<= (+ (* multThread1of1ForFork0_i 4) ULTIMATE.start_y (* ULTIMATE.start_x 4)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z 4))), 12735#(and (<= (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ (* multThread1of1ForFork0_i 4) ULTIMATE.start_y (* ULTIMATE.start_x 4))) (<= (+ (* multThread1of1ForFork0_i 4) ULTIMATE.start_y (* ULTIMATE.start_x 4)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z multThread1of1ForFork0_b)))] [2022-03-15 20:36:39,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 20:36:39,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:36:39,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 20:36:39,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=4079, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 20:36:39,743 INFO L87 Difference]: Start difference. First operand 90 states and 198 transitions. Second operand has 42 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 42 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:37:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:37:18,554 INFO L93 Difference]: Finished difference Result 576 states and 895 transitions. [2022-03-15 20:37:18,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2022-03-15 20:37:18,555 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 42 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:37:18,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:37:18,556 INFO L225 Difference]: With dead ends: 576 [2022-03-15 20:37:18,556 INFO L226 Difference]: Without dead ends: 555 [2022-03-15 20:37:18,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26785 ImplicationChecksByTransitivity, 37.9s TimeCoverageRelationStatistics Valid=7764, Invalid=71478, Unknown=0, NotChecked=0, Total=79242 [2022-03-15 20:37:18,559 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2212 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 4850 mSolverCounterSat, 565 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2212 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 565 IncrementalHoareTripleChecker+Valid, 4850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:37:18,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2212 Valid, 20 Invalid, 5415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [565 Valid, 4850 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 20:37:18,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-03-15 20:37:18,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 90. [2022-03-15 20:37:18,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.1797752808988764) internal successors, (194), 89 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:37:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 194 transitions. [2022-03-15 20:37:18,563 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 194 transitions. Word has length 15 [2022-03-15 20:37:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:37:18,563 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 194 transitions. [2022-03-15 20:37:18,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 42 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:37:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 194 transitions. [2022-03-15 20:37:18,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:37:18,563 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:37:18,563 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:37:18,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 20:37:18,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:37:18,778 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:37:18,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:37:18,778 INFO L85 PathProgramCache]: Analyzing trace with hash 512663017, now seen corresponding path program 5 times [2022-03-15 20:37:18,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:37:18,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750270796] [2022-03-15 20:37:18,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:37:18,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:37:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:37:18,934 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:37:18,935 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:37:18,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750270796] [2022-03-15 20:37:18,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750270796] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:37:18,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377598495] [2022-03-15 20:37:18,935 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:37:18,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:37:18,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:37:18,936 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:37:18,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 20:37:18,961 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:37:18,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:37:18,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 20:37:18,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:37:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:37:19,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:37:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:37:19,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377598495] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:37:19,500 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:37:19,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2022-03-15 20:37:19,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1403460389] [2022-03-15 20:37:19,500 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:37:19,500 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:37:19,502 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 61 transitions. [2022-03-15 20:37:19,503 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:37:20,253 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [14052#(and (<= multThread1of1ForFork1_z (* 5 multThread1of1ForFork0_a)) (<= 0 multThread1of1ForFork1_z)), 14068#(and (<= (* 5 ULTIMATE.start_x) multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z (* 5 ULTIMATE.start_x))), 14067#(and (<= (* 5 multThread1of1ForFork1_b) multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_b))), 14071#(and (<= multThread1of1ForFork0_z (* 5 ULTIMATE.start_x)) (<= (+ (* 5 multThread1of1ForFork0_i) (* 5 ULTIMATE.start_x)) (+ multThread1of1ForFork0_z (* 5 multThread1of1ForFork0_a)))), 14060#(and (<= multThread1of1ForFork0_z (+ multThread1of1ForFork1_z multThread1of1ForFork1_b)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z)), 14057#(and (<= ULTIMATE.start_z1 (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) ULTIMATE.start_z1)), 14058#(and (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) ULTIMATE.start_z1) (<= ULTIMATE.start_z1 (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))), 14015#(or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z))), 14054#(and (<= 0 (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) (* 5 multThread1of1ForFork0_a))), 14053#(and (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) (* 5 multThread1of1ForFork0_a)) (<= 0 (+ multThread1of1ForFork1_z multThread1of1ForFork1_b))), 14065#(and (<= (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z) multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z))), 14055#(and (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) (* 5 multThread1of1ForFork0_a)) (<= 0 (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))), 14063#(and (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z))), 14051#(and (or (<= 0 multThread1of1ForFork1_z) (< 0 multThread1of1ForFork0_a)) (or (<= multThread1of1ForFork1_z 0) (< 0 multThread1of1ForFork0_a))), 14061#(and (<= multThread1of1ForFork0_z (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) multThread1of1ForFork0_z)), 14064#(and (<= (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z) ULTIMATE.start_z1) (<= ULTIMATE.start_z1 (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z))), 14070#(and (<= (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z) (* 5 multThread1of1ForFork0_a)) (<= 0 (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z))), 14056#(and (<= ULTIMATE.start_z1 (+ multThread1of1ForFork1_z multThread1of1ForFork1_b)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)), 14062#(and (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))), 14066#(and (<= (* 5 multThread1of1ForFork1_b) ULTIMATE.start_z1) (<= ULTIMATE.start_z1 (* 5 multThread1of1ForFork1_b))), 14059#(and (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) ULTIMATE.start_z1) (<= ULTIMATE.start_z1 (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z))), 14069#(and (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) (* 5 multThread1of1ForFork0_a)) (<= 0 (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z)))] [2022-03-15 20:37:20,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 20:37:20,253 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:37:20,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 20:37:20,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2728, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 20:37:20,254 INFO L87 Difference]: Start difference. First operand 90 states and 194 transitions. Second operand has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 36 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:37:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:37:23,056 INFO L93 Difference]: Finished difference Result 230 states and 443 transitions. [2022-03-15 20:37:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 20:37:23,056 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 36 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:37:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:37:23,057 INFO L225 Difference]: With dead ends: 230 [2022-03-15 20:37:23,057 INFO L226 Difference]: Without dead ends: 220 [2022-03-15 20:37:23,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2233 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1544, Invalid=8158, Unknown=0, NotChecked=0, Total=9702 [2022-03-15 20:37:23,058 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 389 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:37:23,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 23 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:37:23,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-03-15 20:37:23,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 92. [2022-03-15 20:37:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.065934065934066) internal successors, (188), 91 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:37:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 188 transitions. [2022-03-15 20:37:23,061 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 188 transitions. Word has length 15 [2022-03-15 20:37:23,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:37:23,061 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 188 transitions. [2022-03-15 20:37:23,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 36 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:37:23,061 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 188 transitions. [2022-03-15 20:37:23,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:37:23,061 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:37:23,061 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:37:23,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 20:37:23,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-03-15 20:37:23,277 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:37:23,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:37:23,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1734477845, now seen corresponding path program 6 times [2022-03-15 20:37:23,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:37:23,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676224791] [2022-03-15 20:37:23,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:37:23,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:37:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:37:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:37:23,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:37:23,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676224791] [2022-03-15 20:37:23,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676224791] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:37:23,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464432235] [2022-03-15 20:37:23,435 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:37:23,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:37:23,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:37:23,436 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:37:23,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 20:37:23,456 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:37:23,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:37:23,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 20:37:23,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:37:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:37:23,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:37:23,945 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:37:23,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464432235] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:37:23,946 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:37:23,946 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2022-03-15 20:37:23,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [503334853] [2022-03-15 20:37:23,946 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:37:23,947 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:37:23,949 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 68 transitions. [2022-03-15 20:37:23,949 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:37:24,921 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [14712#(and (<= (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z) multThread1of1ForFork1_z) (<= multThread1of1ForFork1_z (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z))), 14714#(and (<= ULTIMATE.start_z1 (* multThread1of1ForFork1_a 6)) (<= 0 ULTIMATE.start_z1)), 14707#(and (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) multThread1of1ForFork1_z) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)))), 14718#(and (<= 0 (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) (* 6 ULTIMATE.start_y))), 14719#(and (<= 0 (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) (* 6 ULTIMATE.start_y))), 14722#(and (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 6)) multThread1of1ForFork1_z) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 6)))), 14721#(and (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 6)) (* 6 ULTIMATE.start_y)) (<= 0 (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 6)))), 14713#(and (<= (+ (* 5 multThread1of1ForFork0_b) (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z) (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_a 6))) (<= multThread1of1ForFork1_z (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z))), 14703#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 14706#(and (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) multThread1of1ForFork1_z)), 14725#(and (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 6)) (<= (+ (* multThread1of1ForFork1_i 6) (* multThread1of1ForFork0_b 6)) (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_a 6)))), 14708#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (<= (+ (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_a 6)))), 14717#(and (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) (* 6 ULTIMATE.start_y)) (<= 0 (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)))), 14705#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z)), 14704#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z)), 14716#(and (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) (* 6 ULTIMATE.start_y)) (<= 0 (+ multThread1of1ForFork0_z multThread1of1ForFork0_b))), 14720#(and (<= (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z) (* 6 ULTIMATE.start_y)) (<= 0 (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z))), 14724#(and (<= (+ (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 6)) (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_a 6))) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 6)))), 14711#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4))) (<= (+ (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_a 6)))), 14723#(and (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 6)) (<= (* multThread1of1ForFork0_b 6) multThread1of1ForFork1_z)), 14709#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (<= (+ (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_a 6)))), 14715#(and (<= multThread1of1ForFork0_z (* 6 ULTIMATE.start_y)) (<= 0 multThread1of1ForFork0_z)), 14710#(and (<= (+ (* multThread1of1ForFork1_i 6) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_a 6))) (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)))] [2022-03-15 20:37:24,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 20:37:24,922 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:37:24,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 20:37:24,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=3542, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 20:37:24,923 INFO L87 Difference]: Start difference. First operand 92 states and 188 transitions. Second operand has 39 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 38 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:37:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:37:29,013 INFO L93 Difference]: Finished difference Result 244 states and 467 transitions. [2022-03-15 20:37:29,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 20:37:29,013 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 38 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:37:29,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:37:29,014 INFO L225 Difference]: With dead ends: 244 [2022-03-15 20:37:29,014 INFO L226 Difference]: Without dead ends: 236 [2022-03-15 20:37:29,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3234 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2605, Invalid=12401, Unknown=0, NotChecked=0, Total=15006 [2022-03-15 20:37:29,015 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 623 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:37:29,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [623 Valid, 29 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1698 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 20:37:29,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-03-15 20:37:29,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 101. [2022-03-15 20:37:29,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.18) internal successors, (218), 100 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:37:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 218 transitions. [2022-03-15 20:37:29,018 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 218 transitions. Word has length 16 [2022-03-15 20:37:29,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:37:29,018 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 218 transitions. [2022-03-15 20:37:29,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 38 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:37:29,018 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 218 transitions. [2022-03-15 20:37:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:37:29,018 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:37:29,018 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:37:29,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 20:37:29,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-03-15 20:37:29,227 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:37:29,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:37:29,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1673580416, now seen corresponding path program 11 times [2022-03-15 20:37:29,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:37:29,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299638225] [2022-03-15 20:37:29,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:37:29,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:37:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:37:29,419 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:37:29,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:37:29,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299638225] [2022-03-15 20:37:29,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299638225] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:37:29,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806939030] [2022-03-15 20:37:29,419 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:37:29,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:37:29,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:37:29,420 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:37:29,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 20:37:29,450 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:37:29,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:37:29,454 WARN L261 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:37:29,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:37:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:37:29,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:37:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:37:30,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806939030] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:37:30,211 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:37:30,211 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 41 [2022-03-15 20:37:30,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1487346350] [2022-03-15 20:37:30,212 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:37:30,212 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:37:30,215 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 78 transitions. [2022-03-15 20:37:30,215 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:37:31,991 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [15441#(and (<= (+ (* 5 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a 3 (* multThread1of1ForFork0_b 2))) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_a 3 (* multThread1of1ForFork0_b 2)) (+ (* 5 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x))), 15455#(and (or (<= (+ (* 5 multThread1of1ForFork0_b) 5 multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a))) (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i (* 5 multThread1of1ForFork1_a)) (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z multThread1of1ForFork0_a (* 5 multThread1of1ForFork1_i))))), 15448#(and (or (<= (+ 5 multThread1of1ForFork0_z multThread1of1ForFork0_b (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a))) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i (* 5 multThread1of1ForFork1_a)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a (* 5 multThread1of1ForFork1_i) 4)))), 15429#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a))), 15447#(and (or (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a))) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 4) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 4))))), 15430#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) multThread1of1ForFork1_z))), 15446#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a)))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 3) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z multThread1of1ForFork0_a)))), 15452#(and (<= (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z multThread1of1ForFork0_a) (+ (* 5 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x)) (<= (+ (* 5 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x) (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z multThread1of1ForFork0_a))), 15456#(and (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a)) (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_a (* 5 multThread1of1ForFork1_i))) (not (< 4 multThread1of1ForFork0_a))) (or (not (< 4 multThread1of1ForFork0_a)) (<= (+ (* 5 multThread1of1ForFork0_b) 5 (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a))))), 15445#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i) (* multThread1of1ForFork0_b 2)) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a)))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 2) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 2))) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)))), 15428#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 15438#(and (or (<= (+ 5 multThread1of1ForFork0_z) (+ (* 5 ULTIMATE.start_y) ULTIMATE.start_x)) (not (< 0 ULTIMATE.start_y))) (or (<= ULTIMATE.start_x multThread1of1ForFork0_z) (not (< 0 ULTIMATE.start_y)))), 15434#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ 5 ULTIMATE.start_z1 (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a))))), 15437#(and (or (not (< 0 multThread1of1ForFork1_a)) (<= (+ 5 multThread1of1ForFork0_z) (+ multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a)))) (or (<= multThread1of1ForFork1_b multThread1of1ForFork0_z) (not (< 0 multThread1of1ForFork1_a)))), 15435#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ 5 multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a))))), 15427#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 15426#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 15433#(and (or (<= multThread1of1ForFork1_z (* 5 multThread1of1ForFork0_b)) (not (< 4 multThread1of1ForFork0_a)) (< 5 multThread1of1ForFork0_a)) (or (<= (* 5 multThread1of1ForFork0_b) multThread1of1ForFork1_z) (not (< 4 multThread1of1ForFork0_a)) (< 5 multThread1of1ForFork0_a))), 15449#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ 5 multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i) (* multThread1of1ForFork0_b 2)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i (* 5 multThread1of1ForFork1_a)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a 3 (* 5 multThread1of1ForFork1_i) (* multThread1of1ForFork0_b 2))))), 15432#(and (or (<= (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z) multThread1of1ForFork1_z) (< (+ 5 multThread1of1ForFork0_i) multThread1of1ForFork0_a) (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a))) (or (< (+ 5 multThread1of1ForFork0_i) multThread1of1ForFork0_a) (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z)))), 15450#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i (* 5 multThread1of1ForFork1_a)) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z multThread1of1ForFork0_a 2 (* 5 multThread1of1ForFork1_i)))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ 5 (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a))))), 15440#(and (<= (+ (* 5 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a 4)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a 4) (+ (* 5 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x))), 15439#(and (<= (+ 5 multThread1of1ForFork0_z) (+ (* 5 ULTIMATE.start_y) ULTIMATE.start_x)) (<= (+ (* 5 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x) (+ 5 multThread1of1ForFork0_z multThread1of1ForFork0_a))), 15454#(and (or (<= (+ (* 5 multThread1of1ForFork0_b) (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a))) (not (< 4 multThread1of1ForFork0_a))) (or (<= (+ 5 multThread1of1ForFork1_z) (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_a)) (not (< 4 multThread1of1ForFork0_a)))), 15453#(and (or (<= (+ 5 multThread1of1ForFork1_z multThread1of1ForFork0_i) (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z multThread1of1ForFork0_a)) (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a))) (or (<= (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a))) (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a)))), 15442#(and (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z multThread1of1ForFork0_a 2) (+ (* 5 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x)) (<= (+ (* 5 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z multThread1of1ForFork0_a 2))), 15443#(and (<= (+ (* 5 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 4) 1)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 4) 1) (+ (* 5 ULTIMATE.start_y) multThread1of1ForFork0_i ULTIMATE.start_x))), 15431#(and (or (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a))) (or (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4))) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)))), 15436#(and (or (not (< 0 multThread1of1ForFork1_a)) (<= multThread1of1ForFork1_b ULTIMATE.start_z1)) (or (not (< 0 multThread1of1ForFork1_a)) (<= (+ 5 ULTIMATE.start_z1) (+ multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a))))), 15444#(and (or (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a))) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 1) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a)))), 15451#(and (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ 5 multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a)))) (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i (* 5 multThread1of1ForFork1_a)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 4) (* 5 multThread1of1ForFork1_i) 1))))] [2022-03-15 20:37:31,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 20:37:31,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:37:31,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 20:37:31,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=5026, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 20:37:31,992 INFO L87 Difference]: Start difference. First operand 101 states and 218 transitions. Second operand has 47 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 47 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:38:07,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:38:07,948 INFO L93 Difference]: Finished difference Result 501 states and 805 transitions. [2022-03-15 20:38:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2022-03-15 20:38:07,948 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 47 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:38:07,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:38:07,950 INFO L225 Difference]: With dead ends: 501 [2022-03-15 20:38:07,950 INFO L226 Difference]: Without dead ends: 489 [2022-03-15 20:38:07,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16391 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=4843, Invalid=51089, Unknown=0, NotChecked=0, Total=55932 [2022-03-15 20:38:07,952 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1802 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 7085 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1802 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 7412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 7085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:38:07,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1802 Valid, 6 Invalid, 7412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 7085 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-03-15 20:38:07,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-03-15 20:38:07,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 104. [2022-03-15 20:38:07,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.233009708737864) internal successors, (230), 103 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:38:07,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 230 transitions. [2022-03-15 20:38:07,956 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 230 transitions. Word has length 16 [2022-03-15 20:38:07,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:38:07,956 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 230 transitions. [2022-03-15 20:38:07,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 47 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:38:07,956 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 230 transitions. [2022-03-15 20:38:07,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:38:07,957 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:38:07,957 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:38:07,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 20:38:08,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:38:08,167 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:38:08,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:38:08,168 INFO L85 PathProgramCache]: Analyzing trace with hash -50795893, now seen corresponding path program 12 times [2022-03-15 20:38:08,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:38:08,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358181851] [2022-03-15 20:38:08,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:38:08,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:38:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:38:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:38:08,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:38:08,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358181851] [2022-03-15 20:38:08,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358181851] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:38:08,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850728588] [2022-03-15 20:38:08,346 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:38:08,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:38:08,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:38:08,347 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:38:08,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 20:38:08,370 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:38:08,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:38:08,370 WARN L261 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:38:08,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:38:08,801 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:38:08,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:38:09,320 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:38:09,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850728588] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:38:09,320 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:38:09,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 41 [2022-03-15 20:38:09,320 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1904378974] [2022-03-15 20:38:09,320 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:38:09,321 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:38:09,324 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 84 transitions. [2022-03-15 20:38:09,324 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:38:11,622 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [16659#(and (or (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 4) 8) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (not (< 3 multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 4))) (not (< 3 multThread1of1ForFork0_a)))), 16649#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 4) (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 2 (* multThread1of1ForFork0_a 2)))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 8) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 16629#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z 8) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) multThread1of1ForFork0_z))), 16650#(and (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 2 (* multThread1of1ForFork0_a 2)) (+ (* ULTIMATE.start_y 4) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x))) (<= (+ (* ULTIMATE.start_y 4) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x)) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 2 (* multThread1of1ForFork0_a 2)))), 16636#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 16645#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 4) (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z multThread1of1ForFork1_b) (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 2)))) (or (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z 4 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)))), 16647#(and (or (<= (+ (* multThread1of1ForFork1_a 4) (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2) 6)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z multThread1of1ForFork0_b 8) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 16626#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 4) ULTIMATE.start_z1 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 16652#(and (or (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a))) (or (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4))) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)))), 16627#(and (or (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a))) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z))), 16651#(and (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 4)) (+ (* ULTIMATE.start_y 4) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x))) (<= (+ (* ULTIMATE.start_y 4) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 4)))), 16637#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 16654#(and (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z))) (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z 8) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 4))))), 16658#(and (or (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 4) 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< 3 multThread1of1ForFork0_a))) (or (not (< 3 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b 4) (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 4))))), 16632#(and (or (not (< 1 ULTIMATE.start_y)) (<= (+ multThread1of1ForFork0_z 8) (+ (* ULTIMATE.start_y 4) (* 2 ULTIMATE.start_x)))) (or (not (< 1 ULTIMATE.start_y)) (<= (* 2 ULTIMATE.start_x) multThread1of1ForFork0_z))), 16630#(and (or (not (< 1 multThread1of1ForFork1_a)) (<= (* multThread1of1ForFork1_b 2) ULTIMATE.start_z1)) (or (not (< 1 multThread1of1ForFork1_a)) (<= (+ ULTIMATE.start_z1 8) (+ (* multThread1of1ForFork1_a 4) (* multThread1of1ForFork1_b 2))))), 16648#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z 8 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 4) (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) 4 (* multThread1of1ForFork0_b 2))))), 16644#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z multThread1of1ForFork0_b 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 4) (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z multThread1of1ForFork1_b) (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z multThread1of1ForFork0_b 2 (* multThread1of1ForFork0_a 2))))), 16638#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 16643#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z 6) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2)))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z)))), 16656#(and (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) 8) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (<= (+ (* multThread1of1ForFork1_a 4) (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 4))) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)))), 16635#(and (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) 4 (* multThread1of1ForFork0_b 2)) (+ (* ULTIMATE.start_y 4) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x))) (<= (+ (* ULTIMATE.start_y 4) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) 4 (* multThread1of1ForFork0_b 2)))), 16640#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z 2) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2)))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z)))), 16633#(and (<= (+ multThread1of1ForFork0_z 8) (+ (* ULTIMATE.start_y 4) (* 2 ULTIMATE.start_x))) (<= (+ (* ULTIMATE.start_y 4) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) 8))), 16657#(and (or (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 4)) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z)) (not (< 3 multThread1of1ForFork0_a))) (or (not (< 3 multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z 8) (+ (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 4))))), 16641#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z 4) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 2)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z)))), 16628#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 4) ULTIMATE.start_z1 8) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) ULTIMATE.start_z1))), 16642#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) multThread1of1ForFork1_z))), 16634#(and (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2) 6) (+ (* ULTIMATE.start_y 4) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x))) (<= (+ (* ULTIMATE.start_y 4) (* multThread1of1ForFork0_i 2) (* 2 ULTIMATE.start_x)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2) 6))), 16631#(and (or (<= (+ multThread1of1ForFork0_z 8) (+ (* multThread1of1ForFork1_a 4) (* multThread1of1ForFork1_b 2))) (not (< 1 multThread1of1ForFork1_a))) (or (<= (* multThread1of1ForFork1_b 2) multThread1of1ForFork0_z) (not (< 1 multThread1of1ForFork1_a)))), 16646#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 4) (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z multThread1of1ForFork1_b 2) (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2)))) (or (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)))), 16653#(and (or (< 4 multThread1of1ForFork0_a) (not (< 3 multThread1of1ForFork0_a)) (<= (* multThread1of1ForFork0_b 4) multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 4)) (< 4 multThread1of1ForFork0_a) (not (< 3 multThread1of1ForFork0_a)))), 16655#(and (or (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 4) (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z multThread1of1ForFork1_b 4) (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 4))))), 16639#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)))] [2022-03-15 20:38:11,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 20:38:11,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:38:11,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 20:38:11,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=5468, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 20:38:11,623 INFO L87 Difference]: Start difference. First operand 104 states and 230 transitions. Second operand has 50 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:39:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:39:02,249 INFO L93 Difference]: Finished difference Result 577 states and 913 transitions. [2022-03-15 20:39:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2022-03-15 20:39:02,249 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:39:02,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:39:02,250 INFO L225 Difference]: With dead ends: 577 [2022-03-15 20:39:02,251 INFO L226 Difference]: Without dead ends: 562 [2022-03-15 20:39:02,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25051 ImplicationChecksByTransitivity, 48.9s TimeCoverageRelationStatistics Valid=6810, Invalid=72996, Unknown=0, NotChecked=0, Total=79806 [2022-03-15 20:39:02,253 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2562 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 8391 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2562 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 8917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 8391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:39:02,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2562 Valid, 12 Invalid, 8917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 8391 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 20:39:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-03-15 20:39:02,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 105. [2022-03-15 20:39:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 2.25) internal successors, (234), 104 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:39:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 234 transitions. [2022-03-15 20:39:02,258 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 234 transitions. Word has length 16 [2022-03-15 20:39:02,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:39:02,258 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 234 transitions. [2022-03-15 20:39:02,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:39:02,259 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 234 transitions. [2022-03-15 20:39:02,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:39:02,259 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:39:02,259 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:39:02,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 20:39:02,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:39:02,471 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:39:02,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:39:02,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1966853920, now seen corresponding path program 13 times [2022-03-15 20:39:02,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:39:02,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723369464] [2022-03-15 20:39:02,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:39:02,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:39:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:39:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:39:02,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:39:02,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723369464] [2022-03-15 20:39:02,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723369464] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:39:02,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986026513] [2022-03-15 20:39:02,688 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:39:02,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:39:02,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:39:02,689 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:39:02,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 20:39:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:39:02,720 WARN L261 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:39:02,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:39:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:39:03,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:39:03,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:39:03,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986026513] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:39:03,677 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:39:03,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 41 [2022-03-15 20:39:03,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [40352313] [2022-03-15 20:39:03,677 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:39:03,678 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:39:03,681 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 86 transitions. [2022-03-15 20:39:03,682 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:39:05,979 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [17997#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 18006#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z 6 (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3))))), 17996#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 3) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 18012#(and (or (<= (+ multThread1of1ForFork1_z 9) (+ (* multThread1of1ForFork0_b 3) (* multThread1of1ForFork0_a 3))) (not (< 2 multThread1of1ForFork0_a))) (or (not (< 2 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z)))), 18025#(and (or (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3) (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 3 (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3))) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 9 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))))), 18005#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a))), 18010#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z))) (or (<= (+ multThread1of1ForFork1_z 9 (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 3))) (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)))), 18026#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3) (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 3)))) (or (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 9) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))) (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)))), 18024#(and (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 3)) (+ (* 3 ULTIMATE.start_y) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3))) (<= (+ (* 3 ULTIMATE.start_y) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 3)))), 18007#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b 3 (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 3 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 18020#(and (<= (+ multThread1of1ForFork0_z 9) (+ (* 3 ULTIMATE.start_y) (* 3 ULTIMATE.start_x))) (<= (+ (* 3 ULTIMATE.start_y) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z 9 (* multThread1of1ForFork0_a 3)))), 18017#(and (or (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) multThread1of1ForFork0_z) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a))) (or (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 9) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))))), 18009#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) multThread1of1ForFork1_z))), 18022#(and (<= (+ (* 3 ULTIMATE.start_y) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b 6 (* multThread1of1ForFork0_a 3))) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b 6 (* multThread1of1ForFork0_a 3)) (+ (* 3 ULTIMATE.start_y) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3)))), 18000#(and (or (<= (+ multThread1of1ForFork1_z 3 (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 3))) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z)))), 18008#(and (or (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2) (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3))) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 6 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 17995#(and (or (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) ULTIMATE.start_z1) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a))) (or (<= (+ (* multThread1of1ForFork1_i 3) 9 ULTIMATE.start_z1) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a)))), 18011#(and (or (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 3)) (< 3 multThread1of1ForFork0_a) (not (< 2 multThread1of1ForFork0_a))) (or (< 3 multThread1of1ForFork0_a) (not (< 2 multThread1of1ForFork0_a)) (<= (* multThread1of1ForFork0_b 3) multThread1of1ForFork1_z))), 18004#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) multThread1of1ForFork0_z)) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 6) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 18019#(and (or (not (< 2 ULTIMATE.start_y)) (<= (+ multThread1of1ForFork0_z 9) (+ (* 3 ULTIMATE.start_y) (* 3 ULTIMATE.start_x)))) (or (not (< 2 ULTIMATE.start_y)) (<= (* 3 ULTIMATE.start_x) multThread1of1ForFork0_z))), 18021#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3) (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b 6 (* multThread1of1ForFork0_a 3)))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b 9) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))))), 18015#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z 3 (* multThread1of1ForFork1_b 2) (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 3)))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 6) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 18014#(and (or (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) 3) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< 2 multThread1of1ForFork0_a))) (or (not (< 2 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b 6) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) (* multThread1of1ForFork0_a 3))))), 17998#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 18016#(and (or (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) 6) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (not (< 2 multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z 3 (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) (* multThread1of1ForFork0_a 3))) (not (< 2 multThread1of1ForFork0_a)))), 18027#(and (or (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) 9) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))) (not (< 2 multThread1of1ForFork0_a))) (or (not (< 2 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) (* multThread1of1ForFork0_a 3))))), 18003#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2) (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b 3 (* multThread1of1ForFork0_a 3)))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b 6) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 18002#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b 3) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 3))))), 18023#(and (<= (+ (* 3 ULTIMATE.start_y) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z 3 (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3))) (<= (+ multThread1of1ForFork0_z 3 (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3)) (+ (* 3 ULTIMATE.start_y) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3)))), 17999#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 18001#(and (or (not (< 2 multThread1of1ForFork1_a)) (<= (* multThread1of1ForFork1_b 3) ULTIMATE.start_z1)) (or (<= (+ 9 ULTIMATE.start_z1) (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork1_b 3))) (not (< 2 multThread1of1ForFork1_a)))), 17994#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 3) ULTIMATE.start_z1 6) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) ULTIMATE.start_z1))), 17993#(and (or (<= (+ (* multThread1of1ForFork1_i 3) 3 ULTIMATE.start_z1) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a))) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1))), 18013#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b 6 (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 3)))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 3) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 18018#(and (or (not (< 2 multThread1of1ForFork1_a)) (<= (* multThread1of1ForFork1_b 3) multThread1of1ForFork0_z)) (or (not (< 2 multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork0_z 9) (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork1_b 3)))))] [2022-03-15 20:39:05,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 20:39:05,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:39:05,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 20:39:05,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=5617, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 20:39:05,980 INFO L87 Difference]: Start difference. First operand 105 states and 234 transitions. Second operand has 51 states, 50 states have (on average 1.72) internal successors, (86), 51 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:40:08,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:40:08,035 INFO L93 Difference]: Finished difference Result 641 states and 1004 transitions. [2022-03-15 20:40:08,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2022-03-15 20:40:08,036 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.72) internal successors, (86), 51 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:40:08,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:40:08,037 INFO L225 Difference]: With dead ends: 641 [2022-03-15 20:40:08,037 INFO L226 Difference]: Without dead ends: 623 [2022-03-15 20:40:08,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33248 ImplicationChecksByTransitivity, 60.1s TimeCoverageRelationStatistics Valid=8583, Invalid=92223, Unknown=0, NotChecked=0, Total=100806 [2022-03-15 20:40:08,041 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3126 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 8653 mSolverCounterSat, 674 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3126 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 9327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 674 IncrementalHoareTripleChecker+Valid, 8653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:40:08,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3126 Valid, 18 Invalid, 9327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [674 Valid, 8653 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-03-15 20:40:08,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2022-03-15 20:40:08,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 106. [2022-03-15 20:40:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 2.2666666666666666) internal successors, (238), 105 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:40:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 238 transitions. [2022-03-15 20:40:08,069 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 238 transitions. Word has length 16 [2022-03-15 20:40:08,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:40:08,069 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 238 transitions. [2022-03-15 20:40:08,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.72) internal successors, (86), 51 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:40:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 238 transitions. [2022-03-15 20:40:08,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:40:08,069 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:40:08,069 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:40:08,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 20:40:08,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-15 20:40:08,279 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:40:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:40:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1235110613, now seen corresponding path program 14 times [2022-03-15 20:40:08,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:40:08,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481869997] [2022-03-15 20:40:08,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:40:08,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:40:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:40:08,441 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:40:08,442 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:40:08,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481869997] [2022-03-15 20:40:08,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481869997] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:40:08,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956938047] [2022-03-15 20:40:08,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:40:08,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:40:08,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:40:08,443 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:40:08,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 20:40:08,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:40:08,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:40:08,468 WARN L261 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:40:08,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:40:08,850 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:40:08,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:40:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:40:09,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956938047] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:40:09,254 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:40:09,254 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 41 [2022-03-15 20:40:09,255 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1002868590] [2022-03-15 20:40:09,255 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:40:09,255 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:40:09,258 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 84 transitions. [2022-03-15 20:40:09,258 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:40:11,116 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [19508#(and (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2) 4) (+ (* multThread1of1ForFork0_a 4) (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)))) (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 2) 4 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 19520#(and (<= (+ (* 2 ULTIMATE.start_y) (* multThread1of1ForFork0_i 4) (* ULTIMATE.start_x 4)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z 8)) (<= (+ multThread1of1ForFork0_z 8) (+ (* 2 ULTIMATE.start_y) (* ULTIMATE.start_x 4)))), 19527#(and (<= (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z multThread1of1ForFork0_b 4) (+ (* 2 ULTIMATE.start_y) (* multThread1of1ForFork0_i 4) (* ULTIMATE.start_x 4))) (<= (+ (* 2 ULTIMATE.start_y) (* multThread1of1ForFork0_i 4) (* ULTIMATE.start_x 4)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z multThread1of1ForFork0_b 4))), 19510#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ ULTIMATE.start_z1 (* multThread1of1ForFork1_i 2) 4) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) ULTIMATE.start_z1))), 19519#(and (or (not (< 3 ULTIMATE.start_y)) (<= (* ULTIMATE.start_x 4) multThread1of1ForFork0_z)) (or (not (< 3 ULTIMATE.start_y)) (<= (+ multThread1of1ForFork0_z 8) (+ (* 2 ULTIMATE.start_y) (* ULTIMATE.start_x 4))))), 19507#(and (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b 6) (+ (* multThread1of1ForFork0_a 4) (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)))) (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ 2 (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 19500#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a))), 19503#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork0_i 4) (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork1_i 2)))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork1_i 2) 4) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 19528#(and (<= (+ (* 2 ULTIMATE.start_y) (* multThread1of1ForFork0_i 4) (* ULTIMATE.start_x 4)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (<= (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) (+ (* 2 ULTIMATE.start_y) (* multThread1of1ForFork0_i 4) (* ULTIMATE.start_x 4)))), 19495#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 19506#(and (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z))) (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z 8) (+ (* multThread1of1ForFork0_a 4) (* multThread1of1ForFork0_b 2))))), 19521#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b 6 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3) (* multThread1of1ForFork0_i 4)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z multThread1of1ForFork0_b 2 (* multThread1of1ForFork1_i 2))))), 19514#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork0_z 2 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b))) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z))), 19516#(and (or (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) multThread1of1ForFork0_z) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a))) (or (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork0_z 6 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))))), 19496#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 19509#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ 2 ULTIMATE.start_z1 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 19499#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b 2 (* multThread1of1ForFork0_i 4)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork1_i 2)))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b 2 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 19497#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 19505#(and (or (not (< 1 multThread1of1ForFork0_a)) (<= (* multThread1of1ForFork0_b 2) multThread1of1ForFork1_z) (< 2 multThread1of1ForFork0_a)) (or (not (< 1 multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 2)) (< 2 multThread1of1ForFork0_a))), 19524#(and (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z 2 (* multThread1of1ForFork1_b 3)) (+ (* multThread1of1ForFork0_a 4) (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)))) (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ 6 (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))))), 19502#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z 2 (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z multThread1of1ForFork1_b 6 (* multThread1of1ForFork0_i 4)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2))))), 19525#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z 8 (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z (* multThread1of1ForFork0_i 4)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2))))), 19523#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b 8 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z (* multThread1of1ForFork0_i 4)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork1_i 2) 4)))), 19522#(and (or (<= (+ multThread1of1ForFork0_z 6 (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z 2 (* multThread1of1ForFork1_b 3) (* multThread1of1ForFork0_i 4)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2))))), 19515#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) multThread1of1ForFork0_z)) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork1_i 2) 4) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 19501#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork0_i 4) 8) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z)))), 19504#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork1_i 2) 4 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork0_i 4) (* multThread1of1ForFork1_b 2) 4) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2))))), 19517#(and (or (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) multThread1of1ForFork0_z) (not (< (+ multThread1of1ForFork1_i 3) multThread1of1ForFork1_a))) (or (not (< (+ multThread1of1ForFork1_i 3) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork0_z 8 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z)))), 19512#(and (or (not (< (+ multThread1of1ForFork1_i 3) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) ULTIMATE.start_z1)) (or (not (< (+ multThread1of1ForFork1_i 3) multThread1of1ForFork1_a)) (<= (+ ULTIMATE.start_z1 8 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z)))), 19526#(and (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 2) (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) (+ (* multThread1of1ForFork0_a 4) (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)))) (or (not (< 1 multThread1of1ForFork0_a)) (<= (+ 8 (* multThread1of1ForFork1_i 2) (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 2) (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z)))), 19511#(and (or (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a)) (<= (+ ULTIMATE.start_z1 6 (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))) (or (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) ULTIMATE.start_z1) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a)))), 19518#(and (or (not (< 3 multThread1of1ForFork1_a)) (<= (* multThread1of1ForFork1_b 4) multThread1of1ForFork0_z)) (or (<= (+ multThread1of1ForFork0_z 8) (+ (* multThread1of1ForFork1_a 2) (* multThread1of1ForFork1_b 4))) (not (< 3 multThread1of1ForFork1_a)))), 19498#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork1_i 2)) (+ (* multThread1of1ForFork1_a 2) multThread1of1ForFork1_z))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork0_i 4) 4) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z multThread1of1ForFork0_b)))), 19513#(and (or (<= (* multThread1of1ForFork1_b 4) ULTIMATE.start_z1) (not (< 3 multThread1of1ForFork1_a))) (or (not (< 3 multThread1of1ForFork1_a)) (<= (+ ULTIMATE.start_z1 8) (+ (* multThread1of1ForFork1_a 2) (* multThread1of1ForFork1_b 4)))))] [2022-03-15 20:40:11,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 20:40:11,116 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:40:11,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 20:40:11,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=5461, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 20:40:11,117 INFO L87 Difference]: Start difference. First operand 106 states and 238 transitions. Second operand has 50 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:41:19,088 INFO L93 Difference]: Finished difference Result 695 states and 1081 transitions. [2022-03-15 20:41:19,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 266 states. [2022-03-15 20:41:19,088 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:41:19,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:41:19,090 INFO L225 Difference]: With dead ends: 695 [2022-03-15 20:41:19,090 INFO L226 Difference]: Without dead ends: 674 [2022-03-15 20:41:19,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39219 ImplicationChecksByTransitivity, 65.6s TimeCoverageRelationStatistics Valid=9886, Invalid=104696, Unknown=0, NotChecked=0, Total=114582 [2022-03-15 20:41:19,094 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3344 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 8011 mSolverCounterSat, 761 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3344 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 8772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 761 IncrementalHoareTripleChecker+Valid, 8011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:41:19,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3344 Valid, 24 Invalid, 8772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [761 Valid, 8011 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-03-15 20:41:19,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-03-15 20:41:19,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 105. [2022-03-15 20:41:19,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 2.25) internal successors, (234), 104 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 234 transitions. [2022-03-15 20:41:19,115 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 234 transitions. Word has length 16 [2022-03-15 20:41:19,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:41:19,115 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 234 transitions. [2022-03-15 20:41:19,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:19,115 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 234 transitions. [2022-03-15 20:41:19,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:41:19,115 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:41:19,115 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:41:19,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 20:41:19,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 20:41:19,331 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:41:19,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:41:19,332 INFO L85 PathProgramCache]: Analyzing trace with hash -25904576, now seen corresponding path program 15 times [2022-03-15 20:41:19,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:41:19,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306808833] [2022-03-15 20:41:19,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:41:19,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:41:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:41:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:19,517 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:41:19,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306808833] [2022-03-15 20:41:19,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306808833] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:41:19,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126414336] [2022-03-15 20:41:19,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:41:19,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:41:19,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:41:19,526 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:41:19,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 20:41:19,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:41:19,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:41:19,559 WARN L261 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:41:19,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:41:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:19,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:41:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:20,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126414336] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:41:20,211 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:41:20,211 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 41 [2022-03-15 20:41:20,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2050643494] [2022-03-15 20:41:20,212 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:41:20,212 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:41:20,215 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 78 transitions. [2022-03-15 20:41:20,215 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:41:21,545 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [21120#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b 4) (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z multThread1of1ForFork1_a)) (not (< 0 multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z multThread1of1ForFork1_a 1) (+ multThread1of1ForFork1_i multThread1of1ForFork0_b (* 5 multThread1of1ForFork0_a))) (not (< 0 multThread1of1ForFork0_a)))), 21106#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 21098#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) multThread1of1ForFork0_z)) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z 2) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2))))), 21092#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i ULTIMATE.start_z1 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)))), 21115#(and (or (< 1 multThread1of1ForFork0_a) (<= multThread1of1ForFork0_b multThread1of1ForFork1_z) (not (< 0 multThread1of1ForFork0_a))) (or (< 1 multThread1of1ForFork0_a) (<= multThread1of1ForFork1_z multThread1of1ForFork0_b) (not (< 0 multThread1of1ForFork0_a)))), 21114#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* 5 multThread1of1ForFork0_i) (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z multThread1of1ForFork1_a) (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b (* 5 multThread1of1ForFork0_a)))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ 5 multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z multThread1of1ForFork1_a)))), 21095#(and (or (not (< (+ multThread1of1ForFork1_i 3) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) ULTIMATE.start_z1)) (or (not (< (+ multThread1of1ForFork1_i 3) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i ULTIMATE.start_z1 4) (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z multThread1of1ForFork1_a)))), 21096#(and (or (<= (+ 5 multThread1of1ForFork1_i ULTIMATE.start_z1) (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z multThread1of1ForFork1_a)) (not (< (+ multThread1of1ForFork1_i 4) multThread1of1ForFork1_a))) (or (<= (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z) ULTIMATE.start_z1) (not (< (+ multThread1of1ForFork1_i 4) multThread1of1ForFork1_a)))), 21107#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 21097#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)) (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a))) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z))), 21103#(and (or (not (< 4 multThread1of1ForFork1_a)) (<= (+ 5 multThread1of1ForFork0_z) (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_a))) (or (<= (* 5 multThread1of1ForFork1_b) multThread1of1ForFork0_z) (not (< 4 multThread1of1ForFork1_a)))), 21113#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b 4) (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z multThread1of1ForFork1_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_b 4) (* 5 multThread1of1ForFork0_i) multThread1of1ForFork1_z multThread1of1ForFork1_a 1) (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b (* 5 multThread1of1ForFork0_a))))), 21119#(and (or (not (< 0 multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b 3) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 3)))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_a 2 (* multThread1of1ForFork1_b 3)) (+ multThread1of1ForFork1_i multThread1of1ForFork0_b (* 5 multThread1of1ForFork0_a))) (not (< 0 multThread1of1ForFork0_a)))), 21112#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b 3) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 3)))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* 5 multThread1of1ForFork0_i) multThread1of1ForFork1_z multThread1of1ForFork1_a 2 (* multThread1of1ForFork1_b 3)) (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b (* 5 multThread1of1ForFork0_a))))), 21108#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 21104#(and (or (<= (+ 5 multThread1of1ForFork0_z) (+ (* 5 ULTIMATE.start_x) ULTIMATE.start_y)) (not (< 4 ULTIMATE.start_y))) (or (<= (* 5 ULTIMATE.start_x) multThread1of1ForFork0_z) (not (< 4 ULTIMATE.start_y)))), 21100#(and (or (not (< (+ multThread1of1ForFork1_i 3) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z 4) (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z multThread1of1ForFork1_a))) (or (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) multThread1of1ForFork0_z) (not (< (+ multThread1of1ForFork1_i 3) multThread1of1ForFork1_a)))), 21122#(and (<= (+ (* 5 multThread1of1ForFork0_i) (* 5 ULTIMATE.start_x) ULTIMATE.start_y) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* 5 multThread1of1ForFork0_a))) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* 5 multThread1of1ForFork0_a)) (+ (* 5 multThread1of1ForFork0_i) (* 5 ULTIMATE.start_x) ULTIMATE.start_y))), 21099#(and (or (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) multThread1of1ForFork0_z) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a))) (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z 3) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 3))) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a)))), 21111#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b 2) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2))) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* 5 multThread1of1ForFork0_i) multThread1of1ForFork1_z multThread1of1ForFork1_a 3 (* multThread1of1ForFork1_b 2)) (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b (* 5 multThread1of1ForFork0_a))))), 21117#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)) (not (< 0 multThread1of1ForFork0_a))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a 4) (+ multThread1of1ForFork1_i multThread1of1ForFork0_b (* 5 multThread1of1ForFork0_a))) (not (< 0 multThread1of1ForFork0_a)))), 21101#(and (or (not (< (+ multThread1of1ForFork1_i 4) multThread1of1ForFork1_a)) (<= (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z) multThread1of1ForFork0_z)) (or (<= (+ 5 multThread1of1ForFork1_i multThread1of1ForFork0_z) (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z multThread1of1ForFork1_a)) (not (< (+ multThread1of1ForFork1_i 4) multThread1of1ForFork1_a)))), 21093#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i 2 ULTIMATE.start_z1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) ULTIMATE.start_z1))), 21109#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ 5 (* 5 multThread1of1ForFork0_i) multThread1of1ForFork1_z) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* 5 multThread1of1ForFork0_a))))), 21105#(and (<= (+ 5 multThread1of1ForFork0_z) (+ (* 5 ULTIMATE.start_x) ULTIMATE.start_y)) (<= (+ (* 5 multThread1of1ForFork0_i) (* 5 ULTIMATE.start_x) ULTIMATE.start_y) (+ 5 multThread1of1ForFork0_z (* 5 multThread1of1ForFork0_a)))), 21121#(and (or (<= (+ 5 multThread1of1ForFork1_i multThread1of1ForFork0_b) (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z multThread1of1ForFork1_a)) (not (< 0 multThread1of1ForFork0_a))) (or (<= (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z multThread1of1ForFork1_a) (+ multThread1of1ForFork1_i multThread1of1ForFork0_b (* 5 multThread1of1ForFork0_a))) (not (< 0 multThread1of1ForFork0_a)))), 21116#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a)) (not (< 0 multThread1of1ForFork0_a))) (or (<= (+ 5 multThread1of1ForFork1_z) (+ multThread1of1ForFork0_b (* 5 multThread1of1ForFork0_a))) (not (< 0 multThread1of1ForFork0_a)))), 21094#(and (or (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) ULTIMATE.start_z1) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a))) (or (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_i 3 ULTIMATE.start_z1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 3))))), 21118#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_b 2) (+ multThread1of1ForFork1_z multThread1of1ForFork1_a (* multThread1of1ForFork1_b 2))) (not (< 0 multThread1of1ForFork0_a))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_a 3 (* multThread1of1ForFork1_b 2)) (+ multThread1of1ForFork1_i multThread1of1ForFork0_b (* 5 multThread1of1ForFork0_a))) (not (< 0 multThread1of1ForFork0_a)))), 21110#(and (or (<= (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b 1) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* 5 multThread1of1ForFork0_i) multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork1_a 4) (+ multThread1of1ForFork1_i multThread1of1ForFork0_z multThread1of1ForFork0_b (* 5 multThread1of1ForFork0_a))))), 21102#(and (or (not (< 4 multThread1of1ForFork1_a)) (<= (+ 5 ULTIMATE.start_z1) (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_a))) (or (<= (* 5 multThread1of1ForFork1_b) ULTIMATE.start_z1) (not (< 4 multThread1of1ForFork1_a))))] [2022-03-15 20:41:21,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 20:41:21,547 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:41:21,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 20:41:21,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=5012, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 20:41:21,549 INFO L87 Difference]: Start difference. First operand 105 states and 234 transitions. Second operand has 47 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 47 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:13,868 INFO L93 Difference]: Finished difference Result 746 states and 1157 transitions. [2022-03-15 20:42:13,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 272 states. [2022-03-15 20:42:13,868 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 47 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:42:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:13,870 INFO L225 Difference]: With dead ends: 746 [2022-03-15 20:42:13,870 INFO L226 Difference]: Without dead ends: 722 [2022-03-15 20:42:13,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41047 ImplicationChecksByTransitivity, 50.6s TimeCoverageRelationStatistics Valid=10507, Invalid=106115, Unknown=0, NotChecked=0, Total=116622 [2022-03-15 20:42:13,873 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3124 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 6541 mSolverCounterSat, 793 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3124 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 7334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 793 IncrementalHoareTripleChecker+Valid, 6541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:13,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3124 Valid, 30 Invalid, 7334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [793 Valid, 6541 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-03-15 20:42:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2022-03-15 20:42:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 104. [2022-03-15 20:42:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.1941747572815533) internal successors, (226), 103 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 226 transitions. [2022-03-15 20:42:13,878 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 226 transitions. Word has length 16 [2022-03-15 20:42:13,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:13,878 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 226 transitions. [2022-03-15 20:42:13,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 47 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:13,878 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 226 transitions. [2022-03-15 20:42:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:42:13,878 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:13,878 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:13,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:14,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 20:42:14,094 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:14,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:14,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1195223093, now seen corresponding path program 6 times [2022-03-15 20:42:14,095 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:14,095 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261961102] [2022-03-15 20:42:14,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:14,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:14,247 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:14,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261961102] [2022-03-15 20:42:14,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261961102] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:14,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711504796] [2022-03-15 20:42:14,247 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:42:14,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:14,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:14,258 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:14,287 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:42:14,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:14,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 20:42:14,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 20:42:14,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:14,588 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:14,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:14,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711504796] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:14,871 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:14,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 35 [2022-03-15 20:42:14,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1204913198] [2022-03-15 20:42:14,871 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:14,872 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:14,874 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 68 transitions. [2022-03-15 20:42:14,875 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:15,611 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [22749#(and (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))), 22702#(or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z))), 22748#(and (<= multThread1of1ForFork0_z (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) multThread1of1ForFork0_z)), 22752#(and (<= (+ (* multThread1of1ForFork1_b 6) multThread1of1ForFork1_z) ULTIMATE.start_z1) (<= ULTIMATE.start_z1 (+ (* multThread1of1ForFork1_b 6) multThread1of1ForFork1_z))), 22765#(and (<= 0 (+ (* multThread1of1ForFork1_b 6) multThread1of1ForFork1_z)) (<= (+ (* multThread1of1ForFork1_b 6) multThread1of1ForFork1_z) (* multThread1of1ForFork0_a 6))), 22747#(and (<= multThread1of1ForFork0_z (+ multThread1of1ForFork1_z multThread1of1ForFork1_b)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z)), 22759#(and (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_a 6)) (<= 0 multThread1of1ForFork1_z)), 22753#(and (<= ULTIMATE.start_z1 (* multThread1of1ForFork1_b 6)) (<= (* multThread1of1ForFork1_b 6) ULTIMATE.start_z1)), 22758#(and (<= (+ (* 6 ULTIMATE.start_x) (* multThread1of1ForFork0_i 6)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 6))) (<= multThread1of1ForFork0_z (* 6 ULTIMATE.start_x))), 22754#(and (or (<= 0 multThread1of1ForFork1_z) (< 0 multThread1of1ForFork0_a)) (or (<= multThread1of1ForFork1_z 0) (< 0 multThread1of1ForFork0_a))), 22761#(and (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) (* multThread1of1ForFork0_a 6)) (<= 0 (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))), 22757#(and (<= (* 6 ULTIMATE.start_x) multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z (* 6 ULTIMATE.start_x))), 22763#(and (<= 0 (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z)) (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) (* multThread1of1ForFork0_a 6))), 22744#(and (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) ULTIMATE.start_z1) (<= ULTIMATE.start_z1 (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))), 22762#(and (<= 0 (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) (* multThread1of1ForFork0_a 6))), 22764#(and (<= (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z) (* multThread1of1ForFork0_a 6)) (<= 0 (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z))), 22760#(and (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) (* multThread1of1ForFork0_a 6)) (<= 0 (+ multThread1of1ForFork1_z multThread1of1ForFork1_b))), 22750#(and (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z))), 22743#(and (<= ULTIMATE.start_z1 (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) ULTIMATE.start_z1)), 22742#(and (<= ULTIMATE.start_z1 (+ multThread1of1ForFork1_z multThread1of1ForFork1_b)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)), 22746#(and (<= (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z) ULTIMATE.start_z1) (<= ULTIMATE.start_z1 (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z))), 22755#(and (<= multThread1of1ForFork0_z (+ (* multThread1of1ForFork1_b 6) multThread1of1ForFork1_z)) (<= (+ (* multThread1of1ForFork1_b 6) multThread1of1ForFork1_z) multThread1of1ForFork0_z)), 22756#(and (<= multThread1of1ForFork0_z (* multThread1of1ForFork1_b 6)) (<= (* multThread1of1ForFork1_b 6) multThread1of1ForFork0_z)), 22745#(and (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) ULTIMATE.start_z1) (<= ULTIMATE.start_z1 (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z))), 22751#(and (<= (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z) multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z (+ (* 5 multThread1of1ForFork1_b) multThread1of1ForFork1_z)))] [2022-03-15 20:42:15,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 20:42:15,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:15,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 20:42:15,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=3372, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 20:42:15,613 INFO L87 Difference]: Start difference. First operand 104 states and 226 transitions. Second operand has 41 states, 40 states have (on average 1.675) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:18,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:18,288 INFO L93 Difference]: Finished difference Result 276 states and 534 transitions. [2022-03-15 20:42:18,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 20:42:18,288 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.675) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:42:18,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:18,289 INFO L225 Difference]: With dead ends: 276 [2022-03-15 20:42:18,289 INFO L226 Difference]: Without dead ends: 266 [2022-03-15 20:42:18,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2756 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1818, Invalid=10172, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 20:42:18,290 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 517 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:18,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [517 Valid, 24 Invalid, 1803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:42:18,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-03-15 20:42:18,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 105. [2022-03-15 20:42:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 2.076923076923077) internal successors, (216), 104 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:18,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 216 transitions. [2022-03-15 20:42:18,292 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 216 transitions. Word has length 16 [2022-03-15 20:42:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:18,292 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 216 transitions. [2022-03-15 20:42:18,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.675) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 216 transitions. [2022-03-15 20:42:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:42:18,293 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:18,293 INFO L514 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:18,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:18,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 20:42:18,493 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:18,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:18,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1250204044, now seen corresponding path program 7 times [2022-03-15 20:42:18,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:18,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443567387] [2022-03-15 20:42:18,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:18,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:18,661 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:18,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443567387] [2022-03-15 20:42:18,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443567387] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:18,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476856972] [2022-03-15 20:42:18,661 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:42:18,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:18,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:18,663 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:18,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 20:42:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:18,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 20:42:18,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:19,031 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:19,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:19,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476856972] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:19,276 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:19,276 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2022-03-15 20:42:19,276 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [780697249] [2022-03-15 20:42:19,276 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:19,277 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:19,280 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 75 transitions. [2022-03-15 20:42:19,280 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:20,068 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [23502#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* 7 multThread1of1ForFork0_b))) (<= (+ multThread1of1ForFork0_z (* 7 multThread1of1ForFork0_b) (* 7 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 7 multThread1of1ForFork1_a)))), 23507#(and (<= 0 (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) (* 7 ULTIMATE.start_y))), 23494#(and (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 6)) multThread1of1ForFork1_z) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 6)))), 23509#(and (<= (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z) (* 7 ULTIMATE.start_y)) (<= 0 (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z))), 23488#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 23490#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z)), 23503#(and (<= ULTIMATE.start_z1 (* 7 multThread1of1ForFork1_a)) (<= 0 ULTIMATE.start_z1)), 23506#(and (<= 0 (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) (* 7 ULTIMATE.start_y))), 23504#(and (<= 0 multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z (* 7 ULTIMATE.start_y))), 23501#(and (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 6) (* 7 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 7 multThread1of1ForFork1_a))) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 6)))), 23492#(and (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) multThread1of1ForFork1_z) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)))), 23495#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* 7 multThread1of1ForFork0_b))) (<= (+ multThread1of1ForFork0_z (* 7 multThread1of1ForFork0_b)) multThread1of1ForFork1_z)), 23497#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2) (* 7 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 7 multThread1of1ForFork1_a)))), 23511#(and (<= (* 7 multThread1of1ForFork0_b) multThread1of1ForFork1_z) (<= multThread1of1ForFork1_z (* 7 multThread1of1ForFork0_b))), 23493#(and (<= (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z) multThread1of1ForFork1_z) (<= multThread1of1ForFork1_z (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z))), 23513#(and (<= (+ multThread1of1ForFork0_z (* 7 multThread1of1ForFork0_b)) (* 7 ULTIMATE.start_y)) (<= 0 (+ multThread1of1ForFork0_z (* 7 multThread1of1ForFork0_b)))), 23498#(and (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* 7 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 7 multThread1of1ForFork1_a))) (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z))), 23510#(and (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 6)) (* 7 ULTIMATE.start_y)) (<= 0 (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 6)))), 23496#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* 7 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 7 multThread1of1ForFork1_a)))), 23491#(and (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) multThread1of1ForFork1_z)), 23499#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) (* 7 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 7 multThread1of1ForFork1_a)))), 23512#(and (<= (+ (* 7 multThread1of1ForFork0_b) (* 7 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 7 multThread1of1ForFork1_a))) (<= multThread1of1ForFork1_z (* 7 multThread1of1ForFork0_b))), 23500#(and (<= (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z (* 7 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 7 multThread1of1ForFork1_a))) (<= multThread1of1ForFork1_z (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z))), 23489#(and (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z)), 23508#(and (<= 0 (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) (* 7 ULTIMATE.start_y))), 23505#(and (<= 0 (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) (* 7 ULTIMATE.start_y)))] [2022-03-15 20:42:20,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 20:42:20,069 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:20,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 20:42:20,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=4278, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 20:42:20,070 INFO L87 Difference]: Start difference. First operand 105 states and 216 transitions. Second operand has 43 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:24,255 INFO L93 Difference]: Finished difference Result 291 states and 560 transitions. [2022-03-15 20:42:24,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-03-15 20:42:24,255 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:42:24,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:24,256 INFO L225 Difference]: With dead ends: 291 [2022-03-15 20:42:24,256 INFO L226 Difference]: Without dead ends: 283 [2022-03-15 20:42:24,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4087 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3188, Invalid=15444, Unknown=0, NotChecked=0, Total=18632 [2022-03-15 20:42:24,261 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 763 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 2051 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 2290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 2051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:24,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [763 Valid, 33 Invalid, 2290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 2051 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 20:42:24,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-03-15 20:42:24,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 115. [2022-03-15 20:42:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 2.192982456140351) internal successors, (250), 114 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 250 transitions. [2022-03-15 20:42:24,264 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 250 transitions. Word has length 17 [2022-03-15 20:42:24,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:24,264 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 250 transitions. [2022-03-15 20:42:24,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 250 transitions. [2022-03-15 20:42:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:42:24,265 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:24,265 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:24,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:24,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 20:42:24,481 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:24,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:24,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2137113079, now seen corresponding path program 16 times [2022-03-15 20:42:24,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:24,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393969493] [2022-03-15 20:42:24,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:24,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:24,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:24,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393969493] [2022-03-15 20:42:24,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393969493] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:24,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013183099] [2022-03-15 20:42:24,628 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:42:24,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:24,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:24,629 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:24,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 20:42:24,651 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:42:24,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:24,652 WARN L261 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 20:42:24,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:25,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:25,444 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:25,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013183099] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:25,445 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:25,445 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 44 [2022-03-15 20:42:25,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1503148631] [2022-03-15 20:42:25,445 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:25,446 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:25,450 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 87 transitions. [2022-03-15 20:42:25,450 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:27,131 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [24325#(and (<= (+ multThread1of1ForFork0_i (* 6 ULTIMATE.start_y) ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 6))) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 6)) (+ multThread1of1ForFork0_i (* 6 ULTIMATE.start_y) ULTIMATE.start_x))), 24326#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 24341#(and (or (<= (+ (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z 6 (* multThread1of1ForFork0_b 4)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* multThread1of1ForFork1_a 6))) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i (* multThread1of1ForFork1_a 6)) (+ (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z multThread1of1ForFork0_a 2 (* multThread1of1ForFork0_b 4))))), 24347#(and (or (not (< 5 multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z 6) (+ multThread1of1ForFork0_a (* multThread1of1ForFork0_b 6)))) (or (<= (+ (* multThread1of1ForFork1_i 6) (* multThread1of1ForFork0_b 6)) (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_a 6))) (not (< 5 multThread1of1ForFork0_a)))), 24321#(and (<= (+ multThread1of1ForFork0_i (* 6 ULTIMATE.start_y) ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a 4 (* multThread1of1ForFork0_b 2))) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_a 4 (* multThread1of1ForFork0_b 2)) (+ multThread1of1ForFork0_i (* 6 ULTIMATE.start_y) ULTIMATE.start_x))), 24318#(and (or (<= (+ multThread1of1ForFork0_z 6) (+ (* 6 ULTIMATE.start_y) ULTIMATE.start_x)) (not (< 0 ULTIMATE.start_y))) (or (<= ULTIMATE.start_x multThread1of1ForFork0_z) (not (< 0 ULTIMATE.start_y)))), 24344#(and (or (not (< 5 multThread1of1ForFork0_a)) (<= (* multThread1of1ForFork0_b 6) multThread1of1ForFork1_z) (< 6 multThread1of1ForFork0_a)) (or (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 6)) (not (< 5 multThread1of1ForFork0_a)) (< 6 multThread1of1ForFork0_a))), 24332#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_a 6)))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 2) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 2))) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)))), 24322#(and (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z multThread1of1ForFork0_a 3) (+ multThread1of1ForFork0_i (* 6 ULTIMATE.start_y) ULTIMATE.start_x)) (<= (+ multThread1of1ForFork0_i (* 6 ULTIMATE.start_y) ULTIMATE.start_x) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z multThread1of1ForFork0_a 3))), 24337#(and (or (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a))) (or (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4))) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)))), 24327#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 24328#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 24340#(and (or (<= (+ (* 5 multThread1of1ForFork0_b) (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z) (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_a 6))) (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a))) (or (<= (+ 5 multThread1of1ForFork1_z multThread1of1ForFork0_i) (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z multThread1of1ForFork0_a)) (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a)))), 24315#(and (or (not (< 0 multThread1of1ForFork1_a)) (<= multThread1of1ForFork1_b ULTIMATE.start_z1)) (or (<= (+ ULTIMATE.start_z1 6) (+ multThread1of1ForFork1_b (* multThread1of1ForFork1_a 6))) (not (< 0 multThread1of1ForFork1_a)))), 24339#(and (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_a 6)))) (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 4) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 4))))), 24343#(and (or (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 6)) multThread1of1ForFork1_z) (not (< (+ 5 multThread1of1ForFork0_i) multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 6) multThread1of1ForFork0_a)) (or (not (< (+ 5 multThread1of1ForFork0_i) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 6))) (< (+ multThread1of1ForFork0_i 6) multThread1of1ForFork0_a))), 24348#(and (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* multThread1of1ForFork1_a 6)) (+ (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_a (* multThread1of1ForFork0_b 6))) (not (< 5 multThread1of1ForFork0_a))) (or (not (< 5 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 6) 6 (* multThread1of1ForFork0_b 6)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* multThread1of1ForFork1_a 6))))), 24336#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i (* multThread1of1ForFork1_a 6)) (+ (* multThread1of1ForFork1_i 6) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z multThread1of1ForFork0_a 3))) (or (<= (+ (* multThread1of1ForFork1_i 6) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 6) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* multThread1of1ForFork1_a 6))) (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)))), 24324#(and (<= (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z multThread1of1ForFork0_a 1) (+ multThread1of1ForFork0_i (* 6 ULTIMATE.start_y) ULTIMATE.start_x)) (<= (+ multThread1of1ForFork0_i (* 6 ULTIMATE.start_y) ULTIMATE.start_x) (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z multThread1of1ForFork0_a 1))), 24319#(and (<= (+ multThread1of1ForFork0_z 6) (+ (* 6 ULTIMATE.start_y) ULTIMATE.start_x)) (<= (+ multThread1of1ForFork0_i (* 6 ULTIMATE.start_y) ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a 6))), 24317#(and (or (<= multThread1of1ForFork1_b multThread1of1ForFork0_z) (not (< 0 multThread1of1ForFork1_a))) (or (<= (+ multThread1of1ForFork0_z 6) (+ multThread1of1ForFork1_b (* multThread1of1ForFork1_a 6))) (not (< 0 multThread1of1ForFork1_a)))), 24334#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) multThread1of1ForFork1_z))), 24316#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z 6) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* multThread1of1ForFork1_a 6)))) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z))), 24345#(and (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 6) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 6))) (not (< (+ 5 multThread1of1ForFork0_i) multThread1of1ForFork0_a))) (or (not (< (+ 5 multThread1of1ForFork0_i) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 6)) (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_a 6))))), 24346#(and (or (<= (+ (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z 6 (* multThread1of1ForFork0_b 6)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* multThread1of1ForFork1_a 6))) (not (< (+ 5 multThread1of1ForFork0_i) multThread1of1ForFork0_a))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i (* multThread1of1ForFork1_a 6)) (+ (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z multThread1of1ForFork0_a (* multThread1of1ForFork0_b 6))) (not (< (+ 5 multThread1of1ForFork0_i) multThread1of1ForFork0_a)))), 24323#(and (<= (+ multThread1of1ForFork0_i (* 6 ULTIMATE.start_y) ULTIMATE.start_x) (+ multThread1of1ForFork0_z multThread1of1ForFork0_a 2 (* multThread1of1ForFork0_b 4))) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_a 2 (* multThread1of1ForFork0_b 4)) (+ multThread1of1ForFork0_i (* 6 ULTIMATE.start_y) ULTIMATE.start_x))), 24331#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a))), 24342#(and (or (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a)) (<= (+ (* 5 multThread1of1ForFork0_b) (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z 6) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* multThread1of1ForFork1_a 6)))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i (* multThread1of1ForFork1_a 6)) (+ (* 5 multThread1of1ForFork0_b) (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z multThread1of1ForFork0_a 1)) (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a)))), 24314#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 6) ULTIMATE.start_z1 6) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* multThread1of1ForFork1_a 6))))), 24333#(and (or (<= (+ (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z 6 (* multThread1of1ForFork0_b 2)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* multThread1of1ForFork1_a 6))) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))) (or (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i (* multThread1of1ForFork1_a 6)) (+ (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z multThread1of1ForFork0_a 4 (* multThread1of1ForFork0_b 2))) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)))), 24329#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 1) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_a 6))) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)))), 24335#(and (or (<= (+ (* multThread1of1ForFork1_i 6) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_a 6))) (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork0_i 3) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z multThread1of1ForFork0_a)))), 24330#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b multThread1of1ForFork0_i (* multThread1of1ForFork1_a 6)) (+ 5 (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork1_i 6) multThread1of1ForFork0_z multThread1of1ForFork0_b 6) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* multThread1of1ForFork1_a 6))) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)))), 24338#(and (or (<= (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z) multThread1of1ForFork1_z) (< (+ 5 multThread1of1ForFork0_i) multThread1of1ForFork0_a) (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a))) (or (< (+ 5 multThread1of1ForFork0_i) multThread1of1ForFork0_a) (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z)))), 24320#(and (<= (+ multThread1of1ForFork0_i (* 6 ULTIMATE.start_y) ULTIMATE.start_x) (+ 5 multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a)) (<= (+ 5 multThread1of1ForFork0_z multThread1of1ForFork0_b multThread1of1ForFork0_a) (+ multThread1of1ForFork0_i (* 6 ULTIMATE.start_y) ULTIMATE.start_x)))] [2022-03-15 20:42:27,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 20:42:27,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:27,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 20:42:27,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=6060, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 20:42:27,132 INFO L87 Difference]: Start difference. First operand 115 states and 250 transitions. Second operand has 52 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 52 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:07,979 INFO L93 Difference]: Finished difference Result 598 states and 965 transitions. [2022-03-15 20:43:07,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2022-03-15 20:43:07,980 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 52 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:43:07,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:07,981 INFO L225 Difference]: With dead ends: 598 [2022-03-15 20:43:07,981 INFO L226 Difference]: Without dead ends: 586 [2022-03-15 20:43:07,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20326 ImplicationChecksByTransitivity, 38.9s TimeCoverageRelationStatistics Valid=5573, Invalid=63333, Unknown=0, NotChecked=0, Total=68906 [2022-03-15 20:43:07,984 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2229 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 9301 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2229 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 9697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 9301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:07,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2229 Valid, 7 Invalid, 9697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 9301 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-03-15 20:43:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-03-15 20:43:07,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 119. [2022-03-15 20:43:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 2.2542372881355934) internal successors, (266), 118 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 266 transitions. [2022-03-15 20:43:07,988 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 266 transitions. Word has length 17 [2022-03-15 20:43:07,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:07,988 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 266 transitions. [2022-03-15 20:43:07,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 52 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:07,988 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 266 transitions. [2022-03-15 20:43:07,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:43:07,988 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:07,988 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:08,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-03-15 20:43:08,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:08,192 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:08,192 INFO L85 PathProgramCache]: Analyzing trace with hash 433477908, now seen corresponding path program 17 times [2022-03-15 20:43:08,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:08,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017558265] [2022-03-15 20:43:08,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:08,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:08,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:08,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017558265] [2022-03-15 20:43:08,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017558265] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:08,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164020420] [2022-03-15 20:43:08,398 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:43:08,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:08,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:08,399 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:08,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 20:43:08,423 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:43:08,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:08,423 WARN L261 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 20:43:08,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:08,901 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:08,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:09,478 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:09,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164020420] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:09,478 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:09,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 44 [2022-03-15 20:43:09,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1185564201] [2022-03-15 20:43:09,478 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:09,479 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:09,483 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 95 transitions. [2022-03-15 20:43:09,483 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:11,911 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 39 new interpolants: [25696#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) multThread1of1ForFork1_z))), 25717#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i) 10) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a) (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a) (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* 5 multThread1of1ForFork1_i) 4)))), 25728#(and (<= (+ (* multThread1of1ForFork0_i 2) (* 5 ULTIMATE.start_y) (* 2 ULTIMATE.start_x)) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) 4)) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) 4) (+ (* multThread1of1ForFork0_i 2) (* 5 ULTIMATE.start_y) (* 2 ULTIMATE.start_x)))), 25713#(and (or (<= (* multThread1of1ForFork1_b 2) multThread1of1ForFork0_z) (not (< 1 multThread1of1ForFork1_a))) (or (not (< 1 multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork0_z 10) (+ (* 5 multThread1of1ForFork1_a) (* multThread1of1ForFork1_b 2))))), 25722#(and (or (<= (+ (* 5 multThread1of1ForFork0_b) (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a))) (not (< 4 multThread1of1ForFork0_a))) (or (<= (+ multThread1of1ForFork1_z 10) (+ (* 5 multThread1of1ForFork0_b) (* multThread1of1ForFork0_a 2))) (not (< 4 multThread1of1ForFork0_a)))), 25725#(and (<= (+ multThread1of1ForFork0_z 10) (+ (* 5 ULTIMATE.start_y) (* 2 ULTIMATE.start_x))) (<= (+ (* multThread1of1ForFork0_i 2) (* 5 ULTIMATE.start_y) (* 2 ULTIMATE.start_x)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) 10))), 25694#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 25708#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ 5 ULTIMATE.start_z1 (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a))))), 25695#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a))), 25714#(and (or (not (< 1 ULTIMATE.start_y)) (<= (+ multThread1of1ForFork0_z 10) (+ (* 5 ULTIMATE.start_y) (* 2 ULTIMATE.start_x)))) (or (not (< 1 ULTIMATE.start_y)) (<= (* 2 ULTIMATE.start_x) multThread1of1ForFork0_z))), 25711#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) multThread1of1ForFork0_z)) (or (<= (+ multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i) 10) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a) (* multThread1of1ForFork1_b 2))) (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)))), 25698#(and (or (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a))) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z 2) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2))))), 25719#(and (or (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z 10) (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2))) (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a))) (or (<= (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a))) (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a)))), 25716#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a) (* multThread1of1ForFork1_b 2)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) 6 (* 5 multThread1of1ForFork1_i) (* multThread1of1ForFork0_b 2)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i) (* multThread1of1ForFork0_b 2) 10) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a) (* multThread1of1ForFork1_b 2))))), 25721#(and (or (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a) (* multThread1of1ForFork1_b 2)) (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* 5 multThread1of1ForFork1_i))) (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a))) (or (<= (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i) 10) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a) (* multThread1of1ForFork1_b 2))) (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a)))), 25700#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z 6) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2)))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a))))), 25726#(and (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2) 8) (+ (* multThread1of1ForFork0_i 2) (* 5 ULTIMATE.start_y) (* 2 ULTIMATE.start_x))) (<= (+ (* multThread1of1ForFork0_i 2) (* 5 ULTIMATE.start_y) (* 2 ULTIMATE.start_x)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2) 8))), 25718#(and (or (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) (* 5 multThread1of1ForFork1_i) 10) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a) (* multThread1of1ForFork1_b 2))) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a) (* multThread1of1ForFork1_b 2)) (+ multThread1of1ForFork0_z 2 (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 4) (* 5 multThread1of1ForFork1_i))) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)))), 25705#(and (or (<= (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z) multThread1of1ForFork1_z) (< (+ 5 multThread1of1ForFork0_i) multThread1of1ForFork0_a) (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a))) (or (< (+ 5 multThread1of1ForFork0_i) multThread1of1ForFork0_a) (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z)))), 25710#(and (or (<= (+ ULTIMATE.start_z1 (* 5 multThread1of1ForFork1_i) 10) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a) (* multThread1of1ForFork1_b 2))) (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a))) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) ULTIMATE.start_z1))), 25701#(and (or (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a))) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z 8) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 4))))), 25723#(and (or (<= (+ 5 multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a)) (+ (* 5 multThread1of1ForFork0_b) (* multThread1of1ForFork0_a 2) (* 5 multThread1of1ForFork1_i))) (not (< 4 multThread1of1ForFork0_a))) (or (not (< 4 multThread1of1ForFork0_a)) (<= (+ (* 5 multThread1of1ForFork0_b) 5 (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a))))), 25697#(and (or (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a))) (or (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4))) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)))), 25699#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i) (* multThread1of1ForFork0_b 2)) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z 4) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 2))))), 25729#(and (<= (+ (* multThread1of1ForFork0_i 2) (* 5 ULTIMATE.start_y) (* 2 ULTIMATE.start_x)) (+ multThread1of1ForFork0_z 2 (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 4))) (<= (+ multThread1of1ForFork0_z 2 (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 4)) (+ (* multThread1of1ForFork0_i 2) (* 5 ULTIMATE.start_y) (* 2 ULTIMATE.start_x)))), 25703#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ 5 multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i) (* multThread1of1ForFork0_b 2)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a)))) (or (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* 5 multThread1of1ForFork1_i) (* multThread1of1ForFork0_b 2) 1)) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)))), 25727#(and (<= (+ (* multThread1of1ForFork0_i 2) (* 5 ULTIMATE.start_y) (* 2 ULTIMATE.start_x)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) 6 (* multThread1of1ForFork0_b 2))) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) 6 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork0_i 2) (* 5 ULTIMATE.start_y) (* 2 ULTIMATE.start_x)))), 25730#(and (<= (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2)) (+ (* multThread1of1ForFork0_i 2) (* 5 ULTIMATE.start_y) (* 2 ULTIMATE.start_x))) (<= (+ (* multThread1of1ForFork0_i 2) (* 5 ULTIMATE.start_y) (* 2 ULTIMATE.start_x)) (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2)))), 25724#(and (or (<= (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a) (* multThread1of1ForFork1_b 2)) (+ (* 5 multThread1of1ForFork0_b) (* multThread1of1ForFork0_a 2) (* 5 multThread1of1ForFork1_i))) (not (< 4 multThread1of1ForFork0_a))) (or (<= (+ (* 5 multThread1of1ForFork0_b) (* 5 multThread1of1ForFork1_i) 10) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a) (* multThread1of1ForFork1_b 2))) (not (< 4 multThread1of1ForFork0_a)))), 25707#(and (or (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z multThread1of1ForFork1_b 3 (* 5 multThread1of1ForFork1_a)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* multThread1of1ForFork0_b 4) (* 5 multThread1of1ForFork1_i))) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ 5 multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a))))), 25715#(and (or (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a) (* multThread1of1ForFork1_b 2)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2) 8 (* 5 multThread1of1ForFork1_i))) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* 5 multThread1of1ForFork1_i) 10) (+ multThread1of1ForFork1_z (* 5 multThread1of1ForFork1_a) (* multThread1of1ForFork1_b 2))) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)))), 25709#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ 5 multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a))))), 25702#(and (or (<= (+ 5 multThread1of1ForFork0_z multThread1of1ForFork0_b (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a))) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 2) 3 (* 5 multThread1of1ForFork1_i))))), 25693#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 25706#(and (or (<= multThread1of1ForFork1_z (* 5 multThread1of1ForFork0_b)) (not (< 4 multThread1of1ForFork0_a)) (< 5 multThread1of1ForFork0_a)) (or (<= (* 5 multThread1of1ForFork0_b) multThread1of1ForFork1_z) (not (< 4 multThread1of1ForFork0_a)) (< 5 multThread1of1ForFork0_a))), 25720#(and (or (<= (+ (* 5 multThread1of1ForFork0_b) 5 multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a))) (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork0_i 2) 5 multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a)) (+ (* 5 multThread1of1ForFork0_b) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* 5 multThread1of1ForFork1_i))) (not (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a)))), 25692#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 25704#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork0_i 2) multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a) 1) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 2) (* 5 multThread1of1ForFork1_i)))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ 5 (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* 5 multThread1of1ForFork1_i)) (+ multThread1of1ForFork1_z multThread1of1ForFork1_b (* 5 multThread1of1ForFork1_a))))), 25712#(and (or (<= (+ ULTIMATE.start_z1 10) (+ (* 5 multThread1of1ForFork1_a) (* multThread1of1ForFork1_b 2))) (not (< 1 multThread1of1ForFork1_a))) (or (not (< 1 multThread1of1ForFork1_a)) (<= (* multThread1of1ForFork1_b 2) ULTIMATE.start_z1)))] [2022-03-15 20:43:11,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-15 20:43:11,911 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:11,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-15 20:43:11,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=6710, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 20:43:11,912 INFO L87 Difference]: Start difference. First operand 119 states and 266 transitions. Second operand has 56 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 56 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:23,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:23,495 INFO L93 Difference]: Finished difference Result 690 states and 1096 transitions. [2022-03-15 20:44:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 237 states. [2022-03-15 20:44:23,495 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 56 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:44:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:23,497 INFO L225 Difference]: With dead ends: 690 [2022-03-15 20:44:23,497 INFO L226 Difference]: Without dead ends: 675 [2022-03-15 20:44:23,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31859 ImplicationChecksByTransitivity, 68.6s TimeCoverageRelationStatistics Valid=8019, Invalid=92787, Unknown=0, NotChecked=0, Total=100806 [2022-03-15 20:44:23,502 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3294 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 10812 mSolverCounterSat, 669 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3294 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 11481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 669 IncrementalHoareTripleChecker+Valid, 10812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:23,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3294 Valid, 14 Invalid, 11481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [669 Valid, 10812 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-03-15 20:44:23,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-03-15 20:44:23,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 121. [2022-03-15 20:44:23,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 2.283333333333333) internal successors, (274), 120 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 274 transitions. [2022-03-15 20:44:23,506 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 274 transitions. Word has length 17 [2022-03-15 20:44:23,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:23,506 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 274 transitions. [2022-03-15 20:44:23,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 56 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 274 transitions. [2022-03-15 20:44:23,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:44:23,507 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:23,507 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:23,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-03-15 20:44:23,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-03-15 20:44:23,734 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:23,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:23,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1482580119, now seen corresponding path program 18 times [2022-03-15 20:44:23,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:23,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577966258] [2022-03-15 20:44:23,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:23,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:23,941 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:23,941 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:23,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577966258] [2022-03-15 20:44:23,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577966258] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:23,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686983100] [2022-03-15 20:44:23,941 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:44:23,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:23,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:23,942 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:44:23,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 20:44:23,965 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:44:23,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:23,966 WARN L261 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 20:44:23,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:24,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:24,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686983100] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:24,791 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:24,791 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 44 [2022-03-15 20:44:24,791 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [914378251] [2022-03-15 20:44:24,792 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:24,792 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:24,796 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 99 transitions. [2022-03-15 20:44:24,796 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:27,052 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [27294#(and (<= (+ multThread1of1ForFork0_z 6 (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3)) (+ (* ULTIMATE.start_y 4) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3))) (<= (+ (* ULTIMATE.start_y 4) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z 6 (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3)))), 27311#(and (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) (* multThread1of1ForFork0_a 3)) (+ (* ULTIMATE.start_y 4) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3))) (<= (+ (* ULTIMATE.start_y 4) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) (* multThread1of1ForFork0_a 3)))), 27306#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 12) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))) (or (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3) (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 3 (* multThread1of1ForFork0_a 3))) (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)))), 27304#(and (or (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b 8 (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) (* multThread1of1ForFork0_a 3))) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)))), 27282#(and (or (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork1_a 4) 5 multThread1of1ForFork1_z multThread1of1ForFork1_b (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 3))) (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)))), 27288#(and (or (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) multThread1of1ForFork0_z) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a))) (or (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z 12) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))))), 27293#(and (<= (+ (* ULTIMATE.start_y 4) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b 9 (* multThread1of1ForFork0_a 3))) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b 9 (* multThread1of1ForFork0_a 3)) (+ (* ULTIMATE.start_y 4) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3)))), 27305#(and (or (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2) (* multThread1of1ForFork0_i 3) 4) (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) (* multThread1of1ForFork0_a 3))) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) 8) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 27290#(and (or (not (< 2 multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork0_z 12) (+ (* multThread1of1ForFork1_a 4) (* multThread1of1ForFork1_b 3)))) (or (not (< 2 multThread1of1ForFork1_a)) (<= (* multThread1of1ForFork1_b 3) multThread1of1ForFork0_z))), 27309#(and (or (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 4) 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< 3 multThread1of1ForFork0_a))) (or (not (< 3 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b 8) (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 4) (* multThread1of1ForFork0_a 3))))), 27280#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z multThread1of1ForFork0_b 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b))) (or (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 3) 1)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)))), 27283#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 4) ULTIMATE.start_z1 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 27274#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 27291#(and (or (not (< 2 ULTIMATE.start_y)) (<= (* 3 ULTIMATE.start_x) multThread1of1ForFork0_z)) (or (<= (+ multThread1of1ForFork0_z 12) (+ (* ULTIMATE.start_y 4) (* 3 ULTIMATE.start_x))) (not (< 2 ULTIMATE.start_y)))), 27292#(and (<= (+ multThread1of1ForFork0_z 12) (+ (* ULTIMATE.start_y 4) (* 3 ULTIMATE.start_x))) (<= (+ (* ULTIMATE.start_y 4) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z 12 (* multThread1of1ForFork0_a 3)))), 27297#(and (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 3 (* multThread1of1ForFork0_a 3)) (+ (* ULTIMATE.start_y 4) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3))) (<= (+ (* ULTIMATE.start_y 4) (* 3 ULTIMATE.start_x) (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 3 (* multThread1of1ForFork0_a 3)))), 27272#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 27310#(and (or (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 4) 8) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (not (< 3 multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2) 4) (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 4) (* multThread1of1ForFork0_a 3))) (not (< 3 multThread1of1ForFork0_a)))), 27298#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z multThread1of1ForFork0_b 8) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2) (* multThread1of1ForFork0_i 3)) (+ 5 (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 3))))), 27307#(and (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) 12) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))) (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3) (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) (* multThread1of1ForFork0_a 3))))), 27303#(and (or (<= (+ multThread1of1ForFork1_z 12 (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4) (* multThread1of1ForFork0_a 3))) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z)))), 27295#(and (or (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a))) (or (< (+ multThread1of1ForFork0_i 4) multThread1of1ForFork0_a) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 4))) (not (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)))), 27276#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) multThread1of1ForFork1_z))), 27299#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z 8 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2) (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z 2 (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3))))), 27275#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a))), 27300#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3) (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z multThread1of1ForFork0_b 9 (* multThread1of1ForFork0_a 3)))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z multThread1of1ForFork0_b 12) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))))), 27286#(and (or (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z 4) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a))) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z))), 27281#(and (or (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b 2 (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3))) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z 4 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)))), 27289#(and (or (not (< 2 multThread1of1ForFork1_a)) (<= (* multThread1of1ForFork1_b 3) ULTIMATE.start_z1)) (or (not (< 2 multThread1of1ForFork1_a)) (<= (+ ULTIMATE.start_z1 12) (+ (* multThread1of1ForFork1_a 4) (* multThread1of1ForFork1_b 3))))), 27273#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 27296#(and (or (< 4 multThread1of1ForFork0_a) (not (< 3 multThread1of1ForFork0_a)) (<= (* multThread1of1ForFork0_b 4) multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 4)) (< 4 multThread1of1ForFork0_a) (not (< 3 multThread1of1ForFork0_a)))), 27287#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z 8) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) multThread1of1ForFork0_z))), 27284#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 4) ULTIMATE.start_z1 8) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) ULTIMATE.start_z1))), 27277#(and (or (<= (+ multThread1of1ForFork1_z 3 (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z multThread1of1ForFork0_b (* multThread1of1ForFork0_a 3))) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z)))), 27302#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2) (* multThread1of1ForFork0_i 3) 1) (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 3)))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 8) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 27308#(and (or (<= (+ multThread1of1ForFork1_z 12) (+ (* multThread1of1ForFork0_b 4) (* multThread1of1ForFork0_a 3))) (not (< 3 multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 4)) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z)) (not (< 3 multThread1of1ForFork0_a)))), 27278#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z 6 (* multThread1of1ForFork0_i 3)) (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z)))), 27301#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z 12 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3) (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork1_i 4) multThread1of1ForFork0_z 6 (* multThread1of1ForFork0_b 2) (* multThread1of1ForFork0_a 3))))), 27312#(and (or (not (< 3 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 4) 12) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))) (or (<= (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 4) (* multThread1of1ForFork0_a 3))) (not (< 3 multThread1of1ForFork0_a)))), 27285#(and (or (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) ULTIMATE.start_z1) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a))) (or (<= (+ (* multThread1of1ForFork1_i 4) ULTIMATE.start_z1 12) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a)))), 27279#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) (+ (* multThread1of1ForFork1_a 4) multThread1of1ForFork1_z))) (or (<= (+ multThread1of1ForFork1_z 9 (* multThread1of1ForFork0_i 3)) (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_a 3))) (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a))))] [2022-03-15 20:44:27,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 20:44:27,052 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:27,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 20:44:27,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=7045, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 20:44:27,053 INFO L87 Difference]: Start difference. First operand 121 states and 274 transitions. Second operand has 58 states, 57 states have (on average 1.736842105263158) internal successors, (99), 58 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:09,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:46:09,143 INFO L93 Difference]: Finished difference Result 768 states and 1207 transitions. [2022-03-15 20:46:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 280 states. [2022-03-15 20:46:09,144 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.736842105263158) internal successors, (99), 58 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:46:09,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:46:09,146 INFO L225 Difference]: With dead ends: 768 [2022-03-15 20:46:09,146 INFO L226 Difference]: Without dead ends: 750 [2022-03-15 20:46:09,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43689 ImplicationChecksByTransitivity, 97.6s TimeCoverageRelationStatistics Valid=10350, Invalid=121056, Unknown=0, NotChecked=0, Total=131406 [2022-03-15 20:46:09,151 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4185 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 11889 mSolverCounterSat, 872 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4185 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 12761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 872 IncrementalHoareTripleChecker+Valid, 11889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:46:09,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4185 Valid, 21 Invalid, 12761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [872 Valid, 11889 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-03-15 20:46:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-03-15 20:46:09,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 122. [2022-03-15 20:46:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.2975206611570247) internal successors, (278), 121 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 278 transitions. [2022-03-15 20:46:09,157 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 278 transitions. Word has length 17 [2022-03-15 20:46:09,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:46:09,157 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 278 transitions. [2022-03-15 20:46:09,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.736842105263158) internal successors, (99), 58 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 278 transitions. [2022-03-15 20:46:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:46:09,158 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:46:09,158 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:46:09,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 20:46:09,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:09,374 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:46:09,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:46:09,374 INFO L85 PathProgramCache]: Analyzing trace with hash -750836812, now seen corresponding path program 19 times [2022-03-15 20:46:09,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:46:09,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256404327] [2022-03-15 20:46:09,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:46:09,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:46:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:09,593 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:09,593 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:46:09,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256404327] [2022-03-15 20:46:09,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256404327] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:46:09,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903980230] [2022-03-15 20:46:09,593 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:46:09,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:09,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:46:09,594 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:46:09,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 20:46:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:09,618 WARN L261 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 20:46:09,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:46:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:10,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:46:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:10,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903980230] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:46:10,711 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:46:10,711 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 44 [2022-03-15 20:46:10,711 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [461627497] [2022-03-15 20:46:10,711 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:46:10,712 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:46:10,716 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 99 transitions. [2022-03-15 20:46:10,716 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:46:12,972 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [29032#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b (* multThread1of1ForFork0_i 4) 1) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z multThread1of1ForFork0_b))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b 3) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 29046#(and (or (not (< 3 multThread1of1ForFork1_a)) (<= (* multThread1of1ForFork1_b 4) multThread1of1ForFork0_z)) (or (not (< 3 multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork0_z 12) (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork1_b 4))))), 29038#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 9 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3) (* multThread1of1ForFork0_i 4)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2) 1)))), 29042#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) multThread1of1ForFork0_z)) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 6) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 29050#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z (* multThread1of1ForFork0_i 4)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z multThread1of1ForFork0_b 8))) (or (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b 12) (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)))), 29035#(and (or (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork0_i 4) (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z multThread1of1ForFork0_b 2)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b 6) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 29031#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork0_i 4) 12) (+ (* multThread1of1ForFork0_a 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z)))), 29052#(and (<= (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z 4 (* multThread1of1ForFork0_b 2)) (+ (* 3 ULTIMATE.start_y) (* multThread1of1ForFork0_i 4) (* ULTIMATE.start_x 4))) (<= (+ (* 3 ULTIMATE.start_y) (* multThread1of1ForFork0_i 4) (* ULTIMATE.start_x 4)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z 4 (* multThread1of1ForFork0_b 2)))), 29047#(and (or (not (< 3 ULTIMATE.start_y)) (<= (* ULTIMATE.start_x 4) multThread1of1ForFork0_z)) (or (not (< 3 ULTIMATE.start_y)) (<= (+ multThread1of1ForFork0_z 12) (+ (* 3 ULTIMATE.start_y) (* ULTIMATE.start_x 4))))), 29043#(and (or (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) multThread1of1ForFork0_z) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a))) (or (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 9) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))))), 29033#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 3 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) 5 multThread1of1ForFork1_z multThread1of1ForFork1_b (* multThread1of1ForFork0_i 4)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))))), 29055#(and (or (<= multThread1of1ForFork1_z (* multThread1of1ForFork0_b 3)) (< 3 multThread1of1ForFork0_a) (not (< 2 multThread1of1ForFork0_a))) (or (< 3 multThread1of1ForFork0_a) (not (< 2 multThread1of1ForFork0_a)) (<= (* multThread1of1ForFork0_b 3) multThread1of1ForFork1_z))), 29037#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3) (* multThread1of1ForFork0_i 4)) (+ 5 (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z multThread1of1ForFork0_b))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b 9) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))))), 29044#(and (or (not (< (+ multThread1of1ForFork1_i 3) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 12) (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z))) (or (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) multThread1of1ForFork0_z) (not (< (+ multThread1of1ForFork1_i 3) multThread1of1ForFork1_a)))), 29039#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z 6 (* multThread1of1ForFork0_i 4) (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_a 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 6) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))))), 29058#(and (or (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) 6) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2))) (not (< 2 multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z 6 (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_a 4) (* multThread1of1ForFork0_b 3))) (not (< 2 multThread1of1ForFork0_a)))), 29025#(and (or (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3)) ULTIMATE.start_z1) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a))) (or (<= (+ (* multThread1of1ForFork1_i 3) 9 ULTIMATE.start_z1) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))) (not (< (+ multThread1of1ForFork1_i 2) multThread1of1ForFork1_a)))), 29028#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 3) multThread1of1ForFork0_a) (<= (+ (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) multThread1of1ForFork1_z))), 29053#(and (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 12) (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z (* multThread1of1ForFork0_i 4)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_a 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)))), 29022#(and (or (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z multThread1of1ForFork0_b)) (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z multThread1of1ForFork0_b) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a))), 29048#(and (<= (+ multThread1of1ForFork0_z 12) (+ (* 3 ULTIMATE.start_y) (* ULTIMATE.start_x 4))) (<= (+ (* 3 ULTIMATE.start_y) (* multThread1of1ForFork0_i 4) (* ULTIMATE.start_x 4)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z 12))), 29036#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 6 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z 2 (* multThread1of1ForFork0_i 4) (* multThread1of1ForFork1_b 2)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))))), 29057#(and (or (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) 3) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< 2 multThread1of1ForFork0_a))) (or (not (< 2 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b 9) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_a 4) (* multThread1of1ForFork0_b 3))))), 29026#(and (or (not (< (+ multThread1of1ForFork1_i 3) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 3) ULTIMATE.start_z1 12) (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z))) (or (not (< (+ multThread1of1ForFork1_i 3) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) ULTIMATE.start_z1))), 29034#(and (or (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b 9 (* multThread1of1ForFork0_i 4)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_a 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 3) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 29045#(and (or (<= (* multThread1of1ForFork1_b 4) ULTIMATE.start_z1) (not (< 3 multThread1of1ForFork1_a))) (or (not (< 3 multThread1of1ForFork1_a)) (<= (+ ULTIMATE.start_z1 12) (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork1_b 4))))), 29021#(and (or (< multThread1of1ForFork0_i multThread1of1ForFork0_a) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)) (or (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (< multThread1of1ForFork0_i multThread1of1ForFork0_a))), 29054#(and (<= (+ (* 3 ULTIMATE.start_y) (* multThread1of1ForFork0_i 4) (* ULTIMATE.start_x 4)) (+ (* multThread1of1ForFork0_a 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)) (<= (+ (* multThread1of1ForFork0_a 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z) (+ (* 3 ULTIMATE.start_y) (* multThread1of1ForFork0_i 4) (* ULTIMATE.start_x 4)))), 29051#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z (* multThread1of1ForFork0_i 4)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z 4 (* multThread1of1ForFork0_b 2)))) (or (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 12 (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z)) (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)))), 29059#(and (or (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z 3 (* multThread1of1ForFork1_b 3)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_a 4) (* multThread1of1ForFork0_b 3))) (not (< 2 multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) 9) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))) (not (< 2 multThread1of1ForFork0_a)))), 29027#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= multThread1of1ForFork1_z (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2))) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) multThread1of1ForFork1_z) (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a))), 29041#(and (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) multThread1of1ForFork0_z)) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z 3) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)))), 29023#(and (or (<= (+ (* multThread1of1ForFork1_i 3) 3 ULTIMATE.start_z1) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z multThread1of1ForFork1_b)) (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a))) (or (not (< multThread1of1ForFork1_i multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z multThread1of1ForFork1_b) ULTIMATE.start_z1))), 29060#(and (or (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) 12) (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z)) (not (< 2 multThread1of1ForFork0_a))) (or (<= (+ (* multThread1of1ForFork1_a 3) (* multThread1of1ForFork1_b 4) multThread1of1ForFork1_z) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_a 4) (* multThread1of1ForFork0_b 3))) (not (< 2 multThread1of1ForFork0_a)))), 29049#(and (<= (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z multThread1of1ForFork0_b 8) (+ (* 3 ULTIMATE.start_y) (* multThread1of1ForFork0_i 4) (* ULTIMATE.start_x 4))) (<= (+ (* 3 ULTIMATE.start_y) (* multThread1of1ForFork0_i 4) (* ULTIMATE.start_x 4)) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z multThread1of1ForFork0_b 8))), 29056#(and (or (not (< 2 multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z 12) (+ (* multThread1of1ForFork0_a 4) (* multThread1of1ForFork0_b 3)))) (or (not (< 2 multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z)))), 29030#(and (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork0_i 4) 8) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)))) (or (not (< (+ multThread1of1ForFork0_i 1) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z (* multThread1of1ForFork0_b 2)) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z)))), 29040#(and (or (<= (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z 9) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 3))) (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a))) (or (not (< (+ multThread1of1ForFork0_i 2) multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z 3 (* multThread1of1ForFork1_b 3) (* multThread1of1ForFork0_i 4)) (+ (* multThread1of1ForFork1_i 3) (* multThread1of1ForFork0_a 4) (* multThread1of1ForFork0_b 3) multThread1of1ForFork0_z)))), 29029#(and (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork0_i 4) 4) (+ (* multThread1of1ForFork0_a 4) multThread1of1ForFork0_z multThread1of1ForFork0_b))) (or (not (< multThread1of1ForFork0_i multThread1of1ForFork0_a)) (<= (+ (* multThread1of1ForFork1_i 3) multThread1of1ForFork0_z multThread1of1ForFork0_b) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z)))), 29020#(and (<= multThread1of1ForFork1_z multThread1of1ForFork0_z) (<= multThread1of1ForFork0_z multThread1of1ForFork1_z)), 29024#(and (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ (* multThread1of1ForFork1_i 3) ULTIMATE.start_z1 6) (+ (* multThread1of1ForFork1_a 3) multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)))) (or (not (< (+ multThread1of1ForFork1_i 1) multThread1of1ForFork1_a)) (<= (+ multThread1of1ForFork1_z (* multThread1of1ForFork1_b 2)) ULTIMATE.start_z1)))] [2022-03-15 20:46:12,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 20:46:12,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:46:12,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 20:46:12,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=7041, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 20:46:12,987 INFO L87 Difference]: Start difference. First operand 122 states and 278 transitions. Second operand has 58 states, 57 states have (on average 1.736842105263158) internal successors, (99), 58 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 20:46:51,042 WARN L244 SmtUtils]: Removed 13 from assertion stack [2022-03-15 20:46:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2022-03-15 20:46:51,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13095 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=3737, Invalid=45325, Unknown=0, NotChecked=0, Total=49062 [2022-03-15 20:46:51,044 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 510 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 7526 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 7526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:46:51,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [510 Valid, 0 Invalid, 7910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 7526 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-03-15 20:46:51,045 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2022-03-15 20:46:51,059 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 20:46:51,059 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 20:46:51,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-03-15 20:46:51,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:51,255 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (122states) and FLOYD_HOARE automaton (currently 139 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 120 for 83ms.. [2022-03-15 20:46:51,257 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 20:46:51,257 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 20:46:51,258 INFO L732 BasicCegarLoop]: Path program histogram: [19, 7, 6, 1] [2022-03-15 20:46:51,260 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:46:51,260 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:46:51,261 INFO L202 PluginConnector]: Adding new model concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:46:51 BasicIcfg [2022-03-15 20:46:51,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:46:51,261 INFO L158 Benchmark]: Toolchain (without parser) took 870787.70ms. Allocated memory was 202.4MB in the beginning and 585.1MB in the end (delta: 382.7MB). Free memory was 161.1MB in the beginning and 334.5MB in the end (delta: -173.4MB). Peak memory consumption was 211.2MB. Max. memory is 8.0GB. [2022-03-15 20:46:51,262 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 202.4MB. Free memory is still 162.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:46:51,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.11ms. Allocated memory is still 202.4MB. Free memory was 161.0MB in the beginning and 159.5MB in the end (delta: 1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 20:46:51,262 INFO L158 Benchmark]: Boogie Preprocessor took 13.57ms. Allocated memory is still 202.4MB. Free memory was 159.5MB in the beginning and 158.6MB in the end (delta: 900.0kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:46:51,262 INFO L158 Benchmark]: RCFGBuilder took 167.79ms. Allocated memory is still 202.4MB. Free memory was 158.5MB in the beginning and 150.5MB in the end (delta: 8.0MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-03-15 20:46:51,262 INFO L158 Benchmark]: TraceAbstraction took 870582.08ms. Allocated memory was 202.4MB in the beginning and 585.1MB in the end (delta: 382.7MB). Free memory was 149.9MB in the beginning and 334.5MB in the end (delta: -184.6MB). Peak memory consumption was 198.6MB. Max. memory is 8.0GB. [2022-03-15 20:46:51,263 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.09ms. Allocated memory is still 202.4MB. Free memory is still 162.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.11ms. Allocated memory is still 202.4MB. Free memory was 161.0MB in the beginning and 159.5MB in the end (delta: 1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.57ms. Allocated memory is still 202.4MB. Free memory was 159.5MB in the beginning and 158.6MB in the end (delta: 900.0kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 167.79ms. Allocated memory is still 202.4MB. Free memory was 158.5MB in the beginning and 150.5MB in the end (delta: 8.0MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * TraceAbstraction took 870582.08ms. Allocated memory was 202.4MB in the beginning and 585.1MB in the end (delta: 382.7MB). Free memory was 149.9MB in the beginning and 334.5MB in the end (delta: -184.6MB). Peak memory consumption was 198.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 30 PlacesBefore, 20 PlacesAfterwards, 25 TransitionsBefore, 15 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 92 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 92, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 61, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 92, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 61, unknown conditional: 0, unknown unconditional: 61] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 24]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and FLOYD_HOARE automaton (currently 139 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 120 for 83ms.. - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and FLOYD_HOARE automaton (currently 139 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 120 for 83ms.. - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (122states) and FLOYD_HOARE automaton (currently 139 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 120 for 83ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 33 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 870.5s, OverallIterations: 33, TraceHistogramMax: 7, PathProgramHistogramMax: 19, EmptinessCheckTime: 0.0s, AutomataDifference: 798.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43132 SdHoareTripleChecker+Valid, 61.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43132 mSDsluCounter, 473 SdHoareTripleChecker+Invalid, 52.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7270 mSDsCounter, 9911 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133198 IncrementalHoareTripleChecker+Invalid, 143109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9911 mSolverCounterUnsat, 14 mSDtfsCounter, 133198 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6138 GetRequests, 158 SyntacticMatches, 81 SemanticMatches, 5898 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431384 ImplicationChecksByTransitivity, 776.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=32, InterpolantAutomatonStates: 3999, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 8399 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 25.5s InterpolantComputationTime, 944 NumberOfCodeBlocks, 944 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 1314 ConstructedInterpolants, 0 QuantifiedInterpolants, 23019 SizeOfPredicates, 306 NumberOfNonLiveVariables, 1983 ConjunctsInSsa, 1122 ConjunctsInUnsatCore, 97 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1056 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown