/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/weaver-benchmarks/generated/test/easy11.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:25:36,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:25:36,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:25:36,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:25:36,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:25:36,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:25:36,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:25:36,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:25:36,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:25:36,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:25:36,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:25:36,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:25:36,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:25:36,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:25:36,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:25:36,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:25:36,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:25:36,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:25:36,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:25:36,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:25:36,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:25:36,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:25:36,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:25:36,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:25:36,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:25:36,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:25:36,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:25:36,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:25:36,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:25:36,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:25:36,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:25:36,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:25:36,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:25:36,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:25:36,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:25:36,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:25:36,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:25:36,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:25:36,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:25:36,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:25:36,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:25:36,784 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 22:25:36,806 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:25:36,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:25:36,807 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:25:36,807 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:25:36,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:25:36,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:25:36,807 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:25:36,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:25:36,808 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:25:36,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:25:36,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:25:36,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:25:36,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:25:36,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:25:36,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:25:36,809 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:25:36,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:25:36,809 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:25:36,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:25:36,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:25:36,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:25:36,809 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:25:36,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:25:36,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:25:36,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:25:36,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 22:25:36,810 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:25:36,811 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:25:36,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:25:36,811 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 22:25:36,811 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 22:25:36,811 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:25:36,811 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 22:25:36,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:25:37,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:25:37,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:25:37,028 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 22:25:37,030 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 22:25:37,031 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy11.wvr.bpl [2022-03-15 22:25:37,031 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy11.wvr.bpl' [2022-03-15 22:25:37,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:25:37,051 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 22:25:37,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:25:37,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:25:37,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:25:37,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:25:37" (1/1) ... [2022-03-15 22:25:37,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:25:37" (1/1) ... [2022-03-15 22:25:37,069 INFO L137 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 22:25:37,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:25:37,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:25:37,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:25:37,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:25:37,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:25:37" (1/1) ... [2022-03-15 22:25:37,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:25:37" (1/1) ... [2022-03-15 22:25:37,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:25:37" (1/1) ... [2022-03-15 22:25:37,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:25:37" (1/1) ... [2022-03-15 22:25:37,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:25:37" (1/1) ... [2022-03-15 22:25:37,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:25:37" (1/1) ... [2022-03-15 22:25:37,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:25:37" (1/1) ... [2022-03-15 22:25:37,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:25:37,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:25:37,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:25:37,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:25:37,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:25:37" (1/1) ... [2022-03-15 22:25:37,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:25:37,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:37,111 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 22:25:37,126 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 22:25:37,150 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 22:25:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 22:25:37,150 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 22:25:37,150 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 22:25:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 22:25:37,150 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 22:25:37,150 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 22:25:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:25:37,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:25:37,151 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 22:25:37,184 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:25:37,186 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:25:37,246 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:25:37,250 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:25:37,250 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 22:25:37,252 INFO L202 PluginConnector]: Adding new model easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:25:37 BoogieIcfgContainer [2022-03-15 22:25:37,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:25:37,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:25:37,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:25:37,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:25:37,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:25:37" (1/2) ... [2022-03-15 22:25:37,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2debb2f3 and model type easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:25:37, skipping insertion in model container [2022-03-15 22:25:37,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:25:37" (2/2) ... [2022-03-15 22:25:37,270 INFO L111 eAbstractionObserver]: Analyzing ICFG easy11.wvr.bpl [2022-03-15 22:25:37,273 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:25:37,273 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:25:37,273 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 22:25:37,273 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:25:37,298 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,298 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,298 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,299 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,299 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,299 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,299 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,300 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,300 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,300 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,300 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,300 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,301 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,301 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,301 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,301 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,302 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,302 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,302 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,302 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,303 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,303 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,303 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,303 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,305 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,307 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_x not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:25:37,308 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 22:25:37,333 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:25:37,338 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 22:25:37,338 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 22:25:37,344 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 22:25:37,350 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 23 transitions, 62 flow [2022-03-15 22:25:37,352 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 23 transitions, 62 flow [2022-03-15 22:25:37,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 28 places, 23 transitions, 62 flow [2022-03-15 22:25:37,366 INFO L129 PetriNetUnfolder]: 2/21 cut-off events. [2022-03-15 22:25:37,366 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 22:25:37,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 2/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 19 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2022-03-15 22:25:37,369 INFO L116 LiptonReduction]: Number of co-enabled transitions 96 [2022-03-15 22:25:37,499 INFO L131 LiptonReduction]: Checked pairs total: 89 [2022-03-15 22:25:37,499 INFO L133 LiptonReduction]: Total number of compositions: 9 [2022-03-15 22:25:37,504 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 15 transitions, 46 flow [2022-03-15 22:25:37,512 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 22:25:37,513 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 22:25:37,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 22:25:37,516 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:37,516 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:37,517 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:25:37,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:37,520 INFO L85 PathProgramCache]: Analyzing trace with hash -688421314, now seen corresponding path program 1 times [2022-03-15 22:25:37,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:37,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449491646] [2022-03-15 22:25:37,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:37,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:37,675 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 22:25:37,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:37,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449491646] [2022-03-15 22:25:37,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449491646] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:25:37,676 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:25:37,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 22:25:37,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [86084394] [2022-03-15 22:25:37,678 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:37,680 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:37,713 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2022-03-15 22:25:37,713 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:37,822 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [77#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 20000) (not (= X thread1Thread1of1ForFork0_x)))), 76#(and (or (<= (+ Y thread1Thread1of1ForFork0_x) 20000) (not (= X thread1Thread1of1ForFork0_x))) (or (<= 10000 Y) (not (= X thread1Thread1of1ForFork0_x))))] [2022-03-15 22:25:37,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 22:25:37,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:37,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 22:25:37,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-15 22:25:37,838 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 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 22:25:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:37,999 INFO L93 Difference]: Finished difference Result 31 states and 62 transitions. [2022-03-15 22:25:38,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:25:38,001 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 22:25:38,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:38,008 INFO L225 Difference]: With dead ends: 31 [2022-03-15 22:25:38,008 INFO L226 Difference]: Without dead ends: 28 [2022-03-15 22:25:38,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-03-15 22:25:38,028 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 12 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:38,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:25:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-03-15 22:25:38,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-03-15 22:25:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 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 22:25:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 49 transitions. [2022-03-15 22:25:38,057 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 49 transitions. Word has length 10 [2022-03-15 22:25:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:38,057 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 49 transitions. [2022-03-15 22:25:38,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 22:25:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 49 transitions. [2022-03-15 22:25:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 22:25:38,058 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:38,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:38,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:25:38,059 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:25:38,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash -686864494, now seen corresponding path program 2 times [2022-03-15 22:25:38,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:38,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981015886] [2022-03-15 22:25:38,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:38,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:38,125 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 22:25:38,126 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:38,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981015886] [2022-03-15 22:25:38,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981015886] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:25:38,131 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:25:38,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 22:25:38,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1606043474] [2022-03-15 22:25:38,131 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:38,132 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:38,133 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2022-03-15 22:25:38,133 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:38,247 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [172#(and (or (<= 10000 Y) (not (= X thread2Thread1of1ForFork1_x))) (or (<= (+ Y thread2Thread1of1ForFork1_x) 20000) (not (= X thread2Thread1of1ForFork1_x)))), 173#(and (<= (+ Y X) 20000) (<= 10000 Y)), 174#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 20000) (not (= X thread1Thread1of1ForFork0_x))))] [2022-03-15 22:25:38,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:25:38,248 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:38,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:25:38,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-03-15 22:25:38,249 INFO L87 Difference]: Start difference. First operand 25 states and 49 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 22:25:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:38,396 INFO L93 Difference]: Finished difference Result 37 states and 73 transitions. [2022-03-15 22:25:38,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:25:38,397 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 22:25:38,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:38,398 INFO L225 Difference]: With dead ends: 37 [2022-03-15 22:25:38,398 INFO L226 Difference]: Without dead ends: 34 [2022-03-15 22:25:38,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-03-15 22:25:38,403 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 15 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:38,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 1 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:25:38,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-03-15 22:25:38,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-03-15 22:25:38,409 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 22:25:38,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2022-03-15 22:25:38,410 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 56 transitions. Word has length 10 [2022-03-15 22:25:38,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:38,410 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 56 transitions. [2022-03-15 22:25:38,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 22:25:38,410 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 56 transitions. [2022-03-15 22:25:38,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 22:25:38,410 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:38,410 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:38,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:25:38,411 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:25:38,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:38,411 INFO L85 PathProgramCache]: Analyzing trace with hash 44554269, now seen corresponding path program 1 times [2022-03-15 22:25:38,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:38,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937356508] [2022-03-15 22:25:38,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:38,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:38,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:38,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:38,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937356508] [2022-03-15 22:25:38,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937356508] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:25:38,435 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:25:38,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 22:25:38,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1336877369] [2022-03-15 22:25:38,435 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:38,436 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:38,437 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 23 transitions. [2022-03-15 22:25:38,437 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:38,501 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [288#(or (<= 10000 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (<= thread2Thread1of1ForFork1_x 9999)), 286#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9999)), 285#(<= 10000 thread1Thread1of1ForFork0_x), 287#(or (<= 10000 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)))] [2022-03-15 22:25:38,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 22:25:38,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:38,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 22:25:38,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 22:25:38,502 INFO L87 Difference]: Start difference. First operand 30 states and 56 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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 22:25:38,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:38,610 INFO L93 Difference]: Finished difference Result 41 states and 75 transitions. [2022-03-15 22:25:38,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 22:25:38,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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 22:25:38,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:38,611 INFO L225 Difference]: With dead ends: 41 [2022-03-15 22:25:38,611 INFO L226 Difference]: Without dead ends: 39 [2022-03-15 22:25:38,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2022-03-15 22:25:38,612 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 42 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:38,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 3 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:25:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-03-15 22:25:38,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 23. [2022-03-15 22:25:38,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 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 22:25:38,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 42 transitions. [2022-03-15 22:25:38,615 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 42 transitions. Word has length 11 [2022-03-15 22:25:38,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:38,615 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 42 transitions. [2022-03-15 22:25:38,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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 22:25:38,616 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 42 transitions. [2022-03-15 22:25:38,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 22:25:38,616 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:38,616 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:38,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 22:25:38,616 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:25:38,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:38,617 INFO L85 PathProgramCache]: Analyzing trace with hash 103596509, now seen corresponding path program 1 times [2022-03-15 22:25:38,617 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:38,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722434895] [2022-03-15 22:25:38,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:38,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:38,638 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 22:25:38,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:38,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722434895] [2022-03-15 22:25:38,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722434895] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:38,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084589019] [2022-03-15 22:25:38,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:38,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:38,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:38,640 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 22:25:38,658 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 22:25:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:38,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 22:25:38,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:38,703 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 22:25:38,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:38,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084589019] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:38,736 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 22:25:38,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2022-03-15 22:25:38,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [989614556] [2022-03-15 22:25:38,736 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:38,737 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:38,737 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 19 transitions. [2022-03-15 22:25:38,738 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:38,784 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [458#(or (<= thread1Thread1of1ForFork0_x 9999) (not (= X thread1Thread1of1ForFork0_x))), 459#(or (<= thread1Thread1of1ForFork0_x 9999) (not (= X thread1Thread1of1ForFork0_x)) (<= 10000 thread2Thread1of1ForFork1_x))] [2022-03-15 22:25:38,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 22:25:38,784 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:38,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 22:25:38,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-03-15 22:25:38,785 INFO L87 Difference]: Start difference. First operand 23 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 22:25:38,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:38,859 INFO L93 Difference]: Finished difference Result 55 states and 95 transitions. [2022-03-15 22:25:38,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:25:38,859 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 22:25:38,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:38,860 INFO L225 Difference]: With dead ends: 55 [2022-03-15 22:25:38,860 INFO L226 Difference]: Without dead ends: 55 [2022-03-15 22:25:38,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-03-15 22:25:38,861 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:38,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 6 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:25:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-03-15 22:25:38,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2022-03-15 22:25:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 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 22:25:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 55 transitions. [2022-03-15 22:25:38,864 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 55 transitions. Word has length 11 [2022-03-15 22:25:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:38,864 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 55 transitions. [2022-03-15 22:25:38,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 22:25:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 55 transitions. [2022-03-15 22:25:38,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 22:25:38,865 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:38,865 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:38,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 22:25:39,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:39,081 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:25:39,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:39,081 INFO L85 PathProgramCache]: Analyzing trace with hash 182014109, now seen corresponding path program 2 times [2022-03-15 22:25:39,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:39,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272293833] [2022-03-15 22:25:39,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:39,107 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:39,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272293833] [2022-03-15 22:25:39,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272293833] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:25:39,107 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:25:39,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 22:25:39,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1217353129] [2022-03-15 22:25:39,107 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:39,108 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:39,109 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 29 transitions. [2022-03-15 22:25:39,109 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:39,183 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [582#(or (< thread1Thread1of1ForFork0_x 10000) (not (= X thread1Thread1of1ForFork0_x))), 583#(<= 10000 X), 581#(< thread1Thread1of1ForFork0_x 10000), 584#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 580#(or (not (= X thread2Thread1of1ForFork1_x)) (<= 10000 thread2Thread1of1ForFork1_x))] [2022-03-15 22:25:39,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:25:39,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:39,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:25:39,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-03-15 22:25:39,185 INFO L87 Difference]: Start difference. First operand 28 states and 55 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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 22:25:39,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:39,321 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2022-03-15 22:25:39,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 22:25:39,322 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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 22:25:39,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:39,323 INFO L225 Difference]: With dead ends: 49 [2022-03-15 22:25:39,323 INFO L226 Difference]: Without dead ends: 44 [2022-03-15 22:25:39,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-03-15 22:25:39,324 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 39 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:39,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 5 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:25:39,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-15 22:25:39,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2022-03-15 22:25:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 states have internal predecessors, (52), 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 22:25:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 52 transitions. [2022-03-15 22:25:39,327 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 52 transitions. Word has length 11 [2022-03-15 22:25:39,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:39,327 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 52 transitions. [2022-03-15 22:25:39,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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 22:25:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 52 transitions. [2022-03-15 22:25:39,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:25:39,328 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:39,328 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:39,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 22:25:39,328 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:25:39,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:39,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1351003102, now seen corresponding path program 1 times [2022-03-15 22:25:39,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:39,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667541740] [2022-03-15 22:25:39,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:39,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:39,426 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 22:25:39,427 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:39,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667541740] [2022-03-15 22:25:39,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667541740] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:39,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875192591] [2022-03-15 22:25:39,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:39,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:39,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:39,429 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 22:25:39,430 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 22:25:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:39,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 22:25:39,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:39,597 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 22:25:39,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:39,824 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 22:25:39,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875192591] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:39,825 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:39,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:25:39,825 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1168865484] [2022-03-15 22:25:39,825 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:39,826 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:39,827 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 28 transitions. [2022-03-15 22:25:39,827 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:40,042 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [795#(and (or (<= 10000 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= (+ Y thread1Thread1of1ForFork0_x) 19999) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 10000)))), 793#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 792#(and (or (<= (+ Y thread1Thread1of1ForFork0_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 794#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 796#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 10000))) (or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000)))), 797#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 10000))))] [2022-03-15 22:25:40,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:25:40,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:40,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:25:40,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:25:40,043 INFO L87 Difference]: Start difference. First operand 28 states and 52 transitions. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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 22:25:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:40,666 INFO L93 Difference]: Finished difference Result 58 states and 107 transitions. [2022-03-15 22:25:40,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 22:25:40,667 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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 22:25:40,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:40,667 INFO L225 Difference]: With dead ends: 58 [2022-03-15 22:25:40,668 INFO L226 Difference]: Without dead ends: 55 [2022-03-15 22:25:40,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=304, Invalid=1418, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:25:40,669 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 45 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:40,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 6 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:25:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-03-15 22:25:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2022-03-15 22:25:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 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 22:25:40,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 73 transitions. [2022-03-15 22:25:40,672 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 73 transitions. Word has length 12 [2022-03-15 22:25:40,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:40,672 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 73 transitions. [2022-03-15 22:25:40,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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 22:25:40,672 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 73 transitions. [2022-03-15 22:25:40,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:25:40,673 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:40,673 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:40,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 22:25:40,903 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,SelfDestructingSolverStorable5 [2022-03-15 22:25:40,904 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:25:40,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:40,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1352559922, now seen corresponding path program 2 times [2022-03-15 22:25:40,906 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:40,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500593736] [2022-03-15 22:25:40,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:40,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:40,984 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 22:25:40,984 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:40,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500593736] [2022-03-15 22:25:40,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500593736] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:40,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9370858] [2022-03-15 22:25:40,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:25:40,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:40,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:41,004 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 22:25:41,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:25:41,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:25:41,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 22:25:41,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:41,047 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 22:25:41,154 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 22:25:41,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:41,353 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 22:25:41,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9370858] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:41,353 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:41,354 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:25:41,354 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [565379926] [2022-03-15 22:25:41,354 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:41,354 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:41,355 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 36 transitions. [2022-03-15 22:25:41,355 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:41,610 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [1048#(and (or (<= (+ Y X) 19999) (not (< X 10000))) (or (<= 10000 Y) (not (< X 10000)))), 1050#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 1049#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 1051#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 10000))) (or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000)))), 1047#(and (or (<= 10000 Y) (not (= X thread2Thread1of1ForFork1_x)) (not (< thread2Thread1of1ForFork1_x 10000))) (or (<= (+ Y thread2Thread1of1ForFork1_x) 19999) (not (= X thread2Thread1of1ForFork1_x)) (not (< thread2Thread1of1ForFork1_x 10000)))), 1052#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 10000)))), 1046#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 10000))) (or (<= (+ Y thread2Thread1of1ForFork1_x) 19999) (not (< thread2Thread1of1ForFork1_x 10000))))] [2022-03-15 22:25:41,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:25:41,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:41,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:25:41,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2022-03-15 22:25:41,611 INFO L87 Difference]: Start difference. First operand 35 states and 73 transitions. Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 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 22:25:42,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:42,080 INFO L93 Difference]: Finished difference Result 67 states and 128 transitions. [2022-03-15 22:25:42,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 22:25:42,081 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 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 22:25:42,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:42,081 INFO L225 Difference]: With dead ends: 67 [2022-03-15 22:25:42,081 INFO L226 Difference]: Without dead ends: 64 [2022-03-15 22:25:42,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=329, Invalid=1741, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:25:42,082 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:42,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 10 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:25:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-03-15 22:25:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 37. [2022-03-15 22:25:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 2.111111111111111) internal successors, (76), 36 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 22:25:42,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 76 transitions. [2022-03-15 22:25:42,086 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 76 transitions. Word has length 12 [2022-03-15 22:25:42,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:42,086 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 76 transitions. [2022-03-15 22:25:42,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 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 22:25:42,086 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 76 transitions. [2022-03-15 22:25:42,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:25:42,086 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:42,086 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:42,102 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 22:25:42,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:42,287 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:25:42,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1098756035, now seen corresponding path program 3 times [2022-03-15 22:25:42,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:42,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130270861] [2022-03-15 22:25:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:42,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:42,326 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:42,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130270861] [2022-03-15 22:25:42,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130270861] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:42,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065583528] [2022-03-15 22:25:42,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:25:42,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:42,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:42,328 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 22:25:42,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:25:42,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:25:42,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 22:25:42,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:42,348 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 22:25:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:42,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:42,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065583528] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:42,417 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:42,417 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 22:25:42,417 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2007843461] [2022-03-15 22:25:42,417 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:42,418 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:42,419 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 33 transitions. [2022-03-15 22:25:42,419 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:42,549 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1323#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 1322#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 1320#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 1318#(or (<= thread1Thread1of1ForFork0_x 9998) (not (< thread1Thread1of1ForFork0_x 10000))), 1319#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 1321#(or (<= thread1Thread1of1ForFork0_x 9998) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 10000)))] [2022-03-15 22:25:42,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 22:25:42,549 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:42,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 22:25:42,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:25:42,550 INFO L87 Difference]: Start difference. First operand 37 states and 76 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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 22:25:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:43,086 INFO L93 Difference]: Finished difference Result 137 states and 262 transitions. [2022-03-15 22:25:43,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 22:25:43,087 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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 22:25:43,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:43,088 INFO L225 Difference]: With dead ends: 137 [2022-03-15 22:25:43,088 INFO L226 Difference]: Without dead ends: 137 [2022-03-15 22:25:43,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=615, Invalid=1835, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 22:25:43,089 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 96 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:43,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 9 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:25:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-03-15 22:25:43,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 49. [2022-03-15 22:25:43,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 2.4375) internal successors, (117), 48 states have internal predecessors, (117), 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 22:25:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 117 transitions. [2022-03-15 22:25:43,094 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 117 transitions. Word has length 13 [2022-03-15 22:25:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:43,094 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 117 transitions. [2022-03-15 22:25:43,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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 22:25:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 117 transitions. [2022-03-15 22:25:43,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:25:43,094 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:43,095 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:43,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 22:25:43,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:43,306 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:25:43,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:43,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1020338435, now seen corresponding path program 4 times [2022-03-15 22:25:43,307 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:43,307 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186484275] [2022-03-15 22:25:43,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:43,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:43,347 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:43,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186484275] [2022-03-15 22:25:43,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186484275] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:43,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780962858] [2022-03-15 22:25:43,348 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:25:43,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:43,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:43,364 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 22:25:43,368 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 22:25:43,384 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:25:43,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:25:43,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 22:25:43,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:43,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:43,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:43,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780962858] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:43,435 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:43,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 22:25:43,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1283419648] [2022-03-15 22:25:43,435 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:43,435 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:43,437 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 45 transitions. [2022-03-15 22:25:43,437 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:43,601 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [1712#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 1713#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 1715#(<= 9999 X), 1716#(or (not (= X thread1Thread1of1ForFork0_x)) (< thread1Thread1of1ForFork0_x 9999) (not (< thread1Thread1of1ForFork0_x 10000))), 1709#(<= 9999 thread2Thread1of1ForFork1_x), 1718#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 1714#(or (not (= X thread2Thread1of1ForFork1_x)) (<= 9999 thread2Thread1of1ForFork1_x)), 1710#(< thread1Thread1of1ForFork0_x 10000), 1711#(or (< thread1Thread1of1ForFork0_x 9999) (not (< thread1Thread1of1ForFork0_x 10000))), 1717#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000)))] [2022-03-15 22:25:43,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 22:25:43,602 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:43,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 22:25:43,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:25:43,602 INFO L87 Difference]: Start difference. First operand 49 states and 117 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 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 22:25:44,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:44,394 INFO L93 Difference]: Finished difference Result 123 states and 252 transitions. [2022-03-15 22:25:44,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 22:25:44,394 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 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 22:25:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:44,395 INFO L225 Difference]: With dead ends: 123 [2022-03-15 22:25:44,395 INFO L226 Difference]: Without dead ends: 112 [2022-03-15 22:25:44,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1055, Invalid=3637, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 22:25:44,397 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 93 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:44,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 9 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:25:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-03-15 22:25:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 52. [2022-03-15 22:25:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.215686274509804) internal successors, (113), 51 states have internal predecessors, (113), 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 22:25:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 113 transitions. [2022-03-15 22:25:44,401 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 113 transitions. Word has length 13 [2022-03-15 22:25:44,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:44,401 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 113 transitions. [2022-03-15 22:25:44,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 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 22:25:44,401 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 113 transitions. [2022-03-15 22:25:44,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:25:44,402 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:44,402 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:44,436 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 22:25:44,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:44,603 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:25:44,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:44,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1159398979, now seen corresponding path program 5 times [2022-03-15 22:25:44,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:44,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568391679] [2022-03-15 22:25:44,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:44,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:44,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:44,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568391679] [2022-03-15 22:25:44,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568391679] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:44,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575981401] [2022-03-15 22:25:44,652 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:25:44,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:44,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:44,653 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 22:25:44,655 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 22:25:44,671 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:25:44,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:25:44,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 22:25:44,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:44,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:44,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:44,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575981401] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:44,744 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:44,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2022-03-15 22:25:44,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [869680916] [2022-03-15 22:25:44,744 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:44,744 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:44,745 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 37 transitions. [2022-03-15 22:25:44,745 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:44,910 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [2134#(or (not (= X thread1Thread1of1ForFork0_x)) (< thread2Thread1of1ForFork1_x 10000) (<= 9999 thread1Thread1of1ForFork0_x)), 2125#(or (<= thread2Thread1of1ForFork1_x 9998) (not (= X thread2Thread1of1ForFork1_x))), 2128#(<= (+ X 1) thread1Thread1of1ForFork0_x), 2131#(<= 9999 thread1Thread1of1ForFork0_x), 2135#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread2Thread1of1ForFork1_x thread1Thread1of1ForFork0_x)), 2133#(or (not (= X thread1Thread1of1ForFork0_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 2132#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9999 thread1Thread1of1ForFork0_x)), 2130#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9999)), 2129#(<= 10000 thread1Thread1of1ForFork0_x), 2126#(or (<= (+ thread2Thread1of1ForFork1_x 1) thread1Thread1of1ForFork0_x) (not (= X thread2Thread1of1ForFork1_x))), 2127#(<= X 9998)] [2022-03-15 22:25:44,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:25:44,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:44,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:25:44,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:25:44,911 INFO L87 Difference]: Start difference. First operand 52 states and 113 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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 22:25:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:45,208 INFO L93 Difference]: Finished difference Result 103 states and 212 transitions. [2022-03-15 22:25:45,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 22:25:45,208 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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 22:25:45,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:45,208 INFO L225 Difference]: With dead ends: 103 [2022-03-15 22:25:45,209 INFO L226 Difference]: Without dead ends: 96 [2022-03-15 22:25:45,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=606, Invalid=1374, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:25:45,209 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 77 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:45,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 4 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:25:45,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-03-15 22:25:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 60. [2022-03-15 22:25:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.2711864406779663) internal successors, (134), 59 states have internal predecessors, (134), 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 22:25:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 134 transitions. [2022-03-15 22:25:45,213 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 134 transitions. Word has length 13 [2022-03-15 22:25:45,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:45,213 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 134 transitions. [2022-03-15 22:25:45,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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 22:25:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 134 transitions. [2022-03-15 22:25:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:25:45,214 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:45,214 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:45,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 22:25:45,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:45,423 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:25:45,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:45,424 INFO L85 PathProgramCache]: Analyzing trace with hash -636895746, now seen corresponding path program 6 times [2022-03-15 22:25:45,425 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:45,425 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410306979] [2022-03-15 22:25:45,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:45,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:45,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:45,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:45,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410306979] [2022-03-15 22:25:45,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410306979] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:45,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975322335] [2022-03-15 22:25:45,509 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:25:45,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:45,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:45,510 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 22:25:45,511 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 22:25:45,528 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:25:45,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:25:45,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 22:25:45,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:25:45,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:25:45,721 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975322335] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:45,721 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:45,721 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2022-03-15 22:25:45,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1619802452] [2022-03-15 22:25:45,722 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:45,722 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:45,725 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 44 transitions. [2022-03-15 22:25:45,725 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:46,153 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [2512#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9999)) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 2514#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996))), 2505#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 2506#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 2513#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 2509#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9999)))), 2510#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x) 19998) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 10000 Y) (not (= X thread1Thread1of1ForFork0_x)))), 2504#(and (or (<= (+ Y thread1Thread1of1ForFork0_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 2507#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x) 19998)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 10000 Y))), 2508#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 2511#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 9999)) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 2515#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))))] [2022-03-15 22:25:46,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:25:46,154 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:46,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:25:46,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2022-03-15 22:25:46,154 INFO L87 Difference]: Start difference. First operand 60 states and 134 transitions. Second operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 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 22:25:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:47,305 INFO L93 Difference]: Finished difference Result 126 states and 276 transitions. [2022-03-15 22:25:47,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 22:25:47,306 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 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 22:25:47,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:47,306 INFO L225 Difference]: With dead ends: 126 [2022-03-15 22:25:47,306 INFO L226 Difference]: Without dead ends: 122 [2022-03-15 22:25:47,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=865, Invalid=3827, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 22:25:47,308 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 76 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:47,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 7 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:25:47,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-03-15 22:25:47,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2022-03-15 22:25:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 2.3947368421052633) internal successors, (182), 76 states have internal predecessors, (182), 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 22:25:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 182 transitions. [2022-03-15 22:25:47,315 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 182 transitions. Word has length 14 [2022-03-15 22:25:47,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:47,315 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 182 transitions. [2022-03-15 22:25:47,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 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 22:25:47,315 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 182 transitions. [2022-03-15 22:25:47,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:25:47,316 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:47,316 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:47,332 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 22:25:47,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:47,532 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:25:47,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:47,532 INFO L85 PathProgramCache]: Analyzing trace with hash -635338926, now seen corresponding path program 7 times [2022-03-15 22:25:47,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:47,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599463436] [2022-03-15 22:25:47,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:47,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:47,620 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:47,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599463436] [2022-03-15 22:25:47,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599463436] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:47,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328393710] [2022-03-15 22:25:47,621 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:25:47,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:47,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:47,622 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 22:25:47,623 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 22:25:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:47,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:25:47,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:47,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:48,022 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 22:25:48,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328393710] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:48,022 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:48,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 22:25:48,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1736072218] [2022-03-15 22:25:48,023 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:48,023 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:48,024 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2022-03-15 22:25:48,024 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:48,583 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [2991#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 2982#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 2990#(and (or (not (< X 9999)) (<= (+ Y X) 19998)) (or (<= 10000 Y) (not (< X 9999)))), 2980#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19998) (not (< thread2Thread1of1ForFork1_x 9999))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9999)))), 2987#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996))), 2986#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 2984#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 2985#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9999)))), 2989#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9999)) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 2988#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 9999)) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 2981#(and (or (<= 10000 Y) (not (= X thread2Thread1of1ForFork1_x)) (not (< thread2Thread1of1ForFork1_x 9999))) (or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ Y thread2Thread1of1ForFork1_x) 19998) (not (< thread2Thread1of1ForFork1_x 9999)))), 2983#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 2979#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 10000))) (or (<= (+ Y thread2Thread1of1ForFork1_x) 19999) (not (< thread2Thread1of1ForFork1_x 10000))))] [2022-03-15 22:25:48,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:25:48,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:48,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:25:48,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:25:48,585 INFO L87 Difference]: Start difference. First operand 77 states and 182 transitions. Second operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 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 22:25:50,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:50,107 INFO L93 Difference]: Finished difference Result 156 states and 326 transitions. [2022-03-15 22:25:50,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 22:25:50,107 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 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 22:25:50,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:50,108 INFO L225 Difference]: With dead ends: 156 [2022-03-15 22:25:50,108 INFO L226 Difference]: Without dead ends: 147 [2022-03-15 22:25:50,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2073 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1105, Invalid=6035, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 22:25:50,110 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 74 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:50,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 12 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:25:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-03-15 22:25:50,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 74. [2022-03-15 22:25:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 2.287671232876712) internal successors, (167), 73 states have internal predecessors, (167), 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 22:25:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 167 transitions. [2022-03-15 22:25:50,120 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 167 transitions. Word has length 14 [2022-03-15 22:25:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:50,121 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 167 transitions. [2022-03-15 22:25:50,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 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 22:25:50,121 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 167 transitions. [2022-03-15 22:25:50,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:25:50,124 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:50,124 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:50,157 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 22:25:50,340 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,SelfDestructingSolverStorable11 [2022-03-15 22:25:50,340 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:25:50,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:50,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1700889117, now seen corresponding path program 8 times [2022-03-15 22:25:50,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:50,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020489328] [2022-03-15 22:25:50,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:50,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:50,381 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:50,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020489328] [2022-03-15 22:25:50,381 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020489328] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:50,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823641624] [2022-03-15 22:25:50,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:25:50,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:50,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:50,383 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 22:25:50,384 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 22:25:50,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:25:50,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:25:50,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:25:50,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:50,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:50,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823641624] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:50,481 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:50,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-03-15 22:25:50,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1160735585] [2022-03-15 22:25:50,482 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:50,482 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:50,483 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 51 transitions. [2022-03-15 22:25:50,483 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:50,785 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [3493#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 3492#(or (<= thread1Thread1of1ForFork0_x 9997) (<= 9999 thread1Thread1of1ForFork0_x)), 3494#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 3491#(or (<= thread1Thread1of1ForFork0_x 9998) (not (< thread1Thread1of1ForFork0_x 10000))), 3495#(or (<= thread1Thread1of1ForFork0_x 9997) (not (= X thread1Thread1of1ForFork0_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 3496#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 3497#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 3502#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 3501#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 3499#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 3498#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1))), 3500#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x))] [2022-03-15 22:25:50,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:25:50,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:50,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:25:50,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2022-03-15 22:25:50,786 INFO L87 Difference]: Start difference. First operand 74 states and 167 transitions. Second operand has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 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 22:25:52,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:52,368 INFO L93 Difference]: Finished difference Result 308 states and 622 transitions. [2022-03-15 22:25:52,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-15 22:25:52,368 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 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 22:25:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:52,370 INFO L225 Difference]: With dead ends: 308 [2022-03-15 22:25:52,370 INFO L226 Difference]: Without dead ends: 308 [2022-03-15 22:25:52,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3173 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2324, Invalid=8388, Unknown=0, NotChecked=0, Total=10712 [2022-03-15 22:25:52,373 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 121 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:52,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 14 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:25:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-03-15 22:25:52,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 114. [2022-03-15 22:25:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 2.663716814159292) internal successors, (301), 113 states have internal predecessors, (301), 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 22:25:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 301 transitions. [2022-03-15 22:25:52,387 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 301 transitions. Word has length 15 [2022-03-15 22:25:52,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:52,388 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 301 transitions. [2022-03-15 22:25:52,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 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 22:25:52,388 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 301 transitions. [2022-03-15 22:25:52,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:25:52,388 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:52,388 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:52,404 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 22:25:52,593 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,SelfDestructingSolverStorable12 [2022-03-15 22:25:52,593 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:25:52,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:52,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1779306717, now seen corresponding path program 9 times [2022-03-15 22:25:52,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:52,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207899856] [2022-03-15 22:25:52,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:52,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:52,644 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:52,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207899856] [2022-03-15 22:25:52,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207899856] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:52,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198369268] [2022-03-15 22:25:52,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:25:52,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:52,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:52,645 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 22:25:52,646 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 22:25:52,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:25:52,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:25:52,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 22:25:52,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:52,738 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:25:52,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:52,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:25:52,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198369268] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:52,840 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:52,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 16 [2022-03-15 22:25:52,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1441034239] [2022-03-15 22:25:52,840 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:52,841 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:52,843 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 65 transitions. [2022-03-15 22:25:52,844 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:53,227 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [4295#(<= 9999 thread2Thread1of1ForFork1_x), 4297#(or (not (= X thread2Thread1of1ForFork1_x)) (<= 9998 thread2Thread1of1ForFork1_x)), 4301#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 4304#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 4307#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 4298#(<= 9998 X), 4306#(or (< thread1Thread1of1ForFork0_x 9998) (not (= X thread1Thread1of1ForFork0_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 4303#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 4305#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 4310#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 4311#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 4300#(or (< thread1Thread1of1ForFork0_x 9999) (not (< thread1Thread1of1ForFork0_x 10000))), 4309#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1))), 4308#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 4299#(< thread1Thread1of1ForFork0_x 10000), 4296#(<= 9998 thread2Thread1of1ForFork1_x), 4302#(or (< thread1Thread1of1ForFork0_x 9998) (<= 9999 thread1Thread1of1ForFork0_x))] [2022-03-15 22:25:53,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:25:53,227 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:53,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:25:53,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:25:53,228 INFO L87 Difference]: Start difference. First operand 114 states and 301 transitions. Second operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 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 22:25:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:55,292 INFO L93 Difference]: Finished difference Result 278 states and 600 transitions. [2022-03-15 22:25:55,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-03-15 22:25:55,293 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 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) Word has length 15 [2022-03-15 22:25:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:55,294 INFO L225 Difference]: With dead ends: 278 [2022-03-15 22:25:55,294 INFO L226 Difference]: Without dead ends: 259 [2022-03-15 22:25:55,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5214 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2969, Invalid=14061, Unknown=0, NotChecked=0, Total=17030 [2022-03-15 22:25:55,297 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 160 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:55,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 16 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:25:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-03-15 22:25:55,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 103. [2022-03-15 22:25:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 2.411764705882353) internal successors, (246), 102 states have internal predecessors, (246), 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 22:25:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 246 transitions. [2022-03-15 22:25:55,300 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 246 transitions. Word has length 15 [2022-03-15 22:25:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:55,301 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 246 transitions. [2022-03-15 22:25:55,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 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 22:25:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 246 transitions. [2022-03-15 22:25:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:25:55,301 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:55,301 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:55,316 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 22:25:55,515 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,SelfDestructingSolverStorable13 [2022-03-15 22:25:55,515 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:25:55,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:55,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1942278113, now seen corresponding path program 10 times [2022-03-15 22:25:55,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:55,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067084914] [2022-03-15 22:25:55,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:55,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:55,554 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:55,554 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067084914] [2022-03-15 22:25:55,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067084914] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:55,554 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367298671] [2022-03-15 22:25:55,554 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:25:55,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:55,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:55,555 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 22:25:55,556 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 22:25:55,572 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:25:55,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:25:55,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:25:55,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:55,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:55,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:55,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367298671] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:55,659 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:55,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-15 22:25:55,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1781971955] [2022-03-15 22:25:55,659 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:55,660 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:55,661 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 55 transitions. [2022-03-15 22:25:55,661 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:55,968 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [5091#(<= 10000 thread1Thread1of1ForFork0_x), 5103#(<= (+ 2 X) thread1Thread1of1ForFork0_x), 5093#(<= 9999 thread1Thread1of1ForFork0_x), 5097#(or (<= 9998 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x))), 5092#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9999)), 5104#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9999 thread1Thread1of1ForFork0_x)), 5109#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread2Thread1of1ForFork1_x thread1Thread1of1ForFork0_x)), 5098#(or (<= 9998 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (< thread2Thread1of1ForFork1_x 10000)), 5101#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 2 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 5095#(<= 9998 thread1Thread1of1ForFork0_x), 5096#(or (<= 9998 thread1Thread1of1ForFork0_x) (< thread2Thread1of1ForFork1_x 10000)), 5102#(<= X 9997), 5106#(<= (+ X 1) thread1Thread1of1ForFork0_x), 5108#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998) (not (= X thread1Thread1of1ForFork0_x))), 5107#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 5099#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 5105#(or (<= (+ thread2Thread1of1ForFork1_x 1) thread1Thread1of1ForFork0_x) (not (= X thread2Thread1of1ForFork1_x))), 5094#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9999 thread1Thread1of1ForFork0_x)), 5100#(or (<= thread2Thread1of1ForFork1_x 9997) (not (= X thread2Thread1of1ForFork1_x)))] [2022-03-15 22:25:55,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:25:55,968 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:55,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:25:55,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=766, Unknown=0, NotChecked=0, Total=992 [2022-03-15 22:25:55,969 INFO L87 Difference]: Start difference. First operand 103 states and 246 transitions. Second operand has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 28 states have internal predecessors, (54), 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 22:25:56,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:56,734 INFO L93 Difference]: Finished difference Result 245 states and 565 transitions. [2022-03-15 22:25:56,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 22:25:56,734 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 28 states have internal predecessors, (54), 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 22:25:56,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:56,735 INFO L225 Difference]: With dead ends: 245 [2022-03-15 22:25:56,735 INFO L226 Difference]: Without dead ends: 229 [2022-03-15 22:25:56,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1960 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1999, Invalid=4973, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 22:25:56,737 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 82 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:56,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 12 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:25:56,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-03-15 22:25:56,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 101. [2022-03-15 22:25:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.41) internal successors, (241), 100 states have internal predecessors, (241), 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 22:25:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 241 transitions. [2022-03-15 22:25:56,741 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 241 transitions. Word has length 15 [2022-03-15 22:25:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:56,741 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 241 transitions. [2022-03-15 22:25:56,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 28 states have internal predecessors, (54), 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 22:25:56,741 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 241 transitions. [2022-03-15 22:25:56,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:25:56,741 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:56,741 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:56,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-03-15 22:25:56,942 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,SelfDestructingSolverStorable14 [2022-03-15 22:25:56,942 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:25:56,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:56,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1127971938, now seen corresponding path program 11 times [2022-03-15 22:25:56,943 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:56,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600367242] [2022-03-15 22:25:56,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:56,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:57,054 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:57,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600367242] [2022-03-15 22:25:57,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600367242] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:57,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390850707] [2022-03-15 22:25:57,055 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:25:57,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:57,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:57,056 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 22:25:57,056 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 22:25:57,074 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:25:57,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:25:57,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 22:25:57,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 22:25:57,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 22:25:57,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390850707] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:57,301 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:57,303 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 17 [2022-03-15 22:25:57,303 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [313367283] [2022-03-15 22:25:57,303 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:57,304 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:57,305 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 64 transitions. [2022-03-15 22:25:57,305 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:58,095 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [5773#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 5776#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x) 19998)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 10000 Y))), 5782#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9998)))), 5775#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 5780#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x) 19997))), 5785#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9998)))), 5791#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 5784#(and (or (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x) 19997)) (or (<= 10000 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9998)))), 5783#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 9998)))), 5789#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 5788#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 5772#(and (or (<= (+ Y thread1Thread1of1ForFork0_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 5774#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 5790#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 5778#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9999)))), 5779#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996))), 5786#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9998)))), 5781#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9998)))), 5777#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 5787#(and (or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9998))))] [2022-03-15 22:25:58,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:25:58,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:58,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:25:58,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1296, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 22:25:58,096 INFO L87 Difference]: Start difference. First operand 101 states and 241 transitions. Second operand has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 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 22:26:00,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:00,523 INFO L93 Difference]: Finished difference Result 269 states and 645 transitions. [2022-03-15 22:26:00,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-03-15 22:26:00,524 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 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 16 [2022-03-15 22:26:00,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:00,525 INFO L225 Difference]: With dead ends: 269 [2022-03-15 22:26:00,525 INFO L226 Difference]: Without dead ends: 265 [2022-03-15 22:26:00,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4023 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2577, Invalid=10995, Unknown=0, NotChecked=0, Total=13572 [2022-03-15 22:26:00,527 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 110 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:00,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 9 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:26:00,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-03-15 22:26:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 132. [2022-03-15 22:26:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.49618320610687) internal successors, (327), 131 states have internal predecessors, (327), 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 22:26:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 327 transitions. [2022-03-15 22:26:00,539 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 327 transitions. Word has length 16 [2022-03-15 22:26:00,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:00,539 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 327 transitions. [2022-03-15 22:26:00,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 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 22:26:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 327 transitions. [2022-03-15 22:26:00,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:26:00,540 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:00,540 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:00,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 22:26:00,760 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,SelfDestructingSolverStorable15 [2022-03-15 22:26:00,761 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:26:00,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:00,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1126415118, now seen corresponding path program 12 times [2022-03-15 22:26:00,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:00,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959323456] [2022-03-15 22:26:00,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:00,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:00,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:00,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959323456] [2022-03-15 22:26:00,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959323456] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:00,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044084495] [2022-03-15 22:26:00,854 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:26:00,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:00,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:00,855 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 22:26:00,856 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 22:26:00,880 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:26:00,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:00,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 22:26:00,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:01,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:01,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044084495] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:01,349 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:01,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 22:26:01,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1812883385] [2022-03-15 22:26:01,349 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:01,350 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:01,351 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 76 transitions. [2022-03-15 22:26:01,351 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:02,027 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [6604#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 6618#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 6615#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 6620#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9998))) (or (not (< thread2Thread1of1ForFork1_x 9998)) (<= (+ Y thread2Thread1of1ForFork1_x) 19997))), 6611#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9998)))), 6607#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9999)))), 6622#(and (or (<= (+ Y X) 19997) (not (< X 9998))) (or (<= 10000 Y) (not (< X 9998)))), 6608#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996))), 6614#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 6613#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 9998)))), 6603#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 6602#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 10000))) (or (<= (+ Y thread2Thread1of1ForFork1_x) 19999) (not (< thread2Thread1of1ForFork1_x 10000)))), 6616#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 6609#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9998)))), 6619#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19998) (not (< thread2Thread1of1ForFork1_x 9999))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9999)))), 6610#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9998)))), 6612#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9998)))), 6606#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 6617#(and (or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9998)))), 6621#(and (or (<= 10000 Y) (not (= X thread2Thread1of1ForFork1_x)) (not (< thread2Thread1of1ForFork1_x 9998))) (or (not (= X thread2Thread1of1ForFork1_x)) (not (< thread2Thread1of1ForFork1_x 9998)) (<= (+ Y thread2Thread1of1ForFork1_x) 19997))), 6605#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000))))] [2022-03-15 22:26:02,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 22:26:02,027 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:02,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 22:26:02,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=2326, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 22:26:02,028 INFO L87 Difference]: Start difference. First operand 132 states and 327 transitions. Second operand has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 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 22:26:04,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:04,810 INFO L93 Difference]: Finished difference Result 340 states and 761 transitions. [2022-03-15 22:26:04,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-03-15 22:26:04,810 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 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 22:26:04,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:04,812 INFO L225 Difference]: With dead ends: 340 [2022-03-15 22:26:04,812 INFO L226 Difference]: Without dead ends: 325 [2022-03-15 22:26:04,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6380 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3118, Invalid=16342, Unknown=0, NotChecked=0, Total=19460 [2022-03-15 22:26:04,824 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 119 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:04,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 13 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:26:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-03-15 22:26:04,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 130. [2022-03-15 22:26:04,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.4108527131782944) internal successors, (311), 129 states have internal predecessors, (311), 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 22:26:04,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 311 transitions. [2022-03-15 22:26:04,828 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 311 transitions. Word has length 16 [2022-03-15 22:26:04,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:04,828 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 311 transitions. [2022-03-15 22:26:04,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 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 22:26:04,829 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 311 transitions. [2022-03-15 22:26:04,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:26:04,829 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:04,829 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:04,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-15 22:26:05,051 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,SelfDestructingSolverStorable16 [2022-03-15 22:26:05,051 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:26:05,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:05,052 INFO L85 PathProgramCache]: Analyzing trace with hash -637570947, now seen corresponding path program 13 times [2022-03-15 22:26:05,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:05,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019943725] [2022-03-15 22:26:05,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:05,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:05,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:05,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019943725] [2022-03-15 22:26:05,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019943725] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:05,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393014444] [2022-03-15 22:26:05,095 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:26:05,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:05,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:05,097 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 22:26:05,098 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 22:26:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:05,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:26:05,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:05,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:05,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393014444] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:05,293 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:05,293 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 19 [2022-03-15 22:26:05,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1435440839] [2022-03-15 22:26:05,293 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:05,294 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:05,295 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 73 transitions. [2022-03-15 22:26:05,295 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:05,686 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [7536#(or (<= 9998 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 7521#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x 9996)), 7530#(or (<= 9998 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 7532#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 7517#(or (<= thread1Thread1of1ForFork0_x 9998) (not (< thread1Thread1of1ForFork0_x 10000))), 7524#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1))), 7534#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 7523#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 7522#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 7519#(or (<= thread1Thread1of1ForFork0_x 9997) (<= 9999 thread1Thread1of1ForFork0_x)), 7531#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 7527#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 7518#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 7528#(or (<= 9998 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (<= thread1Thread1of1ForFork0_x 9996)), 7533#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9999 thread1Thread1of1ForFork0_x)), 7520#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 7526#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 7535#(or (<= 9998 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 7529#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x))), 7525#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)))] [2022-03-15 22:26:05,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:26:05,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:05,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:26:05,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1288, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 22:26:05,687 INFO L87 Difference]: Start difference. First operand 130 states and 311 transitions. Second operand has 31 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 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 22:26:08,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:08,372 INFO L93 Difference]: Finished difference Result 557 states and 1154 transitions. [2022-03-15 22:26:08,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2022-03-15 22:26:08,373 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 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 17 [2022-03-15 22:26:08,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:08,374 INFO L225 Difference]: With dead ends: 557 [2022-03-15 22:26:08,374 INFO L226 Difference]: Without dead ends: 554 [2022-03-15 22:26:08,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10283 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=6338, Invalid=24814, Unknown=0, NotChecked=0, Total=31152 [2022-03-15 22:26:08,377 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 240 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:08,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 15 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:26:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-03-15 22:26:08,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 205. [2022-03-15 22:26:08,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 2.769607843137255) internal successors, (565), 204 states have internal predecessors, (565), 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 22:26:08,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 565 transitions. [2022-03-15 22:26:08,383 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 565 transitions. Word has length 17 [2022-03-15 22:26:08,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:08,383 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 565 transitions. [2022-03-15 22:26:08,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 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 22:26:08,384 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 565 transitions. [2022-03-15 22:26:08,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:26:08,384 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:08,384 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:08,400 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 22:26:08,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:08,599 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:26:08,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:08,600 INFO L85 PathProgramCache]: Analyzing trace with hash -559153347, now seen corresponding path program 14 times [2022-03-15 22:26:08,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:08,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926678502] [2022-03-15 22:26:08,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:08,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:08,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:08,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926678502] [2022-03-15 22:26:08,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926678502] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:08,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128570471] [2022-03-15 22:26:08,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:26:08,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:08,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:08,654 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 22:26:08,655 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 22:26:08,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:26:08,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:08,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:26:08,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:08,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:08,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128570471] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:08,785 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:08,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 19 [2022-03-15 22:26:08,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2004773225] [2022-03-15 22:26:08,785 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:08,785 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:08,787 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 89 transitions. [2022-03-15 22:26:08,787 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:09,322 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [8917#(or (<= 9998 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 8916#(or (<= 9998 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 8914#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x))), 8898#(or (< thread1Thread1of1ForFork0_x 9999) (not (< thread1Thread1of1ForFork0_x 10000))), 8920#(<= 9997 thread2Thread1of1ForFork1_x), 8904#(or (<= 9998 thread1Thread1of1ForFork0_x) (< thread1Thread1of1ForFork0_x 9997)), 8902#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 8915#(or (<= 9998 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 8905#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 8906#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 8921#(or (<= 9997 thread2Thread1of1ForFork1_x) (not (= X thread2Thread1of1ForFork1_x))), 8900#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 8903#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 8913#(or (<= 9998 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (< thread1Thread1of1ForFork0_x 9997)), 8918#(<= 9999 thread2Thread1of1ForFork1_x), 8908#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 8897#(< thread1Thread1of1ForFork0_x 10000), 8907#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1))), 8922#(<= 9997 X), 8909#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 8912#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 8910#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 8919#(<= 9998 thread2Thread1of1ForFork1_x), 8899#(or (< thread1Thread1of1ForFork0_x 9998) (<= 9999 thread1Thread1of1ForFork0_x)), 8911#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9999 thread1Thread1of1ForFork0_x)), 8901#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x))] [2022-03-15 22:26:09,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 22:26:09,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:09,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 22:26:09,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1709, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:26:09,323 INFO L87 Difference]: Start difference. First operand 205 states and 565 transitions. Second operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 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 22:26:12,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:12,900 INFO L93 Difference]: Finished difference Result 504 states and 1121 transitions. [2022-03-15 22:26:12,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-03-15 22:26:12,900 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 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 17 [2022-03-15 22:26:12,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:12,901 INFO L225 Difference]: With dead ends: 504 [2022-03-15 22:26:12,902 INFO L226 Difference]: Without dead ends: 481 [2022-03-15 22:26:12,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14319 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=7925, Invalid=34717, Unknown=0, NotChecked=0, Total=42642 [2022-03-15 22:26:12,905 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 250 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:12,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 18 Invalid, 1952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:26:12,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-03-15 22:26:12,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 171. [2022-03-15 22:26:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 2.4823529411764707) internal successors, (422), 170 states have internal predecessors, (422), 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 22:26:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 422 transitions. [2022-03-15 22:26:12,910 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 422 transitions. Word has length 17 [2022-03-15 22:26:12,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:12,910 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 422 transitions. [2022-03-15 22:26:12,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 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 22:26:12,911 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 422 transitions. [2022-03-15 22:26:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:26:12,912 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:12,913 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:12,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-15 22:26:13,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:13,128 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:26:13,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:13,128 INFO L85 PathProgramCache]: Analyzing trace with hash 135713213, now seen corresponding path program 15 times [2022-03-15 22:26:13,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:13,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232403870] [2022-03-15 22:26:13,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:13,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:13,188 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:13,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:13,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232403870] [2022-03-15 22:26:13,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232403870] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:13,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817054354] [2022-03-15 22:26:13,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:26:13,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:13,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:13,190 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 22:26:13,191 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 22:26:13,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:26:13,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:13,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 22:26:13,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 22:26:13,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 22:26:13,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817054354] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:13,389 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:13,389 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 19 [2022-03-15 22:26:13,389 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1424161140] [2022-03-15 22:26:13,389 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:13,390 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:13,391 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 77 transitions. [2022-03-15 22:26:13,392 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:13,916 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [10220#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 10232#(<= (+ X 1) thread1Thread1of1ForFork0_x), 10227#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 2 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 10214#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9999)), 10213#(<= 9997 thread1Thread1of1ForFork0_x), 10223#(or (not (= X thread1Thread1of1ForFork0_x)) (< thread2Thread1of1ForFork1_x 10000) (<= 9997 thread1Thread1of1ForFork0_x)), 10216#(or (<= 9998 thread1Thread1of1ForFork0_x) (< thread2Thread1of1ForFork1_x 10000)), 10211#(<= 9999 thread1Thread1of1ForFork0_x), 10230#(<= (+ 3 X) thread1Thread1of1ForFork0_x), 10235#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9997)), 10224#(or (<= thread2Thread1of1ForFork1_x 9998) (not (= X thread1Thread1of1ForFork0_x)) (<= 9997 thread1Thread1of1ForFork0_x)), 10221#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9997 thread1Thread1of1ForFork0_x)), 10219#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9999 thread1Thread1of1ForFork0_x)), 10212#(<= 9998 thread1Thread1of1ForFork0_x), 10238#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread2Thread1of1ForFork1_x thread1Thread1of1ForFork0_x)), 10218#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 10233#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9997)), 10228#(or (<= (+ thread2Thread1of1ForFork1_x 1) thread1Thread1of1ForFork0_x) (not (= X thread2Thread1of1ForFork1_x))), 10234#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9999 thread1Thread1of1ForFork0_x)), 10236#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9997 thread1Thread1of1ForFork0_x)), 10215#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9999 thread1Thread1of1ForFork0_x)), 10226#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 3 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 10217#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9997 thread1Thread1of1ForFork0_x)), 10225#(or (<= thread2Thread1of1ForFork1_x 9996) (not (= X thread2Thread1of1ForFork1_x))), 10231#(<= (+ 2 X) thread1Thread1of1ForFork0_x), 10237#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread2Thread1of1ForFork1_x 9997) (<= 9997 thread1Thread1of1ForFork0_x)), 10210#(<= 10000 thread1Thread1of1ForFork0_x), 10222#(or (not (= X thread1Thread1of1ForFork0_x)) (<= 9997 thread1Thread1of1ForFork0_x)), 10229#(<= X 9996)] [2022-03-15 22:26:13,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 22:26:13,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:13,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 22:26:13,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=1864, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 22:26:13,917 INFO L87 Difference]: Start difference. First operand 171 states and 422 transitions. Second operand has 40 states, 40 states have (on average 1.9) internal successors, (76), 40 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 22:26:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:15,772 INFO L93 Difference]: Finished difference Result 466 states and 1123 transitions. [2022-03-15 22:26:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-03-15 22:26:15,772 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.9) internal successors, (76), 40 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) Word has length 17 [2022-03-15 22:26:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:15,782 INFO L225 Difference]: With dead ends: 466 [2022-03-15 22:26:15,782 INFO L226 Difference]: Without dead ends: 436 [2022-03-15 22:26:15,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6554 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5206, Invalid=15674, Unknown=0, NotChecked=0, Total=20880 [2022-03-15 22:26:15,787 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 146 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:15,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 11 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:26:15,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-03-15 22:26:15,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 160. [2022-03-15 22:26:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 2.490566037735849) internal successors, (396), 159 states have internal predecessors, (396), 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 22:26:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 396 transitions. [2022-03-15 22:26:15,806 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 396 transitions. Word has length 17 [2022-03-15 22:26:15,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:15,807 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 396 transitions. [2022-03-15 22:26:15,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.9) internal successors, (76), 40 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 22:26:15,807 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 396 transitions. [2022-03-15 22:26:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:26:15,807 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:15,807 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:15,824 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 22:26:16,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:16,008 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:26:16,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:16,008 INFO L85 PathProgramCache]: Analyzing trace with hash -458746434, now seen corresponding path program 16 times [2022-03-15 22:26:16,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:16,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801551992] [2022-03-15 22:26:16,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:16,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:16,141 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:16,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801551992] [2022-03-15 22:26:16,142 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801551992] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:16,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206954800] [2022-03-15 22:26:16,142 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:26:16,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:16,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:16,143 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 22:26:16,144 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 22:26:16,161 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:26:16,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:16,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 22:26:16,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:16,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:16,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206954800] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:16,815 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:16,815 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2022-03-15 22:26:16,816 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [706117402] [2022-03-15 22:26:16,816 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:16,816 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:16,818 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 88 transitions. [2022-03-15 22:26:16,818 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:17,831 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [11373#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9998)))), 11363#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 11370#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9998)))), 11384#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 11372#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9999)))), 11376#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997)))), 11375#(and (or (<= 10000 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x) 19996) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997)))), 11364#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 11380#(and (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 11369#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 11381#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 11374#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 11388#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997)))), 11368#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x) 19996) (not (< thread1Thread1of1ForFork0_x 9997)))), 11361#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 11387#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 11383#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 11365#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 11385#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998)))), 11371#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9997)))), 11367#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x) 19997))), 11382#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 11366#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x) 19998)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 10000 Y))), 11362#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 11389#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997)))), 11378#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996))), 11360#(and (or (<= (+ Y thread1Thread1of1ForFork0_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 11379#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 9998)))), 11377#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 11386#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9997))))] [2022-03-15 22:26:17,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 22:26:17,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:17,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 22:26:17,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=3884, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 22:26:17,833 INFO L87 Difference]: Start difference. First operand 160 states and 396 transitions. Second operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 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 22:26:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:23,987 INFO L93 Difference]: Finished difference Result 560 states and 1402 transitions. [2022-03-15 22:26:23,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-03-15 22:26:23,988 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 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 18 [2022-03-15 22:26:23,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:23,990 INFO L225 Difference]: With dead ends: 560 [2022-03-15 22:26:23,990 INFO L226 Difference]: Without dead ends: 556 [2022-03-15 22:26:23,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14624 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=7538, Invalid=33468, Unknown=0, NotChecked=0, Total=41006 [2022-03-15 22:26:23,992 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 161 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:23,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 9 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:26:23,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-03-15 22:26:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 208. [2022-03-15 22:26:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.5458937198067635) internal successors, (527), 207 states have internal predecessors, (527), 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 22:26:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 527 transitions. [2022-03-15 22:26:23,997 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 527 transitions. Word has length 18 [2022-03-15 22:26:23,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:23,997 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 527 transitions. [2022-03-15 22:26:23,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 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 22:26:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 527 transitions. [2022-03-15 22:26:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:26:23,997 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:23,997 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:24,020 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 22:26:24,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:24,204 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:26:24,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash -457189614, now seen corresponding path program 17 times [2022-03-15 22:26:24,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:24,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57474905] [2022-03-15 22:26:24,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:24,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:24,333 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:24,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57474905] [2022-03-15 22:26:24,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57474905] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:24,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461353611] [2022-03-15 22:26:24,333 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:26:24,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:24,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:24,334 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 22:26:24,335 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 22:26:24,352 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:26:24,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:24,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 22:26:24,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-15 22:26:24,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-15 22:26:24,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461353611] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:24,605 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:24,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 19 [2022-03-15 22:26:24,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [906709225] [2022-03-15 22:26:24,606 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:24,606 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:24,608 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 102 transitions. [2022-03-15 22:26:24,608 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:25,730 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [12786#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9997)))), 12778#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996))), 12793#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 12784#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 12780#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 12795#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997)))), 12773#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 12782#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9998)))), 12792#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 12789#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 12770#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 12781#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9998)))), 12785#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998)))), 12768#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 12783#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 9998)))), 12788#(and (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 12790#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9997)))), 12765#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 10000))) (or (<= (+ Y thread2Thread1of1ForFork1_x) 19999) (not (< thread2Thread1of1ForFork1_x 10000)))), 12779#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 12772#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9998))) (or (not (< thread2Thread1of1ForFork1_x 9998)) (<= (+ Y thread2Thread1of1ForFork1_x) 19997))), 12766#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 12775#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19996) (not (< thread2Thread1of1ForFork1_x 9997))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9997)))), 12791#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997)))), 12767#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 12771#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19998) (not (< thread2Thread1of1ForFork1_x 9999))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9999)))), 12794#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9997)))), 12776#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19996) (not (= X thread2Thread1of1ForFork1_x)) (not (< thread2Thread1of1ForFork1_x 9997))) (or (<= 10000 Y) (not (= X thread2Thread1of1ForFork1_x)) (not (< thread2Thread1of1ForFork1_x 9997)))), 12787#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 12769#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 12774#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9999)))), 12777#(and (or (<= 10000 Y) (not (< X 9997))) (or (<= (+ Y X) 19996) (not (< X 9997))))] [2022-03-15 22:26:25,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 22:26:25,732 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:25,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 22:26:25,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=2342, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 22:26:25,733 INFO L87 Difference]: Start difference. First operand 208 states and 527 transitions. Second operand has 46 states, 45 states have (on average 2.022222222222222) internal successors, (91), 45 states have internal predecessors, (91), 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 22:26:32,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:32,271 INFO L93 Difference]: Finished difference Result 694 states and 1615 transitions. [2022-03-15 22:26:32,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2022-03-15 22:26:32,271 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.022222222222222) internal successors, (91), 45 states have internal predecessors, (91), 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 18 [2022-03-15 22:26:32,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:32,273 INFO L225 Difference]: With dead ends: 694 [2022-03-15 22:26:32,273 INFO L226 Difference]: Without dead ends: 671 [2022-03-15 22:26:32,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15464 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=7241, Invalid=36649, Unknown=0, NotChecked=0, Total=43890 [2022-03-15 22:26:32,276 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 229 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 1726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:32,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 14 Invalid, 1726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:26:32,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-03-15 22:26:32,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 204. [2022-03-15 22:26:32,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.4679802955665027) internal successors, (501), 203 states have internal predecessors, (501), 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 22:26:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 501 transitions. [2022-03-15 22:26:32,286 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 501 transitions. Word has length 18 [2022-03-15 22:26:32,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:32,286 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 501 transitions. [2022-03-15 22:26:32,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.022222222222222) internal successors, (91), 45 states have internal predecessors, (91), 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 22:26:32,286 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 501 transitions. [2022-03-15 22:26:32,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:26:32,287 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:32,287 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:32,302 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 22:26:32,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:32,487 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:26:32,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:32,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1366416803, now seen corresponding path program 18 times [2022-03-15 22:26:32,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:32,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190836350] [2022-03-15 22:26:32,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:32,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:32,546 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:32,546 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190836350] [2022-03-15 22:26:32,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190836350] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:32,546 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020805388] [2022-03-15 22:26:32,546 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:26:32,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:32,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:32,547 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 22:26:32,548 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 22:26:32,567 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 22:26:32,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:32,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 22:26:32,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:32,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:32,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020805388] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:32,703 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:32,703 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2022-03-15 22:26:32,703 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [828156688] [2022-03-15 22:26:32,703 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:32,704 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:32,706 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 99 transitions. [2022-03-15 22:26:32,706 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:33,298 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [14368#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9997 thread1Thread1of1ForFork0_x)), 14349#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread1Thread1of1ForFork0_x 9995) (<= 9997 thread1Thread1of1ForFork0_x)), 14362#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 14369#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 14373#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 14370#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 14360#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 14367#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 14354#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (not (< thread1Thread1of1ForFork0_x 10000))), 14363#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 14355#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 14348#(or (<= thread1Thread1of1ForFork0_x 9995) (<= 9997 thread1Thread1of1ForFork0_x)), 14361#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 14346#(or (<= thread1Thread1of1ForFork0_x 9997) (<= 9999 thread1Thread1of1ForFork0_x)), 14345#(or (<= thread1Thread1of1ForFork0_x 9998) (not (< thread1Thread1of1ForFork0_x 10000))), 14359#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 14353#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 14357#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 14356#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 14365#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 14358#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9999 thread1Thread1of1ForFork0_x)), 14366#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9997 thread1Thread1of1ForFork0_x)), 14350#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 14374#(or (not (= X thread1Thread1of1ForFork0_x)) (<= 9997 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 14352#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1))), 14372#(or (<= 9997 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 14351#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 14364#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9998 thread1Thread1of1ForFork0_x)), 14347#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x 9996)), 14371#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x))] [2022-03-15 22:26:33,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 22:26:33,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:33,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 22:26:33,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=2426, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 22:26:33,299 INFO L87 Difference]: Start difference. First operand 204 states and 501 transitions. Second operand has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 43 states have internal predecessors, (89), 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 22:26:38,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:38,156 INFO L93 Difference]: Finished difference Result 907 states and 1885 transitions. [2022-03-15 22:26:38,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 237 states. [2022-03-15 22:26:38,156 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 43 states have internal predecessors, (89), 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 19 [2022-03-15 22:26:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:38,158 INFO L225 Difference]: With dead ends: 907 [2022-03-15 22:26:38,158 INFO L226 Difference]: Without dead ends: 901 [2022-03-15 22:26:38,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26344 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=14578, Invalid=59678, Unknown=0, NotChecked=0, Total=74256 [2022-03-15 22:26:38,161 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 332 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:38,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 18 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:26:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-03-15 22:26:38,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 323. [2022-03-15 22:26:38,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 2.81055900621118) internal successors, (905), 322 states have internal predecessors, (905), 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 22:26:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 905 transitions. [2022-03-15 22:26:38,168 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 905 transitions. Word has length 19 [2022-03-15 22:26:38,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:38,168 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 905 transitions. [2022-03-15 22:26:38,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 43 states have internal predecessors, (89), 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 22:26:38,168 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 905 transitions. [2022-03-15 22:26:38,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:26:38,169 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:38,169 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:38,184 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 22:26:38,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:38,385 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:26:38,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:38,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1287999203, now seen corresponding path program 19 times [2022-03-15 22:26:38,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:38,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997034572] [2022-03-15 22:26:38,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:38,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:38,444 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:38,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997034572] [2022-03-15 22:26:38,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997034572] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:38,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673858051] [2022-03-15 22:26:38,444 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:26:38,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:38,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:38,445 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 22:26:38,446 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 22:26:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:38,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 22:26:38,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:38,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:38,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673858051] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:38,575 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:38,575 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2022-03-15 22:26:38,575 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [666576647] [2022-03-15 22:26:38,575 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:38,576 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:38,578 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 117 transitions. [2022-03-15 22:26:38,578 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:39,201 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [16518#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 16501#(< thread1Thread1of1ForFork0_x 10000), 16505#(or (< thread1Thread1of1ForFork0_x 9998) (<= 9999 thread1Thread1of1ForFork0_x)), 16525#(<= 9996 thread2Thread1of1ForFork1_x), 16531#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9998 thread1Thread1of1ForFork0_x)), 16509#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 16533#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9997 thread1Thread1of1ForFork0_x)), 16515#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 16536#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 16528#(or (not (= X thread1Thread1of1ForFork0_x)) (< thread1Thread1of1ForFork0_x 9996) (<= 9997 thread1Thread1of1ForFork0_x)), 16506#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 16520#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 16529#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (not (< thread1Thread1of1ForFork0_x 10000))), 16527#(<= 9996 X), 16516#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 16514#(or (< thread1Thread1of1ForFork0_x 9996) (<= 9997 thread1Thread1of1ForFork0_x)), 16502#(or (< thread1Thread1of1ForFork0_x 9999) (not (< thread1Thread1of1ForFork0_x 10000))), 16524#(<= 9997 thread2Thread1of1ForFork1_x), 16508#(or (<= 9998 thread1Thread1of1ForFork0_x) (< thread1Thread1of1ForFork0_x 9997)), 16537#(or (not (= X thread1Thread1of1ForFork0_x)) (<= 9997 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 16523#(<= 9998 thread2Thread1of1ForFork1_x), 16507#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 16511#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1))), 16517#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 16521#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 16510#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 16512#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 16513#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 16530#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 16522#(<= 9999 thread2Thread1of1ForFork1_x), 16504#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 16503#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 16535#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 16526#(or (<= 9996 thread2Thread1of1ForFork1_x) (not (= X thread2Thread1of1ForFork1_x))), 16519#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9999 thread1Thread1of1ForFork0_x)), 16532#(or (<= 9997 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 16534#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9997 thread1Thread1of1ForFork0_x))] [2022-03-15 22:26:39,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 22:26:39,201 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:39,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 22:26:39,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=3085, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 22:26:39,202 INFO L87 Difference]: Start difference. First operand 323 states and 905 transitions. Second operand has 50 states, 50 states have (on average 2.08) internal successors, (104), 50 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 22:26:45,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:45,251 INFO L93 Difference]: Finished difference Result 810 states and 1824 transitions. [2022-03-15 22:26:45,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2022-03-15 22:26:45,251 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 50 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) Word has length 19 [2022-03-15 22:26:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:45,254 INFO L225 Difference]: With dead ends: 810 [2022-03-15 22:26:45,254 INFO L226 Difference]: Without dead ends: 783 [2022-03-15 22:26:45,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31948 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=16200, Invalid=74702, Unknown=0, NotChecked=0, Total=90902 [2022-03-15 22:26:45,260 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 346 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2400 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 2400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:45,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 22 Invalid, 2746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 2400 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:26:45,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2022-03-15 22:26:45,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 262. [2022-03-15 22:26:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 2.521072796934866) internal successors, (658), 261 states have internal predecessors, (658), 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 22:26:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 658 transitions. [2022-03-15 22:26:45,282 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 658 transitions. Word has length 19 [2022-03-15 22:26:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:45,282 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 658 transitions. [2022-03-15 22:26:45,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 50 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 22:26:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 658 transitions. [2022-03-15 22:26:45,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:26:45,288 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:45,288 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:45,304 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 22:26:45,501 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,SelfDestructingSolverStorable23 [2022-03-15 22:26:45,501 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:26:45,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:45,501 INFO L85 PathProgramCache]: Analyzing trace with hash 998670239, now seen corresponding path program 20 times [2022-03-15 22:26:45,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:45,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940710344] [2022-03-15 22:26:45,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:45,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:45,606 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:45,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:45,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940710344] [2022-03-15 22:26:45,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940710344] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:45,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70131542] [2022-03-15 22:26:45,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:26:45,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:45,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:45,607 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 22:26:45,608 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 22:26:45,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:26:45,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:45,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 22:26:45,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:45,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:45,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70131542] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:45,774 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:45,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2022-03-15 22:26:45,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [429279777] [2022-03-15 22:26:45,774 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:45,775 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:45,777 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 103 transitions. [2022-03-15 22:26:45,777 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:46,465 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [18500#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 4 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 18492#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9997 thread1Thread1of1ForFork0_x)), 18513#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 18490#(or (<= 9998 thread1Thread1of1ForFork0_x) (< thread2Thread1of1ForFork1_x 10000)), 18516#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9997)), 18506#(or (<= (+ thread2Thread1of1ForFork1_x 1) thread1Thread1of1ForFork0_x) (not (= X thread2Thread1of1ForFork1_x))), 18508#(<= (+ 3 X) thread1Thread1of1ForFork0_x), 18519#(or (<= 9996 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (<= thread2Thread1of1ForFork1_x 9997)), 18521#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9996)), 18505#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 2 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 18504#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 3 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 18509#(<= (+ 2 X) thread1Thread1of1ForFork0_x), 18497#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 18496#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9999 thread1Thread1of1ForFork0_x)), 18499#(or (<= thread2Thread1of1ForFork1_x 9995) (not (= X thread2Thread1of1ForFork1_x))), 18488#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9999 thread1Thread1of1ForFork0_x)), 18491#(<= 9997 thread1Thread1of1ForFork0_x), 18495#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9996)), 18498#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9997 thread1Thread1of1ForFork0_x)), 18514#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998) (not (= X thread1Thread1of1ForFork0_x))), 18515#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9999 thread1Thread1of1ForFork0_x)), 18489#(<= 9998 thread1Thread1of1ForFork0_x), 18502#(<= 9996 thread1Thread1of1ForFork0_x), 18520#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9999 thread1Thread1of1ForFork0_x)), 18511#(or (<= 9996 thread1Thread1of1ForFork0_x) (< thread2Thread1of1ForFork1_x 10000)), 18510#(<= (+ X 1) thread1Thread1of1ForFork0_x), 18503#(or (<= 9996 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x))), 18524#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9996) (not (= X thread1Thread1of1ForFork0_x))), 18522#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9997 thread1Thread1of1ForFork0_x)), 18501#(<= X 9995), 18487#(<= 9999 thread1Thread1of1ForFork0_x), 18525#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread2Thread1of1ForFork1_x thread1Thread1of1ForFork0_x)), 18518#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9997)), 18485#(<= 10000 thread1Thread1of1ForFork0_x), 18507#(<= (+ X 4) thread1Thread1of1ForFork0_x), 18486#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9999)), 18493#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 18517#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9997 thread1Thread1of1ForFork0_x)), 18494#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9997)), 18523#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9996)), 18512#(or (<= 9996 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (< thread2Thread1of1ForFork1_x 10000))] [2022-03-15 22:26:46,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 22:26:46,466 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:46,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 22:26:46,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=2717, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 22:26:46,467 INFO L87 Difference]: Start difference. First operand 262 states and 658 transitions. Second operand has 54 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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 22:26:48,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:48,655 INFO L93 Difference]: Finished difference Result 799 states and 1981 transitions. [2022-03-15 22:26:48,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2022-03-15 22:26:48,656 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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 19 [2022-03-15 22:26:48,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:48,658 INFO L225 Difference]: With dead ends: 799 [2022-03-15 22:26:48,658 INFO L226 Difference]: Without dead ends: 749 [2022-03-15 22:26:48,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18181 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=12686, Invalid=35934, Unknown=0, NotChecked=0, Total=48620 [2022-03-15 22:26:48,663 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 202 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:48,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 6 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:26:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2022-03-15 22:26:48,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 238. [2022-03-15 22:26:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 2.5274261603375527) internal successors, (599), 237 states have internal predecessors, (599), 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 22:26:48,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 599 transitions. [2022-03-15 22:26:48,690 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 599 transitions. Word has length 19 [2022-03-15 22:26:48,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:48,690 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 599 transitions. [2022-03-15 22:26:48,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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 22:26:48,690 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 599 transitions. [2022-03-15 22:26:48,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 22:26:48,691 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:48,691 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:48,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-03-15 22:26:48,891 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,SelfDestructingSolverStorable24 [2022-03-15 22:26:48,891 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:26:48,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:48,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1314751650, now seen corresponding path program 21 times [2022-03-15 22:26:48,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:48,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425479436] [2022-03-15 22:26:48,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:48,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:48,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:48,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425479436] [2022-03-15 22:26:48,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425479436] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:48,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253776283] [2022-03-15 22:26:48,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:26:48,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:48,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:48,996 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 22:26:48,997 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 22:26:49,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:26:49,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:49,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 22:26:49,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:49,088 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-03-15 22:26:49,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:49,187 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-03-15 22:26:49,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253776283] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:49,188 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:49,188 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 21 [2022-03-15 22:26:49,188 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [393620252] [2022-03-15 22:26:49,188 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:49,188 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:49,191 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 116 transitions. [2022-03-15 22:26:49,191 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:50,683 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 42 new interpolants: [20282#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x) 19995)) (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9996)))), 20270#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x) 19997))), 20267#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 20286#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 20279#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 20293#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 20277#(and (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 20278#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 20296#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 20284#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 20276#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 20289#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 20302#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9996)) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 20263#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 20274#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x) 19996) (not (< thread1Thread1of1ForFork0_x 9997)))), 20287#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9996)) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x) 19995))), 20290#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9996)) (not (= X thread1Thread1of1ForFork0_x)))), 20292#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 20297#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 20291#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (= X thread1Thread1of1ForFork0_x)))), 20275#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9997)))), 20264#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 20280#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 20262#(and (or (<= (+ Y thread1Thread1of1ForFork0_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 20285#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9996)))), 20273#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 9998)))), 20288#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 20272#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9998)))), 20269#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996))), 20266#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x) 19998)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 10000 Y))), 20295#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9997)))), 20265#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 20298#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 20303#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9996)) (not (= X thread1Thread1of1ForFork0_x)))), 20271#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9998)))), 20281#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 20299#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9998)))), 20283#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 20294#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998)))), 20268#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9999)))), 20301#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 20300#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))))] [2022-03-15 22:26:50,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-03-15 22:26:50,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:50,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-03-15 22:26:50,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=3665, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 22:26:50,687 INFO L87 Difference]: Start difference. First operand 238 states and 599 transitions. Second operand has 59 states, 58 states have (on average 1.896551724137931) internal successors, (110), 58 states have internal predecessors, (110), 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 22:27:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:27:00,994 INFO L93 Difference]: Finished difference Result 1081 states and 2757 transitions. [2022-03-15 22:27:00,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states. [2022-03-15 22:27:00,994 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.896551724137931) internal successors, (110), 58 states have internal predecessors, (110), 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 20 [2022-03-15 22:27:00,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:27:00,997 INFO L225 Difference]: With dead ends: 1081 [2022-03-15 22:27:00,997 INFO L226 Difference]: Without dead ends: 1077 [2022-03-15 22:27:01,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34718 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=16417, Invalid=73283, Unknown=0, NotChecked=0, Total=89700 [2022-03-15 22:27:01,004 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 207 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 501 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 501 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:27:01,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 11 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [501 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:27:01,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2022-03-15 22:27:01,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 306. [2022-03-15 22:27:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 2.5639344262295083) internal successors, (782), 305 states have internal predecessors, (782), 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 22:27:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 782 transitions. [2022-03-15 22:27:01,044 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 782 transitions. Word has length 20 [2022-03-15 22:27:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:27:01,044 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 782 transitions. [2022-03-15 22:27:01,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.896551724137931) internal successors, (110), 58 states have internal predecessors, (110), 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 22:27:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 782 transitions. [2022-03-15 22:27:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 22:27:01,045 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:27:01,045 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:27:01,081 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 22:27:01,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 22:27:01,246 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:27:01,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:27:01,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1313194830, now seen corresponding path program 22 times [2022-03-15 22:27:01,247 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:27:01,247 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178286585] [2022-03-15 22:27:01,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:27:01,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:27:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:27:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:01,368 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:27:01,368 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178286585] [2022-03-15 22:27:01,368 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178286585] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:27:01,368 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415613849] [2022-03-15 22:27:01,368 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:27:01,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:27:01,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:27:01,370 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 22:27:01,384 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 22:27:01,405 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:27:01,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:27:01,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 22:27:01,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:27:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:01,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:27:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:01,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415613849] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:27:01,965 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:27:01,965 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 41 [2022-03-15 22:27:01,965 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [234826680] [2022-03-15 22:27:01,965 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:27:01,966 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:27:01,968 INFO L252 McrAutomatonBuilder]: Finished intersection with 77 states and 132 transitions. [2022-03-15 22:27:01,968 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:27:03,501 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [22651#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998)))), 22626#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9998))) (or (not (< thread2Thread1of1ForFork1_x 9998)) (<= (+ Y thread2Thread1of1ForFork1_x) 19997))), 22649#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 22650#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 22648#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 22633#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 22644#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 22665#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9996)) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 22654#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 22624#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 10000))) (or (<= (+ Y thread2Thread1of1ForFork1_x) 19999) (not (< thread2Thread1of1ForFork1_x 10000)))), 22634#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9999)))), 22661#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9996)) (not (= X thread1Thread1of1ForFork0_x)))), 22627#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19996) (not (< thread2Thread1of1ForFork1_x 9997))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9997)))), 22635#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9998)))), 22630#(and (or (<= 10000 Y) (not (< X 9996))) (or (not (< X 9996)) (<= (+ Y X) 19995))), 22663#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 22653#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 22643#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 22652#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9998)))), 22658#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9997)))), 22637#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 22640#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9997)))), 22638#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996))), 22636#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9998)))), 22641#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 22631#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 22647#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 22656#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9996)))), 22662#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 22632#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 22628#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9996))) (or (<= (+ Y thread2Thread1of1ForFork1_x) 19995) (not (< thread2Thread1of1ForFork1_x 9996)))), 22666#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9996)) (not (= X thread1Thread1of1ForFork0_x)))), 22639#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 9998)))), 22645#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 22660#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 22642#(and (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 22664#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (= X thread1Thread1of1ForFork0_x)))), 22625#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19998) (not (< thread2Thread1of1ForFork1_x 9999))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9999)))), 22646#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 22629#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19995) (not (= X thread2Thread1of1ForFork1_x)) (not (< thread2Thread1of1ForFork1_x 9996))) (or (<= 10000 Y) (not (= X thread2Thread1of1ForFork1_x)) (not (< thread2Thread1of1ForFork1_x 9996)))), 22657#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 22655#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 22659#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)))] [2022-03-15 22:27:03,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 22:27:03,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:27:03,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 22:27:03,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=6465, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 22:27:03,502 INFO L87 Difference]: Start difference. First operand 306 states and 782 transitions. Second operand has 60 states, 59 states have (on average 2.016949152542373) internal successors, (119), 59 states have internal predecessors, (119), 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 22:27:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:27:15,485 INFO L93 Difference]: Finished difference Result 1308 states and 3112 transitions. [2022-03-15 22:27:15,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 263 states. [2022-03-15 22:27:15,486 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 2.016949152542373) internal successors, (119), 59 states have internal predecessors, (119), 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 20 [2022-03-15 22:27:15,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:27:15,489 INFO L225 Difference]: With dead ends: 1308 [2022-03-15 22:27:15,490 INFO L226 Difference]: Without dead ends: 1275 [2022-03-15 22:27:15,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 21 SyntacticMatches, 9 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45068 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=18519, Invalid=96741, Unknown=0, NotChecked=0, Total=115260 [2022-03-15 22:27:15,494 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 329 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 2256 mSolverCounterSat, 504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 2760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 2256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:27:15,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 15 Invalid, 2760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 2256 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:27:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2022-03-15 22:27:15,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 300. [2022-03-15 22:27:15,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 2.491638795986622) internal successors, (745), 299 states have internal predecessors, (745), 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 22:27:15,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 745 transitions. [2022-03-15 22:27:15,503 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 745 transitions. Word has length 20 [2022-03-15 22:27:15,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:27:15,503 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 745 transitions. [2022-03-15 22:27:15,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 2.016949152542373) internal successors, (119), 59 states have internal predecessors, (119), 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 22:27:15,503 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 745 transitions. [2022-03-15 22:27:15,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 22:27:15,504 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:27:15,504 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:27:15,535 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 22:27:15,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:27:15,736 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:27:15,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:27:15,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2132774723, now seen corresponding path program 23 times [2022-03-15 22:27:15,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:27:15,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857263940] [2022-03-15 22:27:15,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:27:15,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:27:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:27:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:15,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:27:15,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857263940] [2022-03-15 22:27:15,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857263940] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:27:15,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893196535] [2022-03-15 22:27:15,833 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:27:15,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:27:15,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:27:15,845 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 22:27:15,845 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 22:27:15,868 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 22:27:15,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:27:15,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 22:27:15,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:27:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:15,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:27:16,136 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:16,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893196535] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:27:16,137 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:27:16,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 27 [2022-03-15 22:27:16,137 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1422723368] [2022-03-15 22:27:16,137 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:27:16,138 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:27:16,141 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 129 transitions. [2022-03-15 22:27:16,141 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:27:17,553 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 42 new interpolants: [25262#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x 9994)), 25249#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 25273#(or (<= 9996 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 25248#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 25269#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x))), 25238#(or (<= thread1Thread1of1ForFork0_x 9997) (<= 9999 thread1Thread1of1ForFork0_x)), 25255#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 25268#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x))), 25236#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 25241#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x 9996)), 25256#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x))), 25272#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 25258#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9998 thread1Thread1of1ForFork0_x)), 25266#(or (<= 9996 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (<= thread1Thread1of1ForFork0_x 9994)), 25259#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 25252#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (not (< thread1Thread1of1ForFork0_x 10000))), 25270#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 25263#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 25247#(or (<= thread1Thread1of1ForFork0_x 9995) (<= 9997 thread1Thread1of1ForFork0_x)), 25264#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 25245#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 25260#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 25265#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 25237#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 25276#(or (<= 9996 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 25254#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 25240#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 25257#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 25250#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 25267#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x))), 25243#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 25235#(or (<= thread1Thread1of1ForFork0_x 9998) (not (< thread1Thread1of1ForFork0_x 10000))), 25261#(or (<= 9997 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 25251#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 25271#(or (<= 9996 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 25242#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 25274#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9997 thread1Thread1of1ForFork0_x)), 25275#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 25246#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 25239#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 25253#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9999 thread1Thread1of1ForFork0_x)), 25244#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)))] [2022-03-15 22:27:17,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-15 22:27:17,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:27:17,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-15 22:27:17,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=4161, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 22:27:17,555 INFO L87 Difference]: Start difference. First operand 300 states and 745 transitions. Second operand has 57 states, 57 states have (on average 2.0526315789473686) internal successors, (117), 57 states have internal predecessors, (117), 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 22:27:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:27:26,828 INFO L93 Difference]: Finished difference Result 1388 states and 2864 transitions. [2022-03-15 22:27:26,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 345 states. [2022-03-15 22:27:26,828 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.0526315789473686) internal successors, (117), 57 states have internal predecessors, (117), 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 21 [2022-03-15 22:27:26,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:27:26,832 INFO L225 Difference]: With dead ends: 1388 [2022-03-15 22:27:26,833 INFO L226 Difference]: Without dead ends: 1379 [2022-03-15 22:27:26,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57816 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=29719, Invalid=125123, Unknown=0, NotChecked=0, Total=154842 [2022-03-15 22:27:26,838 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 313 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 2098 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:27:26,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 24 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2098 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:27:26,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2022-03-15 22:27:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 472. [2022-03-15 22:27:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 2.821656050955414) internal successors, (1329), 471 states have internal predecessors, (1329), 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 22:27:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1329 transitions. [2022-03-15 22:27:26,849 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1329 transitions. Word has length 21 [2022-03-15 22:27:26,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:27:26,849 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 1329 transitions. [2022-03-15 22:27:26,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.0526315789473686) internal successors, (117), 57 states have internal predecessors, (117), 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 22:27:26,849 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1329 transitions. [2022-03-15 22:27:26,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 22:27:26,850 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:27:26,850 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:27:26,868 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 22:27:27,067 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,SelfDestructingSolverStorable27 [2022-03-15 22:27:27,068 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:27:27,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:27:27,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2054357123, now seen corresponding path program 24 times [2022-03-15 22:27:27,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:27:27,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764048413] [2022-03-15 22:27:27,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:27:27,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:27:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:27:27,156 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:27,156 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:27:27,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764048413] [2022-03-15 22:27:27,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764048413] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:27:27,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343001105] [2022-03-15 22:27:27,157 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:27:27,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:27:27,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:27:27,159 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 22:27:27,164 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 22:27:27,181 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:27:27,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:27:27,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 22:27:27,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:27:27,240 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-03-15 22:27:27,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:27:27,330 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-03-15 22:27:27,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343001105] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:27:27,330 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:27:27,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 22 [2022-03-15 22:27:27,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [798514778] [2022-03-15 22:27:27,330 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:27:27,337 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:27:27,340 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 149 transitions. [2022-03-15 22:27:27,340 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:27:28,422 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 50 new interpolants: [28450#(or (<= 9996 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 28419#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 28430#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9998 thread1Thread1of1ForFork0_x)), 28442#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 28424#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x))), 28448#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x))), 28415#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 28417#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 28423#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 28447#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x))), 28428#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 28433#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 28438#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9997 thread1Thread1of1ForFork0_x)), 28451#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 28434#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 28416#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1))), 28421#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 28443#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 28432#(or (< thread1Thread1of1ForFork0_x 9996) (<= 9997 thread1Thread1of1ForFork0_x)), 28431#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 28452#(or (<= 9996 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 28425#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 28437#(or (<= 9997 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 28405#(or (< thread1Thread1of1ForFork0_x 9998) (<= 9999 thread1Thread1of1ForFork0_x)), 28408#(<= 9998 thread2Thread1of1ForFork1_x), 28410#(<= 9996 thread2Thread1of1ForFork1_x), 28426#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 28427#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 28436#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 28412#(or (not (= X thread2Thread1of1ForFork1_x)) (<= 9995 thread2Thread1of1ForFork1_x)), 28446#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x))), 28435#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 28441#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 28413#(<= 9995 X), 28444#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 28420#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 28449#(or (<= 9996 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 28418#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (not (< thread1Thread1of1ForFork0_x 10000))), 28407#(<= 9999 thread2Thread1of1ForFork1_x), 28404#(or (< thread1Thread1of1ForFork0_x 9999) (not (< thread1Thread1of1ForFork0_x 10000))), 28406#(or (<= 9998 thread1Thread1of1ForFork0_x) (< thread1Thread1of1ForFork0_x 9997)), 28440#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 28422#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9999 thread1Thread1of1ForFork0_x)), 28414#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 28409#(<= 9997 thread2Thread1of1ForFork1_x), 28439#(or (< thread1Thread1of1ForFork0_x 9995) (<= 9996 thread1Thread1of1ForFork0_x)), 28445#(or (< thread1Thread1of1ForFork0_x 9995) (<= 9996 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x))), 28411#(<= 9995 thread2Thread1of1ForFork1_x), 28429#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 28403#(< thread1Thread1of1ForFork0_x 10000)] [2022-03-15 22:27:28,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-15 22:27:28,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:27:28,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-15 22:27:28,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=611, Invalid=4501, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 22:27:28,423 INFO L87 Difference]: Start difference. First operand 472 states and 1329 transitions. Second operand has 65 states, 65 states have (on average 2.0615384615384613) internal successors, (134), 65 states have internal predecessors, (134), 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 22:27:38,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:27:38,547 INFO L93 Difference]: Finished difference Result 1214 states and 2744 transitions. [2022-03-15 22:27:38,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 360 states. [2022-03-15 22:27:38,547 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.0615384615384613) internal successors, (134), 65 states have internal predecessors, (134), 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 21 [2022-03-15 22:27:38,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:27:38,551 INFO L225 Difference]: With dead ends: 1214 [2022-03-15 22:27:38,551 INFO L226 Difference]: Without dead ends: 1183 [2022-03-15 22:27:38,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 408 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60741 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=27247, Invalid=140443, Unknown=0, NotChecked=0, Total=167690 [2022-03-15 22:27:38,573 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 390 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 3393 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 3773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 3393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:27:38,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [390 Valid, 24 Invalid, 3773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 3393 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 22:27:38,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2022-03-15 22:27:38,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 377. [2022-03-15 22:27:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 2.5345744680851063) internal successors, (953), 376 states have internal predecessors, (953), 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 22:27:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 953 transitions. [2022-03-15 22:27:38,595 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 953 transitions. Word has length 21 [2022-03-15 22:27:38,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:27:38,595 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 953 transitions. [2022-03-15 22:27:38,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.0615384615384613) internal successors, (134), 65 states have internal predecessors, (134), 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 22:27:38,595 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 953 transitions. [2022-03-15 22:27:38,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 22:27:38,596 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:27:38,596 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:27:38,614 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 22:27:38,796 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,SelfDestructingSolverStorable28 [2022-03-15 22:27:38,797 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:27:38,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:27:38,797 INFO L85 PathProgramCache]: Analyzing trace with hash 277592509, now seen corresponding path program 25 times [2022-03-15 22:27:38,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:27:38,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420792059] [2022-03-15 22:27:38,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:27:38,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:27:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:27:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:38,896 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:27:38,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420792059] [2022-03-15 22:27:38,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420792059] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:27:38,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708197039] [2022-03-15 22:27:38,897 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:27:38,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:27:38,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:27:38,900 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 22:27:38,901 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 22:27:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:27:38,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 22:27:38,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:27:38,958 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:38,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:27:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:39,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708197039] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:27:39,086 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:27:39,087 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2022-03-15 22:27:39,087 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1454054047] [2022-03-15 22:27:39,087 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:27:39,088 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:27:39,090 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 133 transitions. [2022-03-15 22:27:39,091 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:27:40,373 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 55 new interpolants: [31264#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9997 thread1Thread1of1ForFork0_x)), 31258#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9999 thread1Thread1of1ForFork0_x)), 31265#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9997)), 31252#(<= (+ X 1) thread1Thread1of1ForFork0_x), 31247#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 3 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 31254#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9999)), 31282#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9995)), 31272#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9997)), 31274#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9999 thread1Thread1of1ForFork0_x)), 31295#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread2Thread1of1ForFork1_x thread1Thread1of1ForFork0_x)), 31289#(or (not (= X thread1Thread1of1ForFork0_x)) (<= 9995 thread1Thread1of1ForFork0_x)), 31243#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 5 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 31280#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9995 thread1Thread1of1ForFork0_x)), 31287#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9996 thread1Thread1of1ForFork0_x)), 31283#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9999 thread1Thread1of1ForFork0_x)), 31273#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9996)), 31242#(<= X 9994), 31241#(or (<= thread2Thread1of1ForFork1_x 9994) (not (= X thread2Thread1of1ForFork1_x))), 31271#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 31279#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9995 thread1Thread1of1ForFork0_x)), 31250#(<= (+ 2 X) thread1Thread1of1ForFork0_x), 31261#(<= 9997 thread1Thread1of1ForFork0_x), 31257#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 31248#(<= (+ 3 X) thread1Thread1of1ForFork0_x), 31255#(<= 9999 thread1Thread1of1ForFork0_x), 31269#(<= 9996 thread1Thread1of1ForFork0_x), 31284#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9995 thread1Thread1of1ForFork0_x)), 31270#(or (<= 9996 thread1Thread1of1ForFork0_x) (< thread2Thread1of1ForFork1_x 10000)), 31251#(or (<= (+ thread2Thread1of1ForFork1_x 1) thread1Thread1of1ForFork0_x) (not (= X thread2Thread1of1ForFork1_x))), 31286#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9997 thread1Thread1of1ForFork0_x)), 31245#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 4 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 31285#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9998 thread1Thread1of1ForFork0_x)), 31256#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9999 thread1Thread1of1ForFork0_x)), 31292#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread2Thread1of1ForFork1_x 9997) (<= 9995 thread1Thread1of1ForFork0_x)), 31246#(<= (+ X 4) thread1Thread1of1ForFork0_x), 31277#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9996)), 31278#(<= 9995 thread1Thread1of1ForFork0_x), 31281#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9995 thread1Thread1of1ForFork0_x)), 31294#(or (<= thread2Thread1of1ForFork1_x 9995) (not (= X thread1Thread1of1ForFork0_x)) (<= 9995 thread1Thread1of1ForFork0_x)), 31262#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9997 thread1Thread1of1ForFork0_x)), 31288#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9995 thread1Thread1of1ForFork0_x)), 31267#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9997)), 31260#(or (<= 9998 thread1Thread1of1ForFork0_x) (< thread2Thread1of1ForFork1_x 10000)), 31259#(<= 9998 thread1Thread1of1ForFork0_x), 31293#(or (<= thread2Thread1of1ForFork1_x 9996) (not (= X thread1Thread1of1ForFork0_x)) (<= 9995 thread1Thread1of1ForFork0_x)), 31253#(<= 10000 thread1Thread1of1ForFork0_x), 31268#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9997 thread1Thread1of1ForFork0_x)), 31263#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 31244#(<= (+ 5 X) thread1Thread1of1ForFork0_x), 31266#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9999 thread1Thread1of1ForFork0_x)), 31275#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9996)), 31291#(or (<= thread2Thread1of1ForFork1_x 9998) (not (= X thread1Thread1of1ForFork0_x)) (<= 9995 thread1Thread1of1ForFork0_x)), 31249#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 2 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 31290#(or (not (= X thread1Thread1of1ForFork0_x)) (< thread2Thread1of1ForFork1_x 10000) (<= 9995 thread1Thread1of1ForFork0_x)), 31276#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9997 thread1Thread1of1ForFork0_x))] [2022-03-15 22:27:40,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-03-15 22:27:40,373 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:27:40,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-03-15 22:27:40,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1371, Invalid=4481, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 22:27:40,374 INFO L87 Difference]: Start difference. First operand 377 states and 953 transitions. Second operand has 70 states, 70 states have (on average 1.8857142857142857) internal successors, (132), 70 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 22:27:44,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:27:44,979 INFO L93 Difference]: Finished difference Result 1270 states and 3208 transitions. [2022-03-15 22:27:44,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 262 states. [2022-03-15 22:27:44,979 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.8857142857142857) internal successors, (132), 70 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) Word has length 21 [2022-03-15 22:27:44,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:27:44,983 INFO L225 Difference]: With dead ends: 1270 [2022-03-15 22:27:44,983 INFO L226 Difference]: Without dead ends: 1193 [2022-03-15 22:27:44,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42123 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=26428, Invalid=78224, Unknown=0, NotChecked=0, Total=104652 [2022-03-15 22:27:44,989 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 213 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:27:44,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 10 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:27:44,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2022-03-15 22:27:44,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 337. [2022-03-15 22:27:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 2.5416666666666665) internal successors, (854), 336 states have internal predecessors, (854), 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 22:27:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 854 transitions. [2022-03-15 22:27:44,997 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 854 transitions. Word has length 21 [2022-03-15 22:27:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:27:44,997 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 854 transitions. [2022-03-15 22:27:44,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 1.8857142857142857) internal successors, (132), 70 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 22:27:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 854 transitions. [2022-03-15 22:27:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 22:27:44,998 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:27:44,998 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:27:45,013 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 22:27:45,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:27:45,205 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:27:45,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:27:45,206 INFO L85 PathProgramCache]: Analyzing trace with hash 272797054, now seen corresponding path program 26 times [2022-03-15 22:27:45,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:27:45,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210239700] [2022-03-15 22:27:45,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:27:45,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:27:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:27:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:45,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:27:45,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210239700] [2022-03-15 22:27:45,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210239700] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:27:45,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234043552] [2022-03-15 22:27:45,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:27:45,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:27:45,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:27:45,348 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 22:27:45,352 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 22:27:45,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:27:45,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:27:45,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 22:27:45,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:27:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:45,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:27:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:46,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234043552] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:27:46,087 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:27:46,087 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2022-03-15 22:27:46,088 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1536127338] [2022-03-15 22:27:46,088 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:27:46,088 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:27:46,091 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 148 transitions. [2022-03-15 22:27:46,092 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:27:48,042 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 56 new interpolants: [33922#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 33911#(and (or (<= (+ Y thread1Thread1of1ForFork0_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 33918#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9999)))), 33957#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 33913#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 33933#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 33937#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x) 19995)) (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9996)))), 33954#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 33965#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9995)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 33923#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x) 19997))), 33932#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 33948#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9996)))), 33949#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 33917#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 33956#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 33950#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 33945#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9995)))), 33931#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 33916#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x) 19998)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 10000 Y))), 33921#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 33944#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 33951#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 33955#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 33952#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991))), 33958#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 33941#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 33912#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 33938#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 33942#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 33915#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 33934#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 33963#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (= X thread1Thread1of1ForFork0_x)))), 33939#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x) 19994)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 10000 Y))), 33936#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9998)))), 33930#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9997)))), 33962#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (= X thread1Thread1of1ForFork0_x)))), 33924#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9998)))), 33960#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 33929#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x) 19996) (not (< thread1Thread1of1ForFork0_x 9997)))), 33925#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9998)))), 33927#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 33943#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 33964#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 33966#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 33946#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9995)) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 33959#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 33919#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996))), 33926#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 9998)))), 33961#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 33935#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9998)))), 33940#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x) 19994)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 10000 Y) (not (= X thread1Thread1of1ForFork0_x)))), 33953#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9997)))), 33914#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 33920#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 33928#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998)))), 33947#(and (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))))] [2022-03-15 22:27:48,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-03-15 22:27:48,042 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:27:48,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-03-15 22:27:48,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1264, Invalid=9656, Unknown=0, NotChecked=0, Total=10920 [2022-03-15 22:27:48,044 INFO L87 Difference]: Start difference. First operand 337 states and 854 transitions. Second operand has 75 states, 74 states have (on average 1.9054054054054055) internal successors, (141), 74 states have internal predecessors, (141), 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 22:28:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:28:09,364 INFO L93 Difference]: Finished difference Result 1950 states and 5014 transitions. [2022-03-15 22:28:09,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 376 states. [2022-03-15 22:28:09,364 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.9054054054054055) internal successors, (141), 74 states have internal predecessors, (141), 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 22 [2022-03-15 22:28:09,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:28:09,370 INFO L225 Difference]: With dead ends: 1950 [2022-03-15 22:28:09,370 INFO L226 Difference]: Without dead ends: 1946 [2022-03-15 22:28:09,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 15 SyntacticMatches, 10 SemanticMatches, 469 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92620 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=38607, Invalid=182763, Unknown=0, NotChecked=0, Total=221370 [2022-03-15 22:28:09,378 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 225 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 610 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 610 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:28:09,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 12 Invalid, 3324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [610 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 22:28:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2022-03-15 22:28:09,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 428. [2022-03-15 22:28:09,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 2.566744730679157) internal successors, (1096), 427 states have internal predecessors, (1096), 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 22:28:09,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1096 transitions. [2022-03-15 22:28:09,389 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1096 transitions. Word has length 22 [2022-03-15 22:28:09,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:28:09,389 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 1096 transitions. [2022-03-15 22:28:09,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 1.9054054054054055) internal successors, (141), 74 states have internal predecessors, (141), 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 22:28:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1096 transitions. [2022-03-15 22:28:09,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 22:28:09,390 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:28:09,390 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:28:09,406 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 22:28:09,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:28:09,595 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:28:09,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:28:09,596 INFO L85 PathProgramCache]: Analyzing trace with hash 274353874, now seen corresponding path program 27 times [2022-03-15 22:28:09,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:28:09,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447226381] [2022-03-15 22:28:09,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:28:09,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:28:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:28:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:28:09,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:28:09,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447226381] [2022-03-15 22:28:09,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447226381] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:28:09,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158398578] [2022-03-15 22:28:09,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:28:09,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:28:09,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:28:09,782 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 22:28:09,783 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 22:28:09,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:28:09,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:28:09,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 22:28:09,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:28:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-15 22:28:09,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:28:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-15 22:28:10,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158398578] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:28:10,120 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:28:10,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5, 5] total 23 [2022-03-15 22:28:10,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [198937386] [2022-03-15 22:28:10,120 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:28:10,121 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:28:10,124 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 166 transitions. [2022-03-15 22:28:10,124 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:28:11,969 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 57 new interpolants: [37669#(and (or (<= 10000 Y) (not (< X 9995))) (or (<= (+ Y X) 19994) (not (< X 9995)))), 37714#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 37691#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9995)))), 37707#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9998)))), 37703#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (= X thread1Thread1of1ForFork0_x)))), 37702#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (= X thread1Thread1of1ForFork0_x)))), 37701#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9995)) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 37662#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 10000))) (or (<= (+ Y thread2Thread1of1ForFork1_x) 19999) (not (< thread2Thread1of1ForFork1_x 10000)))), 37715#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 37717#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9995)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 37678#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 9998)))), 37687#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 37697#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9997)))), 37713#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 37693#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991))), 37668#(and (or (<= 10000 Y) (not (= X thread2Thread1of1ForFork1_x)) (not (< thread2Thread1of1ForFork1_x 9995))) (or (<= (+ Y thread2Thread1of1ForFork1_x) 19994) (not (= X thread2Thread1of1ForFork1_x)) (not (< thread2Thread1of1ForFork1_x 9995)))), 37704#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 37679#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9997)))), 37682#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 37695#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 37683#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 37665#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19996) (not (< thread2Thread1of1ForFork1_x 9997))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9997)))), 37711#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 37700#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 37684#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 37674#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9999)))), 37681#(and (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 37710#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 37663#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19998) (not (< thread2Thread1of1ForFork1_x 9999))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9999)))), 37686#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 37672#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 37677#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9998)))), 37716#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 37666#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9996))) (or (<= (+ Y thread2Thread1of1ForFork1_x) 19995) (not (< thread2Thread1of1ForFork1_x 9996)))), 37675#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996))), 37705#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 37698#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 37676#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9998)))), 37699#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 37692#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 37670#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 37680#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 37688#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9996)))), 37689#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 37712#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9998)))), 37709#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 37673#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 37690#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 37685#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 37671#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 37696#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998)))), 37718#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 37664#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9998))) (or (not (< thread2Thread1of1ForFork1_x 9998)) (<= (+ Y thread2Thread1of1ForFork1_x) 19997))), 37694#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 37706#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 37667#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19994) (not (< thread2Thread1of1ForFork1_x 9995))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9995)))), 37708#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))))] [2022-03-15 22:28:11,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-03-15 22:28:11,970 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:28:11,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-03-15 22:28:11,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=763, Invalid=5879, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 22:28:11,970 INFO L87 Difference]: Start difference. First operand 428 states and 1096 transitions. Second operand has 76 states, 75 states have (on average 2.013333333333333) internal successors, (151), 75 states have internal predecessors, (151), 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 22:28:37,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:28:37,234 INFO L93 Difference]: Finished difference Result 2310 states and 5571 transitions. [2022-03-15 22:28:37,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 407 states. [2022-03-15 22:28:37,234 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 2.013333333333333) internal successors, (151), 75 states have internal predecessors, (151), 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 22 [2022-03-15 22:28:37,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:28:37,241 INFO L225 Difference]: With dead ends: 2310 [2022-03-15 22:28:37,241 INFO L226 Difference]: Without dead ends: 2265 [2022-03-15 22:28:37,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 483 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98615 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=37333, Invalid=197407, Unknown=0, NotChecked=0, Total=234740 [2022-03-15 22:28:37,249 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 484 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 2846 mSolverCounterSat, 776 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 3622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 776 IncrementalHoareTripleChecker+Valid, 2846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:28:37,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [484 Valid, 15 Invalid, 3622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [776 Valid, 2846 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 22:28:37,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2022-03-15 22:28:37,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 420. [2022-03-15 22:28:37,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 2.4988066825775657) internal successors, (1047), 419 states have internal predecessors, (1047), 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 22:28:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1047 transitions. [2022-03-15 22:28:37,261 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1047 transitions. Word has length 22 [2022-03-15 22:28:37,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:28:37,261 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 1047 transitions. [2022-03-15 22:28:37,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 2.013333333333333) internal successors, (151), 75 states have internal predecessors, (151), 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 22:28:37,261 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1047 transitions. [2022-03-15 22:28:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 22:28:37,262 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:28:37,262 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:28:37,278 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 22:28:37,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:28:37,478 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:28:37,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:28:37,478 INFO L85 PathProgramCache]: Analyzing trace with hash -163405155, now seen corresponding path program 28 times [2022-03-15 22:28:37,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:28:37,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658394010] [2022-03-15 22:28:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:28:37,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:28:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:28:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:28:37,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:28:37,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658394010] [2022-03-15 22:28:37,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658394010] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:28:37,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290449135] [2022-03-15 22:28:37,578 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:28:37,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:28:37,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:28:37,580 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 22:28:37,581 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 22:28:37,607 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:28:37,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:28:37,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:28:37,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:28:37,651 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:28:37,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:28:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:28:37,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290449135] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:28:37,869 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:28:37,869 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 31 [2022-03-15 22:28:37,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [370074135] [2022-03-15 22:28:37,870 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:28:37,870 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:28:37,874 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 163 transitions. [2022-03-15 22:28:37,874 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:28:39,535 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 56 new interpolants: [41869#(or (<= (+ 6 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9995 thread1Thread1of1ForFork0_x)), 41857#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 41861#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 41841#(or (<= thread1Thread1of1ForFork0_x 9995) (<= 9997 thread1Thread1of1ForFork0_x)), 41889#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x))), 41842#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 41892#(or (<= 9995 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 41868#(or (not (= X thread1Thread1of1ForFork0_x)) (<= 9995 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x 9993)), 41865#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 41858#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9999 thread1Thread1of1ForFork0_x)), 41880#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x))), 41883#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9997 thread1Thread1of1ForFork0_x)), 41863#(or (<= 9995 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x 9993)), 41840#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x 9996)), 41844#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 41890#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9997 thread1Thread1of1ForFork0_x)), 41882#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 41881#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 41846#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x 9994)), 41879#(or (not (= X thread1Thread1of1ForFork0_x)) (<= 9995 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 41864#(or (<= (+ 6 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 41891#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9996 thread1Thread1of1ForFork0_x)), 41866#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 41848#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 41867#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 41886#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 41853#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1))), 41877#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 41884#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 41851#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 41860#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 41893#(or (not (= X thread1Thread1of1ForFork0_x)) (<= 9995 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 41847#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 41854#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 41871#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9995 thread1Thread1of1ForFork0_x)), 41874#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 41852#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 41888#(or (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 41843#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 41849#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 41887#(or (<= thread1Thread1of1ForFork0_x (+ 5 thread2Thread1of1ForFork1_x)) (not (< thread1Thread1of1ForFork0_x 10000))), 41856#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 41850#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 41855#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 41875#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9998 thread1Thread1of1ForFork0_x)), 41870#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9995 thread1Thread1of1ForFork0_x)), 41838#(or (<= thread1Thread1of1ForFork0_x 9998) (not (< thread1Thread1of1ForFork0_x 10000))), 41878#(or (<= 9995 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 41872#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9995 thread1Thread1of1ForFork0_x)), 41862#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 41876#(or (<= 9997 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 41839#(or (<= thread1Thread1of1ForFork0_x 9997) (<= 9999 thread1Thread1of1ForFork0_x)), 41885#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 41845#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 41859#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 41873#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (not (< thread1Thread1of1ForFork0_x 10000)))] [2022-03-15 22:28:39,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-03-15 22:28:39,536 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:28:39,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-03-15 22:28:39,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=817, Invalid=6665, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 22:28:39,537 INFO L87 Difference]: Start difference. First operand 420 states and 1047 transitions. Second operand has 73 states, 73 states have (on average 2.041095890410959) internal successors, (149), 73 states have internal predecessors, (149), 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 22:28:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:28:55,521 INFO L93 Difference]: Finished difference Result 2026 states and 4131 transitions. [2022-03-15 22:28:55,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 478 states. [2022-03-15 22:28:55,521 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.041095890410959) internal successors, (149), 73 states have internal predecessors, (149), 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 23 [2022-03-15 22:28:55,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:28:55,546 INFO L225 Difference]: With dead ends: 2026 [2022-03-15 22:28:55,546 INFO L226 Difference]: Without dead ends: 2014 [2022-03-15 22:28:55,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 540 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113755 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=55390, Invalid=237832, Unknown=0, NotChecked=0, Total=293222 [2022-03-15 22:28:55,566 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 445 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 2621 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 3153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 2621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:28:55,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 26 Invalid, 3153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 2621 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:28:55,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2022-03-15 22:28:55,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 654. [2022-03-15 22:28:55,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 2.8192955589586526) internal successors, (1841), 653 states have internal predecessors, (1841), 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 22:28:55,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1841 transitions. [2022-03-15 22:28:55,610 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1841 transitions. Word has length 23 [2022-03-15 22:28:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:28:55,610 INFO L470 AbstractCegarLoop]: Abstraction has 654 states and 1841 transitions. [2022-03-15 22:28:55,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 2.041095890410959) internal successors, (149), 73 states have internal predecessors, (149), 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 22:28:55,613 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1841 transitions. [2022-03-15 22:28:55,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 22:28:55,614 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:28:55,614 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:28:55,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 22:28:55,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:28:55,828 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:28:55,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:28:55,828 INFO L85 PathProgramCache]: Analyzing trace with hash -84987555, now seen corresponding path program 29 times [2022-03-15 22:28:55,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:28:55,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241958266] [2022-03-15 22:28:55,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:28:55,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:28:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:28:55,922 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:28:55,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:28:55,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241958266] [2022-03-15 22:28:55,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241958266] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:28:55,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756600851] [2022-03-15 22:28:55,923 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:28:55,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:28:55,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:28:55,925 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 22:28:55,926 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 22:28:55,950 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 22:28:55,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:28:55,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:28:55,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:28:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:28:55,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:28:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:28:56,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756600851] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:28:56,166 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:28:56,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 31 [2022-03-15 22:28:56,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [352343637] [2022-03-15 22:28:56,166 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:28:56,167 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:28:56,171 INFO L252 McrAutomatonBuilder]: Finished intersection with 105 states and 185 transitions. [2022-03-15 22:28:56,171 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:28:58,407 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 65 new interpolants: [46363#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9995 thread1Thread1of1ForFork0_x)), 46348#(<= 9995 thread2Thread1of1ForFork1_x), 46360#(or (<= 9995 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 46309#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 46311#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1))), 46337#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 46304#(or (< thread1Thread1of1ForFork0_x 9999) (not (< thread1Thread1of1ForFork0_x 10000))), 46326#(or (< thread1Thread1of1ForFork0_x 9994) (<= 9995 thread1Thread1of1ForFork0_x)), 46324#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 46350#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 46306#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 46339#(or (<= 9995 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 46303#(< thread1Thread1of1ForFork0_x 10000), 46352#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9997 thread1Thread1of1ForFork0_x)), 46325#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 46345#(<= 9998 thread2Thread1of1ForFork1_x), 46359#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 46358#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9996 thread1Thread1of1ForFork0_x)), 46320#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 46342#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9995 thread1Thread1of1ForFork0_x)), 46316#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9999 thread1Thread1of1ForFork0_x)), 46327#(or (<= (+ 6 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 46317#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 46341#(or (<= (+ 6 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9995 thread1Thread1of1ForFork0_x)), 46349#(<= 9994 thread2Thread1of1ForFork1_x), 46356#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9997 thread1Thread1of1ForFork0_x)), 46333#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 46305#(or (< thread1Thread1of1ForFork0_x 9998) (<= 9999 thread1Thread1of1ForFork0_x)), 46332#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 46357#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 46312#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 46353#(or (<= thread1Thread1of1ForFork0_x (+ 5 thread2Thread1of1ForFork1_x)) (not (< thread1Thread1of1ForFork0_x 10000))), 46321#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9998 thread1Thread1of1ForFork0_x)), 46307#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 46336#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 46315#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 46318#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 46364#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9995 thread1Thread1of1ForFork0_x)), 46361#(or (<= 9994 thread2Thread1of1ForFork1_x) (not (= X thread2Thread1of1ForFork1_x))), 46355#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x))), 46362#(<= 9994 X), 46334#(or (<= 9997 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 46322#(or (< thread1Thread1of1ForFork0_x 9996) (<= 9997 thread1Thread1of1ForFork0_x)), 46367#(or (not (= X thread1Thread1of1ForFork0_x)) (<= 9995 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 46328#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 46330#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 46346#(<= 9997 thread2Thread1of1ForFork1_x), 46366#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 46354#(or (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 46365#(or (not (= X thread1Thread1of1ForFork0_x)) (<= 9995 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 46351#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 46338#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 46310#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 46313#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (not (< thread1Thread1of1ForFork0_x 10000))), 46329#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 46340#(or (< thread1Thread1of1ForFork0_x 9994) (not (= X thread1Thread1of1ForFork0_x)) (<= 9995 thread1Thread1of1ForFork0_x)), 46331#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 46323#(or (< thread1Thread1of1ForFork0_x 9995) (<= 9996 thread1Thread1of1ForFork0_x)), 46308#(or (<= 9998 thread1Thread1of1ForFork0_x) (< thread1Thread1of1ForFork0_x 9997)), 46314#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 46335#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 46343#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x))), 46319#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 46344#(<= 9999 thread2Thread1of1ForFork1_x), 46347#(<= 9996 thread2Thread1of1ForFork1_x)] [2022-03-15 22:28:58,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-03-15 22:28:58,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:28:58,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-03-15 22:28:58,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1095, Invalid=8025, Unknown=0, NotChecked=0, Total=9120 [2022-03-15 22:28:58,409 INFO L87 Difference]: Start difference. First operand 654 states and 1841 transitions. Second operand has 82 states, 82 states have (on average 2.048780487804878) internal successors, (168), 82 states have internal predecessors, (168), 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 22:29:12,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:29:12,875 INFO L93 Difference]: Finished difference Result 1729 states and 3908 transitions. [2022-03-15 22:29:12,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 475 states. [2022-03-15 22:29:12,875 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 2.048780487804878) internal successors, (168), 82 states have internal predecessors, (168), 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 23 [2022-03-15 22:29:12,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:29:12,878 INFO L225 Difference]: With dead ends: 1729 [2022-03-15 22:29:12,878 INFO L226 Difference]: Without dead ends: 1694 [2022-03-15 22:29:12,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 544 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110466 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=50360, Invalid=247210, Unknown=0, NotChecked=0, Total=297570 [2022-03-15 22:29:12,892 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 489 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 5576 mSolverCounterSat, 645 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 6221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 645 IncrementalHoareTripleChecker+Valid, 5576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:29:12,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 31 Invalid, 6221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [645 Valid, 5576 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 22:29:12,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2022-03-15 22:29:12,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 518. [2022-03-15 22:29:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 2.5357833655705995) internal successors, (1311), 517 states have internal predecessors, (1311), 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 22:29:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1311 transitions. [2022-03-15 22:29:12,901 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1311 transitions. Word has length 23 [2022-03-15 22:29:12,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:29:12,902 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 1311 transitions. [2022-03-15 22:29:12,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 2.048780487804878) internal successors, (168), 82 states have internal predecessors, (168), 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 22:29:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1311 transitions. [2022-03-15 22:29:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 22:29:12,903 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:29:12,903 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:29:12,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 22:29:13,119 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,SelfDestructingSolverStorable33 [2022-03-15 22:29:13,119 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:29:13,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:29:13,119 INFO L85 PathProgramCache]: Analyzing trace with hash -745472225, now seen corresponding path program 30 times [2022-03-15 22:29:13,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:29:13,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000776563] [2022-03-15 22:29:13,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:29:13,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:29:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:29:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:29:13,221 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:29:13,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000776563] [2022-03-15 22:29:13,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000776563] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:29:13,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095668590] [2022-03-15 22:29:13,221 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:29:13,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:29:13,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:29:13,222 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 22:29:13,240 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 22:29:13,262 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 22:29:13,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:29:13,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 22:29:13,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:29:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-15 22:29:13,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:29:13,572 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-15 22:29:13,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095668590] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:29:13,572 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:29:13,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5, 5] total 25 [2022-03-15 22:29:13,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1284479883] [2022-03-15 22:29:13,573 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:29:13,573 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:29:13,577 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 167 transitions. [2022-03-15 22:29:13,577 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:29:15,077 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 71 new interpolants: [50231#(or (<= thread2Thread1of1ForFork1_x 9996) (not (= X thread1Thread1of1ForFork0_x)) (<= 9994 thread1Thread1of1ForFork0_x)), 50211#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9997 thread1Thread1of1ForFork0_x)), 50210#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 50209#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9999 thread1Thread1of1ForFork0_x)), 50259#(or (<= (+ thread2Thread1of1ForFork1_x 1) thread1Thread1of1ForFork0_x) (not (= X thread2Thread1of1ForFork1_x))), 50256#(<= (+ X 4) thread1Thread1of1ForFork0_x), 50197#(or (<= 9998 thread1Thread1of1ForFork0_x) (< thread2Thread1of1ForFork1_x 10000)), 50217#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9999 thread1Thread1of1ForFork0_x)), 50228#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9996)), 50237#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9995 thread1Thread1of1ForFork0_x)), 50226#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9996)), 50239#(or (<= thread2Thread1of1ForFork1_x 9995) (not (= X thread1Thread1of1ForFork0_x)) (<= 9994 thread1Thread1of1ForFork0_x)), 50246#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 5 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 50212#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 50241#(<= X 9993), 50249#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 2 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 50201#(or (<= 9996 thread1Thread1of1ForFork0_x) (< thread2Thread1of1ForFork1_x 10000)), 50229#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9995 thread1Thread1of1ForFork0_x)), 50260#(<= (+ X 1) thread1Thread1of1ForFork0_x), 50193#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9999)), 50196#(<= 9998 thread1Thread1of1ForFork0_x), 50225#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9999 thread1Thread1of1ForFork0_x)), 50248#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 3 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 50214#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9994 thread1Thread1of1ForFork0_x)), 50222#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9994 thread1Thread1of1ForFork0_x)), 50236#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9996 thread1Thread1of1ForFork0_x)), 50215#(or (<= thread2Thread1of1ForFork1_x 9998) (not (= X thread1Thread1of1ForFork0_x)) (<= 9994 thread1Thread1of1ForFork0_x)), 50199#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9997 thread1Thread1of1ForFork0_x)), 50216#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9997)), 50220#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9997)), 50254#(<= (+ 6 X) thread1Thread1of1ForFork0_x), 50206#(or (not (= X thread1Thread1of1ForFork0_x)) (<= 9994 thread1Thread1of1ForFork0_x)), 50257#(<= (+ 3 X) thread1Thread1of1ForFork0_x), 50262#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread2Thread1of1ForFork1_x thread1Thread1of1ForFork0_x)), 50194#(<= 9999 thread1Thread1of1ForFork0_x), 50242#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 10000 thread1Thread1of1ForFork0_x)), 50240#(or (not (= X thread2Thread1of1ForFork1_x)) (<= thread2Thread1of1ForFork1_x 9993)), 50219#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9997 thread1Thread1of1ForFork0_x)), 50234#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9998 thread1Thread1of1ForFork0_x)), 50195#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9999 thread1Thread1of1ForFork0_x)), 50204#(<= 9994 thread1Thread1of1ForFork0_x), 50192#(<= 10000 thread1Thread1of1ForFork0_x), 50238#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9994 thread1Thread1of1ForFork0_x)), 50221#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9995 thread1Thread1of1ForFork0_x)), 50218#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9997)), 50245#(or (<= (+ 6 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x) (not (= X thread2Thread1of1ForFork1_x))), 50224#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9996)), 50243#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9999 thread1Thread1of1ForFork0_x)), 50227#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9997 thread1Thread1of1ForFork0_x)), 50205#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9994 thread1Thread1of1ForFork0_x)), 50235#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9997 thread1Thread1of1ForFork0_x)), 50251#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9996 thread1Thread1of1ForFork0_x)), 50230#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9994 thread1Thread1of1ForFork0_x)), 50233#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9999 thread1Thread1of1ForFork0_x)), 50203#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9995 thread1Thread1of1ForFork0_x)), 50253#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9994 thread1Thread1of1ForFork0_x)), 50250#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9997 thread1Thread1of1ForFork0_x)), 50200#(<= 9996 thread1Thread1of1ForFork0_x), 50252#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9995 thread1Thread1of1ForFork0_x)), 50255#(<= (+ 5 X) thread1Thread1of1ForFork0_x), 50208#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 50261#(or (<= thread2Thread1of1ForFork1_x 9994) (not (= X thread1Thread1of1ForFork0_x)) (<= 9994 thread1Thread1of1ForFork0_x)), 50198#(<= 9997 thread1Thread1of1ForFork0_x), 50258#(<= (+ 2 X) thread1Thread1of1ForFork0_x), 50202#(<= 9995 thread1Thread1of1ForFork0_x), 50244#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9998 thread1Thread1of1ForFork0_x)), 50207#(or (not (= X thread1Thread1of1ForFork0_x)) (< thread2Thread1of1ForFork1_x 10000) (<= 9994 thread1Thread1of1ForFork0_x)), 50247#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 4 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 50223#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread2Thread1of1ForFork1_x 9997) (<= 9994 thread1Thread1of1ForFork0_x)), 50232#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9995)), 50213#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9995 thread1Thread1of1ForFork0_x))] [2022-03-15 22:29:15,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-03-15 22:29:15,078 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:29:15,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-03-15 22:29:15,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1855, Invalid=7265, Unknown=0, NotChecked=0, Total=9120 [2022-03-15 22:29:15,080 INFO L87 Difference]: Start difference. First operand 518 states and 1311 transitions. Second operand has 88 states, 88 states have (on average 1.8863636363636365) internal successors, (166), 88 states have internal predecessors, (166), 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 22:29:23,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:29:23,789 INFO L93 Difference]: Finished difference Result 1904 states and 4872 transitions. [2022-03-15 22:29:23,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 375 states. [2022-03-15 22:29:23,790 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 1.8863636363636365) internal successors, (166), 88 states have internal predecessors, (166), 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 23 [2022-03-15 22:29:23,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:29:23,793 INFO L225 Difference]: With dead ends: 1904 [2022-03-15 22:29:23,793 INFO L226 Difference]: Without dead ends: 1792 [2022-03-15 22:29:23,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 452 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85965 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=49673, Invalid=155989, Unknown=0, NotChecked=0, Total=205662 [2022-03-15 22:29:23,804 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 252 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 541 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 2679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 541 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:29:23,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 9 Invalid, 2679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [541 Valid, 2138 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:29:23,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2022-03-15 22:29:23,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 459. [2022-03-15 22:29:23,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 2.5436681222707422) internal successors, (1165), 458 states have internal predecessors, (1165), 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 22:29:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1165 transitions. [2022-03-15 22:29:23,815 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 1165 transitions. Word has length 23 [2022-03-15 22:29:23,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:29:23,815 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 1165 transitions. [2022-03-15 22:29:23,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 1.8863636363636365) internal successors, (166), 88 states have internal predecessors, (166), 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 22:29:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 1165 transitions. [2022-03-15 22:29:23,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 22:29:23,816 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:29:23,816 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:29:23,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-03-15 22:29:24,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:29:24,031 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:29:24,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:29:24,031 INFO L85 PathProgramCache]: Analyzing trace with hash 898667294, now seen corresponding path program 31 times [2022-03-15 22:29:24,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:29:24,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992577433] [2022-03-15 22:29:24,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:29:24,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:29:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:29:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 21 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:29:24,221 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:29:24,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992577433] [2022-03-15 22:29:24,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992577433] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:29:24,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113572773] [2022-03-15 22:29:24,221 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:29:24,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:29:24,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:29:24,223 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 22:29:24,223 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 22:29:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:29:24,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:29:24,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:29:24,505 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 21 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:29:24,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:29:25,001 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:29:25,002 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113572773] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:29:25,002 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:29:25,002 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 53 [2022-03-15 22:29:25,002 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1712663926] [2022-03-15 22:29:25,002 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:29:25,003 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:29:25,007 INFO L252 McrAutomatonBuilder]: Finished intersection with 105 states and 184 transitions. [2022-03-15 22:29:25,007 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:29:27,775 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 72 new interpolants: [54058#(and (or (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)))), 54026#(and (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (= X thread1Thread1of1ForFork0_x))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)))), 54004#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 54036#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998)))), 54013#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 54017#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 54019#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 9998)))), 54001#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x) 19994)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 10000 Y))), 54061#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 54030#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 54027#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)))), 54040#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 54035#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 54010#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 54038#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 54067#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)))), 54022#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 53999#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x) 19996) (not (< thread1Thread1of1ForFork0_x 9997)))), 54046#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 53996#(and (or (<= (+ Y thread1Thread1of1ForFork0_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 54063#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 54064#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 54039#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 54051#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 54066#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9994)))), 54015#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9995)))), 54006#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9997)))), 54000#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x) 19995)) (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9996)))), 54005#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9998)))), 54042#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9998)))), 54028#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 54014#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 54012#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9998)))), 54007#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 54045#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 54024#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x))) (or (<= (+ Y thread1Thread1of1ForFork0_x) 19993) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)))), 54033#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991))), 54029#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 54023#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 53998#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x) 19997))), 54008#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 54037#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9997)))), 54049#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 54018#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996))), 54025#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)))), 54050#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 54021#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9996)))), 54059#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)))), 54020#(and (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 54060#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 54056#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)))), 54011#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9999)))), 53997#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x) 19998)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 10000 Y))), 54065#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9995)))), 54009#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 54048#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9998)))), 54053#(and (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 54055#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9994)))), 54003#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 54057#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 54043#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 54034#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 54054#(and (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 54062#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998)))), 54047#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 54052#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 54031#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 54041#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 54032#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 54016#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 54044#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 54002#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= (+ Y thread1Thread1of1ForFork0_x) 19993) (not (< thread1Thread1of1ForFork0_x 9994))))] [2022-03-15 22:29:27,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-03-15 22:29:27,776 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:29:27,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-03-15 22:29:27,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1824, Invalid=14178, Unknown=0, NotChecked=0, Total=16002 [2022-03-15 22:29:27,777 INFO L87 Difference]: Start difference. First operand 459 states and 1165 transitions. Second operand has 93 states, 92 states have (on average 1.9130434782608696) internal successors, (176), 92 states have internal predecessors, (176), 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 22:30:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:30:06,751 INFO L93 Difference]: Finished difference Result 3309 states and 8540 transitions. [2022-03-15 22:30:06,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 566 states. [2022-03-15 22:30:06,751 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 92 states have (on average 1.9130434782608696) internal successors, (176), 92 states have internal predecessors, (176), 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 24 [2022-03-15 22:30:06,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:30:06,756 INFO L225 Difference]: With dead ends: 3309 [2022-03-15 22:30:06,756 INFO L226 Difference]: Without dead ends: 3305 [2022-03-15 22:30:06,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 16 SyntacticMatches, 11 SemanticMatches, 680 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205460 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=78277, Invalid=386165, Unknown=0, NotChecked=0, Total=464442 [2022-03-15 22:30:06,773 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 314 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 3264 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 4322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 3264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:30:06,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 12 Invalid, 4322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 3264 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 22:30:06,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2022-03-15 22:30:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 576. [2022-03-15 22:30:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 2.5617391304347827) internal successors, (1473), 575 states have internal predecessors, (1473), 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 22:30:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1473 transitions. [2022-03-15 22:30:06,802 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1473 transitions. Word has length 24 [2022-03-15 22:30:06,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:30:06,802 INFO L470 AbstractCegarLoop]: Abstraction has 576 states and 1473 transitions. [2022-03-15 22:30:06,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 92 states have (on average 1.9130434782608696) internal successors, (176), 92 states have internal predecessors, (176), 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 22:30:06,802 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1473 transitions. [2022-03-15 22:30:06,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 22:30:06,803 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:30:06,803 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:30:06,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 22:30:07,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:30:07,021 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:30:07,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:30:07,021 INFO L85 PathProgramCache]: Analyzing trace with hash 900224114, now seen corresponding path program 32 times [2022-03-15 22:30:07,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:30:07,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351232888] [2022-03-15 22:30:07,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:30:07,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:30:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:30:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 21 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:30:07,168 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:30:07,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351232888] [2022-03-15 22:30:07,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351232888] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:30:07,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866376427] [2022-03-15 22:30:07,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:30:07,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:30:07,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:30:07,169 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:30:07,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 22:30:07,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:30:07,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:30:07,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:30:07,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:30:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 21 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:30:07,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:30:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:30:07,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866376427] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:30:07,994 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:30:07,994 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 53 [2022-03-15 22:30:07,994 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1941718456] [2022-03-15 22:30:07,995 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:30:07,997 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:30:08,001 INFO L252 McrAutomatonBuilder]: Finished intersection with 115 states and 204 transitions. [2022-03-15 22:30:08,002 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:30:10,819 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 73 new interpolants: [59870#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 59895#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 59856#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9999)))), 59866#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 9998)))), 59843#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 59886#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 59909#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9995)))), 59868#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9996)))), 59890#(and (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 59850#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9996))) (or (<= (+ Y thread2Thread1of1ForFork1_x) 19995) (not (< thread2Thread1of1ForFork1_x 9996)))), 59883#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 59839#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 59859#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 59849#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19996) (not (< thread2Thread1of1ForFork1_x 9997))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9997)))), 59905#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)))), 59864#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 59897#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 59865#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996))), 59853#(and (or (<= 10000 Y) (not (= X thread2Thread1of1ForFork1_x)) (not (< thread2Thread1of1ForFork1_x 9994))) (or (<= (+ Y thread2Thread1of1ForFork1_x) 19993) (not (= X thread2Thread1of1ForFork1_x)) (not (< thread2Thread1of1ForFork1_x 9994)))), 59860#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 59875#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 59877#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991))), 59903#(and (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (= X thread1Thread1of1ForFork0_x))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)))), 59896#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9994)))), 59906#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 59842#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9997)))), 59894#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 59851#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19994) (not (< thread2Thread1of1ForFork1_x 9995))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9995)))), 59855#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 59891#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 59846#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 10000))) (or (<= (+ Y thread2Thread1of1ForFork1_x) 19999) (not (< thread2Thread1of1ForFork1_x 10000)))), 59863#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 59907#(and (or (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)))), 59848#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9998))) (or (not (< thread2Thread1of1ForFork1_x 9998)) (<= (+ Y thread2Thread1of1ForFork1_x) 19997))), 59911#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)))), 59873#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 59845#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 59847#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19998) (not (< thread2Thread1of1ForFork1_x 9999))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9999)))), 59871#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 59879#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 59878#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 59869#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9995)))), 59885#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9998)))), 59880#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998)))), 59874#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 59887#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 59861#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 59852#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19993) (not (< thread2Thread1of1ForFork1_x 9994))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9994)))), 59900#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)))), 59898#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 59908#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)))), 59841#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9998)))), 59902#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 59881#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9997)))), 59882#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 59899#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998)))), 59858#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 59893#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 59892#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9998)))), 59872#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 59867#(and (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 59889#(and (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 59910#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9994)))), 59884#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 59901#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 59888#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 59862#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 59840#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 59854#(and (or (not (< X 9994)) (<= (+ Y X) 19993)) (or (<= 10000 Y) (not (< X 9994)))), 59904#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9994)) (not (= X thread1Thread1of1ForFork0_x)))), 59844#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 59876#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 59857#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9998))))] [2022-03-15 22:30:10,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2022-03-15 22:30:10,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:30:10,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2022-03-15 22:30:10,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1823, Invalid=14433, Unknown=0, NotChecked=0, Total=16256 [2022-03-15 22:30:10,820 INFO L87 Difference]: Start difference. First operand 576 states and 1473 transitions. Second operand has 94 states, 93 states have (on average 2.010752688172043) internal successors, (187), 93 states have internal predecessors, (187), 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 22:30:51,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:30:51,698 INFO L93 Difference]: Finished difference Result 3850 states and 9371 transitions. [2022-03-15 22:30:51,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 605 states. [2022-03-15 22:30:51,698 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 93 states have (on average 2.010752688172043) internal successors, (187), 93 states have internal predecessors, (187), 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 24 [2022-03-15 22:30:51,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:30:51,704 INFO L225 Difference]: With dead ends: 3850 [2022-03-15 22:30:51,704 INFO L226 Difference]: Without dead ends: 3791 [2022-03-15 22:30:51,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 25 SyntacticMatches, 11 SemanticMatches, 720 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229665 ImplicationChecksByTransitivity, 40.3s TimeCoverageRelationStatistics Valid=80224, Invalid=440338, Unknown=0, NotChecked=0, Total=520562 [2022-03-15 22:30:51,722 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 750 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 3490 mSolverCounterSat, 1162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 4652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1162 IncrementalHoareTripleChecker+Valid, 3490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:30:51,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [750 Valid, 16 Invalid, 4652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1162 Valid, 3490 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 22:30:51,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3791 states. [2022-03-15 22:30:51,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3791 to 566. [2022-03-15 22:30:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 2.4973451327433627) internal successors, (1411), 565 states have internal predecessors, (1411), 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 22:30:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1411 transitions. [2022-03-15 22:30:51,799 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 1411 transitions. Word has length 24 [2022-03-15 22:30:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:30:51,799 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 1411 transitions. [2022-03-15 22:30:51,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 93 states have (on average 2.010752688172043) internal successors, (187), 93 states have internal predecessors, (187), 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 22:30:51,799 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1411 transitions. [2022-03-15 22:30:51,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:30:51,800 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:30:51,800 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:30:51,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 22:30:52,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 22:30:52,001 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:30:52,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:30:52,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2058703101, now seen corresponding path program 33 times [2022-03-15 22:30:52,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:30:52,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745026176] [2022-03-15 22:30:52,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:30:52,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:30:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:30:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:30:52,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:30:52,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745026176] [2022-03-15 22:30:52,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745026176] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:30:52,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497522596] [2022-03-15 22:30:52,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:30:52,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:30:52,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:30:52,121 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:30:52,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 22:30:52,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:30:52,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:30:52,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 22:30:52,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:30:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-03-15 22:30:52,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:30:52,412 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-03-15 22:30:52,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497522596] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:30:52,413 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:30:52,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5, 5] total 27 [2022-03-15 22:30:52,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1740530573] [2022-03-15 22:30:52,413 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:30:52,414 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:30:52,418 INFO L252 McrAutomatonBuilder]: Finished intersection with 114 states and 201 transitions. [2022-03-15 22:30:52,419 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:30:54,314 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 72 new interpolants: [66264#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 66317#(or (<= (+ 7 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9994 thread1Thread1of1ForFork0_x)), 66299#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9996 thread1Thread1of1ForFork0_x)), 66312#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9996 thread1Thread1of1ForFork0_x)), 66280#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 66308#(or (<= thread1Thread1of1ForFork0_x (+ 6 thread2Thread1of1ForFork1_x)) (<= 10000 thread1Thread1of1ForFork0_x)), 66277#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9998 thread1Thread1of1ForFork0_x)), 66270#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x 9996)), 66263#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 66275#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (not (< thread1Thread1of1ForFork0_x 10000))), 66301#(or (<= (+ 6 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 66297#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x))), 66305#(or (<= 9995 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 66329#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 66285#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 66261#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 66326#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9994 thread1Thread1of1ForFork0_x)), 66274#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 66315#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread1Thread1of1ForFork0_x 9992) (<= 9994 thread1Thread1of1ForFork0_x)), 66287#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9997 thread1Thread1of1ForFork0_x)), 66309#(or (<= thread1Thread1of1ForFork0_x (+ 5 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 66320#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 66303#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 66282#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 66283#(or (<= 9997 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 66328#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9994 thread1Thread1of1ForFork0_x)), 66296#(or (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 66306#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 66268#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 66318#(or (<= (+ 6 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 66298#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9997 thread1Thread1of1ForFork0_x)), 66310#(or (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x)) (<= 9998 thread1Thread1of1ForFork0_x)), 66272#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 66281#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 66267#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 66289#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 66330#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 66284#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x))), 66292#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 66300#(or (<= 9995 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x 9993)), 66294#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 66271#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 66273#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 66279#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 66262#(or (<= thread1Thread1of1ForFork0_x 9997) (<= 9999 thread1Thread1of1ForFork0_x)), 66316#(or (<= (+ 7 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 66314#(or (<= thread1Thread1of1ForFork0_x 9992) (<= 9994 thread1Thread1of1ForFork0_x)), 66331#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 66313#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9995 thread1Thread1of1ForFork0_x)), 66307#(or (<= 9995 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 66302#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 66290#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 66304#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 66288#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x 9994)), 66295#(or (<= thread1Thread1of1ForFork0_x (+ 5 thread2Thread1of1ForFork1_x)) (not (< thread1Thread1of1ForFork0_x 10000))), 66323#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 66278#(or (<= thread1Thread1of1ForFork0_x 9995) (<= 9997 thread1Thread1of1ForFork0_x)), 66319#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 66293#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 66325#(or (<= (+ 6 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9994 thread1Thread1of1ForFork0_x)), 66327#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9994 thread1Thread1of1ForFork0_x)), 66286#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 66291#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 66321#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 66311#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (<= 9997 thread1Thread1of1ForFork0_x)), 66269#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9999 thread1Thread1of1ForFork0_x)), 66260#(or (<= thread1Thread1of1ForFork0_x 9998) (not (< thread1Thread1of1ForFork0_x 10000))), 66266#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1))), 66324#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 66265#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 66322#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 66276#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x))] [2022-03-15 22:30:54,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-03-15 22:30:54,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:30:54,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-03-15 22:30:54,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1068, Invalid=8634, Unknown=0, NotChecked=0, Total=9702 [2022-03-15 22:30:54,317 INFO L87 Difference]: Start difference. First operand 566 states and 1411 transitions. Second operand has 91 states, 91 states have (on average 2.032967032967033) internal successors, (185), 91 states have internal predecessors, (185), 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 22:31:20,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:31:20,268 INFO L93 Difference]: Finished difference Result 2849 states and 5728 transitions. [2022-03-15 22:31:20,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 638 states. [2022-03-15 22:31:20,268 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 2.032967032967033) internal successors, (185), 91 states have internal predecessors, (185), 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 25 [2022-03-15 22:31:20,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:31:20,272 INFO L225 Difference]: With dead ends: 2849 [2022-03-15 22:31:20,272 INFO L226 Difference]: Without dead ends: 2834 [2022-03-15 22:31:20,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 709 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204825 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=90913, Invalid=413897, Unknown=0, NotChecked=0, Total=504810 [2022-03-15 22:31:20,291 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 464 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 4063 mSolverCounterSat, 753 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 4816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 753 IncrementalHoareTripleChecker+Valid, 4063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:31:20,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [464 Valid, 31 Invalid, 4816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [753 Valid, 4063 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 22:31:20,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2022-03-15 22:31:20,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 871. [2022-03-15 22:31:20,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 2.810344827586207) internal successors, (2445), 870 states have internal predecessors, (2445), 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 22:31:20,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2445 transitions. [2022-03-15 22:31:20,307 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 2445 transitions. Word has length 25 [2022-03-15 22:31:20,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:31:20,307 INFO L470 AbstractCegarLoop]: Abstraction has 871 states and 2445 transitions. [2022-03-15 22:31:20,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 2.032967032967033) internal successors, (185), 91 states have internal predecessors, (185), 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 22:31:20,307 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 2445 transitions. [2022-03-15 22:31:20,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:31:20,308 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:31:20,308 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:31:20,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 22:31:20,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 22:31:20,523 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:31:20,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:31:20,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2137120701, now seen corresponding path program 34 times [2022-03-15 22:31:20,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:31:20,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310044969] [2022-03-15 22:31:20,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:31:20,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:31:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:31:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:31:20,661 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:31:20,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310044969] [2022-03-15 22:31:20,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310044969] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:31:20,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604002097] [2022-03-15 22:31:20,661 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:31:20,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:31:20,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:31:20,662 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:31:20,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 22:31:20,685 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:31:20,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:31:20,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 22:31:20,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:31:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:31:20,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:31:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:31:21,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604002097] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:31:21,083 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:31:21,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 35 [2022-03-15 22:31:21,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2097545100] [2022-03-15 22:31:21,083 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:31:21,084 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:31:21,089 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 225 transitions. [2022-03-15 22:31:21,089 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:31:23,435 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 82 new interpolants: [72390#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 72338#(or (< thread1Thread1of1ForFork0_x 9999) (not (< thread1Thread1of1ForFork0_x 10000))), 72387#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 72405#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9994 thread1Thread1of1ForFork0_x)), 72386#(or (<= (+ 7 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 72332#(<= 9995 thread2Thread1of1ForFork1_x), 72334#(<= 9993 thread2Thread1of1ForFork1_x), 72367#(or (<= 9997 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 72372#(or (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x)) (<= 9998 thread1Thread1of1ForFork0_x)), 72382#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9996 thread1Thread1of1ForFork0_x)), 72339#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 72373#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (<= 9997 thread1Thread1of1ForFork0_x)), 72398#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 72379#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 72341#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1))), 72392#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 72354#(or (<= 9998 thread1Thread1of1ForFork0_x) (< thread1Thread1of1ForFork0_x 9997)), 72365#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 72366#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 72349#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9999 thread1Thread1of1ForFork0_x)), 72407#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 72353#(or (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 72361#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x))), 72393#(or (<= 9995 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 72391#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 72336#(<= 9993 X), 72342#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 72406#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9994 thread1Thread1of1ForFork0_x)), 72335#(or (<= 9993 thread2Thread1of1ForFork1_x) (not (= X thread2Thread1of1ForFork1_x))), 72375#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 72346#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 72350#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 72400#(or (not (= X thread1Thread1of1ForFork0_x)) (< thread1Thread1of1ForFork0_x 9993) (<= 9994 thread1Thread1of1ForFork0_x)), 72397#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 72345#(or (< thread1Thread1of1ForFork0_x 9998) (<= 9999 thread1Thread1of1ForFork0_x)), 72381#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9996 thread1Thread1of1ForFork0_x)), 72358#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 72401#(or (<= (+ 7 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9994 thread1Thread1of1ForFork0_x)), 72331#(<= 9996 thread2Thread1of1ForFork1_x), 72355#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 72368#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9997 thread1Thread1of1ForFork0_x)), 72374#(or (< thread1Thread1of1ForFork0_x 9995) (<= 9996 thread1Thread1of1ForFork0_x)), 72389#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 72408#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 72384#(or (<= (+ 6 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 72371#(or (<= thread1Thread1of1ForFork0_x (+ 5 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 72352#(or (<= thread1Thread1of1ForFork0_x (+ 5 thread2Thread1of1ForFork1_x)) (not (< thread1Thread1of1ForFork0_x 10000))), 72359#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9998 thread1Thread1of1ForFork0_x)), 72362#(or (< thread1Thread1of1ForFork0_x 9996) (<= 9997 thread1Thread1of1ForFork0_x)), 72402#(or (<= (+ 6 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9994 thread1Thread1of1ForFork0_x)), 72328#(<= 9999 thread2Thread1of1ForFork1_x), 72409#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 72351#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 72370#(or (<= thread1Thread1of1ForFork0_x (+ 6 thread2Thread1of1ForFork1_x)) (<= 10000 thread1Thread1of1ForFork0_x)), 72403#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9994 thread1Thread1of1ForFork0_x)), 72385#(or (< thread1Thread1of1ForFork0_x 9993) (<= 9994 thread1Thread1of1ForFork0_x)), 72363#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 72348#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 72360#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 72343#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (not (< thread1Thread1of1ForFork0_x 10000))), 72380#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 72399#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 72344#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x))), 72396#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9995 thread1Thread1of1ForFork0_x)), 72329#(<= 9998 thread2Thread1of1ForFork1_x), 72377#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 72356#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 72340#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 72369#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9997 thread1Thread1of1ForFork0_x)), 72347#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 72395#(or (<= 9995 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 72394#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 72364#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 72376#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 72378#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 72383#(or (< thread1Thread1of1ForFork0_x 9994) (<= 9995 thread1Thread1of1ForFork0_x)), 72337#(< thread1Thread1of1ForFork0_x 10000), 72333#(<= 9994 thread2Thread1of1ForFork1_x), 72388#(or (<= (+ 6 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 72330#(<= 9997 thread2Thread1of1ForFork1_x), 72404#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 72357#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x))] [2022-03-15 22:31:23,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-03-15 22:31:23,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:31:23,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-03-15 22:31:23,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1600, Invalid=11972, Unknown=0, NotChecked=0, Total=13572 [2022-03-15 22:31:23,437 INFO L87 Difference]: Start difference. First operand 871 states and 2445 transitions. Second operand has 101 states, 101 states have (on average 2.0396039603960396) internal successors, (206), 101 states have internal predecessors, (206), 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 22:31:45,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:31:45,075 INFO L93 Difference]: Finished difference Result 2368 states and 5343 transitions. [2022-03-15 22:31:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 606 states. [2022-03-15 22:31:45,075 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 2.0396039603960396) internal successors, (206), 101 states have internal predecessors, (206), 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 25 [2022-03-15 22:31:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:31:45,078 INFO L225 Difference]: With dead ends: 2368 [2022-03-15 22:31:45,078 INFO L226 Difference]: Without dead ends: 2329 [2022-03-15 22:31:45,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 693 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182015 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=80240, Invalid=402090, Unknown=0, NotChecked=0, Total=482330 [2022-03-15 22:31:45,092 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 556 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 6940 mSolverCounterSat, 701 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 7641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 701 IncrementalHoareTripleChecker+Valid, 6940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:31:45,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [556 Valid, 33 Invalid, 7641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [701 Valid, 6940 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 22:31:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2022-03-15 22:31:45,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 687. [2022-03-15 22:31:45,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 2.5306122448979593) internal successors, (1736), 686 states have internal predecessors, (1736), 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 22:31:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1736 transitions. [2022-03-15 22:31:45,117 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1736 transitions. Word has length 25 [2022-03-15 22:31:45,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:31:45,117 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 1736 transitions. [2022-03-15 22:31:45,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 2.0396039603960396) internal successors, (206), 101 states have internal predecessors, (206), 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 22:31:45,118 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1736 transitions. [2022-03-15 22:31:45,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:31:45,118 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:31:45,119 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:31:45,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 22:31:45,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 22:31:45,332 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:31:45,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:31:45,332 INFO L85 PathProgramCache]: Analyzing trace with hash 481800637, now seen corresponding path program 35 times [2022-03-15 22:31:45,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:31:45,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434926374] [2022-03-15 22:31:45,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:31:45,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:31:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:31:45,437 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:31:45,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:31:45,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434926374] [2022-03-15 22:31:45,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434926374] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:31:45,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818983102] [2022-03-15 22:31:45,438 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:31:45,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:31:45,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:31:45,439 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:31:45,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 22:31:45,475 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 22:31:45,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:31:45,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 22:31:45,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:31:45,512 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:31:45,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:31:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:31:45,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818983102] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:31:45,660 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:31:45,661 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2022-03-15 22:31:45,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [567705729] [2022-03-15 22:31:45,661 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:31:45,662 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:31:45,666 INFO L252 McrAutomatonBuilder]: Finished intersection with 116 states and 205 transitions. [2022-03-15 22:31:45,666 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:31:47,113 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 89 new interpolants: [77500#(<= 9994 thread1Thread1of1ForFork0_x), 77511#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9996)), 77490#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 77520#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 3 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 77498#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 77503#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9997)), 77542#(or (<= 9997 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9993)), 77494#(or (<= 9996 thread1Thread1of1ForFork0_x) (< thread2Thread1of1ForFork1_x 10000)), 77550#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9993 thread1Thread1of1ForFork0_x)), 77551#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9993 thread1Thread1of1ForFork0_x)), 77557#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread2Thread1of1ForFork1_x 9997) (<= 9993 thread1Thread1of1ForFork0_x)), 77516#(or (<= (+ 7 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x) (not (= X thread2Thread1of1ForFork1_x))), 77526#(<= (+ 3 X) thread1Thread1of1ForFork0_x), 77509#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9993 thread1Thread1of1ForFork0_x)), 77556#(or (<= thread2Thread1of1ForFork1_x 9998) (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x)), 77493#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9997 thread1Thread1of1ForFork0_x)), 77532#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9999 thread1Thread1of1ForFork0_x)), 77491#(<= 9997 thread1Thread1of1ForFork0_x), 77534#(or (<= thread2Thread1of1ForFork1_x 9993) (<= 9999 thread1Thread1of1ForFork0_x)), 77536#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9998 thread1Thread1of1ForFork0_x)), 77519#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 4 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 77527#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 2 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 77522#(<= (+ 7 X) thread1Thread1of1ForFork0_x), 77543#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9997)), 77562#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9994 thread1Thread1of1ForFork0_x)), 77533#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9999 thread1Thread1of1ForFork0_x)), 77506#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9997 thread1Thread1of1ForFork0_x)), 77563#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9993 thread1Thread1of1ForFork0_x)), 77492#(<= 9996 thread1Thread1of1ForFork0_x), 77568#(or (<= 9993 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9993)), 77559#(or (<= thread2Thread1of1ForFork1_x 9995) (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x)), 77486#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9999 thread1Thread1of1ForFork0_x)), 77548#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9994 thread1Thread1of1ForFork0_x)), 77552#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9996 thread1Thread1of1ForFork0_x)), 77495#(<= 9995 thread1Thread1of1ForFork0_x), 77547#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9995 thread1Thread1of1ForFork0_x)), 77507#(<= 9993 thread1Thread1of1ForFork0_x), 77570#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread2Thread1of1ForFork1_x thread1Thread1of1ForFork0_x)), 77518#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 5 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 77501#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9994 thread1Thread1of1ForFork0_x)), 77546#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9996)), 77553#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9995 thread1Thread1of1ForFork0_x)), 77535#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9996)), 77510#(or (not (= X thread1Thread1of1ForFork0_x)) (< thread2Thread1of1ForFork1_x 10000) (<= 9993 thread1Thread1of1ForFork0_x)), 77487#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9999 thread1Thread1of1ForFork0_x)), 77508#(or (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x)), 77517#(or (<= (+ 6 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x) (not (= X thread2Thread1of1ForFork1_x))), 77529#(or (<= (+ thread2Thread1of1ForFork1_x 1) thread1Thread1of1ForFork0_x) (not (= X thread2Thread1of1ForFork1_x))), 77514#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9993)), 77488#(<= 9998 thread1Thread1of1ForFork0_x), 77483#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9999)), 77521#(<= X 9992), 77485#(<= 9999 thread1Thread1of1ForFork0_x), 77555#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9993 thread1Thread1of1ForFork0_x)), 77484#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 77541#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9997 thread1Thread1of1ForFork0_x)), 77545#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9994 thread1Thread1of1ForFork0_x)), 77549#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9993 thread1Thread1of1ForFork0_x)), 77540#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9997 thread1Thread1of1ForFork0_x)), 77499#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9995 thread1Thread1of1ForFork0_x)), 77564#(or (<= thread2Thread1of1ForFork1_x 9994) (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x)), 77524#(<= (+ 5 X) thread1Thread1of1ForFork0_x), 77528#(<= (+ 2 X) thread1Thread1of1ForFork0_x), 77567#(or (<= thread2Thread1of1ForFork1_x 9993) (<= 9994 thread1Thread1of1ForFork0_x)), 77531#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9999 thread1Thread1of1ForFork0_x)), 77560#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9996 thread1Thread1of1ForFork0_x)), 77554#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9994 thread1Thread1of1ForFork0_x)), 77515#(or (<= thread2Thread1of1ForFork1_x 9992) (not (= X thread2Thread1of1ForFork1_x))), 77565#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9993)), 77502#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9994 thread1Thread1of1ForFork0_x)), 77482#(<= 10000 thread1Thread1of1ForFork0_x), 77505#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9997)), 77561#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9995 thread1Thread1of1ForFork0_x)), 77566#(or (<= 9995 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9993)), 77539#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9997 thread1Thread1of1ForFork0_x)), 77497#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9997 thread1Thread1of1ForFork0_x)), 77504#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9999 thread1Thread1of1ForFork0_x)), 77496#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9995 thread1Thread1of1ForFork0_x)), 77558#(or (<= thread2Thread1of1ForFork1_x 9996) (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x)), 77537#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9998 thread1Thread1of1ForFork0_x)), 77544#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9995 thread1Thread1of1ForFork0_x)), 77530#(<= (+ X 1) thread1Thread1of1ForFork0_x), 77538#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9993)), 77569#(or (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9993)), 77513#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 10000 thread1Thread1of1ForFork0_x)), 77523#(<= (+ 6 X) thread1Thread1of1ForFork0_x), 77525#(<= (+ X 4) thread1Thread1of1ForFork0_x), 77489#(or (<= 9998 thread1Thread1of1ForFork0_x) (< thread2Thread1of1ForFork1_x 10000)), 77512#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9995))] [2022-03-15 22:31:47,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-03-15 22:31:47,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:31:47,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-03-15 22:31:47,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3216, Invalid=10356, Unknown=0, NotChecked=0, Total=13572 [2022-03-15 22:31:47,115 INFO L87 Difference]: Start difference. First operand 687 states and 1736 transitions. Second operand has 108 states, 108 states have (on average 1.8888888888888888) internal successors, (204), 108 states have internal predecessors, (204), 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 22:31:59,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:31:59,216 INFO L93 Difference]: Finished difference Result 2726 states and 7041 transitions. [2022-03-15 22:31:59,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 516 states. [2022-03-15 22:31:59,216 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 1.8888888888888888) internal successors, (204), 108 states have internal predecessors, (204), 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 25 [2022-03-15 22:31:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:31:59,234 INFO L225 Difference]: With dead ends: 2726 [2022-03-15 22:31:59,234 INFO L226 Difference]: Without dead ends: 2570 [2022-03-15 22:31:59,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 612 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167642 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=90749, Invalid=285633, Unknown=0, NotChecked=0, Total=376382 [2022-03-15 22:31:59,278 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 293 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 874 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 3509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 874 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:31:59,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 11 Invalid, 3509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [874 Valid, 2635 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:31:59,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2022-03-15 22:31:59,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 606. [2022-03-15 22:31:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 605 states have (on average 2.5388429752066117) internal successors, (1536), 605 states have internal predecessors, (1536), 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 22:31:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1536 transitions. [2022-03-15 22:31:59,307 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1536 transitions. Word has length 25 [2022-03-15 22:31:59,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:31:59,307 INFO L470 AbstractCegarLoop]: Abstraction has 606 states and 1536 transitions. [2022-03-15 22:31:59,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 1.8888888888888888) internal successors, (204), 108 states have internal predecessors, (204), 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 22:31:59,307 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1536 transitions. [2022-03-15 22:31:59,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 22:31:59,308 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:31:59,308 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:31:59,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 22:31:59,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 22:31:59,508 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:31:59,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:31:59,509 INFO L85 PathProgramCache]: Analyzing trace with hash 508110142, now seen corresponding path program 36 times [2022-03-15 22:31:59,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:31:59,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147924780] [2022-03-15 22:31:59,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:31:59,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:31:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:31:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:31:59,740 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:31:59,740 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147924780] [2022-03-15 22:31:59,740 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147924780] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:31:59,740 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572153795] [2022-03-15 22:31:59,740 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:31:59,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:31:59,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:31:59,741 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:31:59,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 22:31:59,765 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 22:31:59,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:31:59,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 22:31:59,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:31:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 22:31:59,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:32:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 22:32:00,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572153795] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:32:00,067 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:32:00,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 5, 5] total 27 [2022-03-15 22:32:00,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [38327013] [2022-03-15 22:32:00,068 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:32:00,069 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:32:00,076 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 224 transitions. [2022-03-15 22:32:00,076 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:32:02,820 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 90 new interpolants: [82742#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993)))), 82750#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998)))), 82700#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996))), 82697#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 82698#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 82705#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 82709#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x) 19994)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 10000 Y))), 82758#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993)))), 82766#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9999)))), 82756#(and (or (<= 10000 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993)) (<= (+ Y thread1Thread1of1ForFork0_x) 19992))), 82696#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x) 19995)) (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9996)))), 82769#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9996)))), 82765#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 82760#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 82716#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 82724#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 82755#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (< thread1Thread1of1ForFork0_x 9993)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19985))), 82759#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993)))), 82768#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988) (not (< thread1Thread1of1ForFork0_x 9997)))), 82729#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 82734#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 82737#(and (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 82733#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 82754#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9994)))), 82743#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9993)))), 82764#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19985))), 82713#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 82715#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 82732#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 82735#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 82719#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998)))), 82727#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 82744#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (< thread1Thread1of1ForFork0_x 9993)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 82688#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x) 19997))), 82687#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 82740#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (< thread1Thread1of1ForFork0_x 9993)) (<= (+ Y thread1Thread1of1ForFork0_x) 19992))), 82723#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 82721#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9997)))), 82726#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 82725#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9998)))), 82745#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988) (not (< thread1Thread1of1ForFork0_x 9993)))), 82714#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 82720#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9998)))), 82736#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 82751#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 82710#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 82685#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x) 19998)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 10000 Y))), 82689#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9998)))), 82718#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 82708#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 82706#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 82748#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 82747#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9993)))), 82741#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9993)))), 82690#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x) 19996) (not (< thread1Thread1of1ForFork0_x 9997)))), 82699#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 82757#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993)))), 82703#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9996)))), 82763#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993)))), 82761#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988) (not (< thread1Thread1of1ForFork0_x 9993)))), 82728#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991))), 82712#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= (+ Y thread1Thread1of1ForFork0_x) 19993) (not (< thread1Thread1of1ForFork0_x 9994)))), 82771#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19985))), 82695#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 82753#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9995)))), 82684#(and (or (<= (+ Y thread1Thread1of1ForFork0_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 82730#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 82694#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9998)))), 82702#(and (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 82691#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9997)))), 82701#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 9998)))), 82746#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9993)))), 82773#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19984) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993)))), 82739#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9994)))), 82752#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 82711#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9995)))), 82686#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 82692#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 82717#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 82707#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 82749#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 82722#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 82767#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989) (not (< thread1Thread1of1ForFork0_x 9998)))), 82770#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9995))) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 82772#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19984) (not (< thread1Thread1of1ForFork0_x 9993)))), 82731#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 82738#(and (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 82693#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9999)))), 82704#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 82762#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))))] [2022-03-15 22:32:02,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 113 states [2022-03-15 22:32:02,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:32:02,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2022-03-15 22:32:02,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1646, Invalid=12396, Unknown=0, NotChecked=0, Total=14042 [2022-03-15 22:32:02,822 INFO L87 Difference]: Start difference. First operand 606 states and 1536 transitions. Second operand has 113 states, 112 states have (on average 1.9196428571428572) internal successors, (215), 112 states have internal predecessors, (215), 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 22:33:04,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:33:04,317 INFO L93 Difference]: Finished difference Result 5346 states and 13818 transitions. [2022-03-15 22:33:04,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 820 states. [2022-03-15 22:33:04,317 INFO L78 Accepts]: Start accepts. Automaton has has 113 states, 112 states have (on average 1.9196428571428572) internal successors, (215), 112 states have internal predecessors, (215), 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 26 [2022-03-15 22:33:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:33:04,324 INFO L225 Difference]: With dead ends: 5346 [2022-03-15 22:33:04,324 INFO L226 Difference]: Without dead ends: 5342 [2022-03-15 22:33:04,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 986 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 933 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407946 ImplicationChecksByTransitivity, 59.2s TimeCoverageRelationStatistics Valid=142868, Invalid=730422, Unknown=0, NotChecked=0, Total=873290 [2022-03-15 22:33:04,353 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 383 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 4192 mSolverCounterSat, 1356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 5548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1356 IncrementalHoareTripleChecker+Valid, 4192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:33:04,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 13 Invalid, 5548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1356 Valid, 4192 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 22:33:04,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5342 states. [2022-03-15 22:33:04,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5342 to 752. [2022-03-15 22:33:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 751 states have (on average 2.552596537949401) internal successors, (1917), 751 states have internal predecessors, (1917), 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 22:33:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1917 transitions. [2022-03-15 22:33:04,386 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1917 transitions. Word has length 26 [2022-03-15 22:33:04,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:33:04,386 INFO L470 AbstractCegarLoop]: Abstraction has 752 states and 1917 transitions. [2022-03-15 22:33:04,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 113 states, 112 states have (on average 1.9196428571428572) internal successors, (215), 112 states have internal predecessors, (215), 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 22:33:04,393 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1917 transitions. [2022-03-15 22:33:04,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 22:33:04,394 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:33:04,394 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:33:04,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 22:33:04,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:33:04,603 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:33:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:33:04,604 INFO L85 PathProgramCache]: Analyzing trace with hash 509666962, now seen corresponding path program 37 times [2022-03-15 22:33:04,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:33:04,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606287347] [2022-03-15 22:33:04,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:33:04,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:33:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:33:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:33:04,841 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:33:04,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606287347] [2022-03-15 22:33:04,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606287347] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:33:04,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642789403] [2022-03-15 22:33:04,841 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:33:04,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:33:04,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:33:04,842 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:33:04,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 22:33:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:33:04,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 22:33:04,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:33:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:33:05,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:33:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 21 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:33:06,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642789403] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:33:06,145 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:33:06,145 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 59 [2022-03-15 22:33:06,145 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [911648105] [2022-03-15 22:33:06,145 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:33:06,146 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:33:06,152 INFO L252 McrAutomatonBuilder]: Finished intersection with 137 states and 246 transitions. [2022-03-15 22:33:06,152 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:33:10,679 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 91 new interpolants: [91479#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9995)))), 91552#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9996)))), 91510#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9998)))), 91471#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 91526#(and (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 91553#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9995))) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 91525#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9995)))), 91488#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9993)))), 91496#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 91501#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 91531#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9996))) (or (<= (+ Y thread2Thread1of1ForFork1_x) 19995) (not (< thread2Thread1of1ForFork1_x 9996)))), 91470#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9997)))), 91482#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996))), 91517#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 91498#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 91540#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (< thread1Thread1of1ForFork0_x 9993)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 91506#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 91537#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 91490#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9993)))), 91484#(and (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 91557#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19984) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993)))), 91467#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 91493#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993)))), 91534#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19992) (not (< thread2Thread1of1ForFork1_x 9993))) (or (not (< thread2Thread1of1ForFork1_x 9993)) (<= 10000 Y))), 91499#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991))), 91518#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998)))), 91476#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9998)))), 91472#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 91538#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9999)))), 91480#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 91530#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19996) (not (< thread2Thread1of1ForFork1_x 9997))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9997)))), 91556#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19985))), 91500#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 91516#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 91523#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 91514#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9998)))), 91522#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 91474#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 91539#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9994)))), 91478#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 91503#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998)))), 91543#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9993)))), 91521#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 91513#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 91491#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993)))), 91489#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993)))), 91477#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 91512#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 91551#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (< thread1Thread1of1ForFork0_x 9993)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19985))), 91492#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993)))), 91528#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19998) (not (< thread2Thread1of1ForFork1_x 9999))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9999)))), 91532#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19994) (not (< thread2Thread1of1ForFork1_x 9995))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9995)))), 91544#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 91485#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9996)))), 91497#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 91527#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 10000))) (or (<= (+ Y thread2Thread1of1ForFork1_x) 19999) (not (< thread2Thread1of1ForFork1_x 10000)))), 91520#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 91547#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993)))), 91505#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 91548#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989) (not (< thread1Thread1of1ForFork0_x 9998)))), 91519#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 91515#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 91483#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 9998)))), 91535#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19992) (not (< thread2Thread1of1ForFork1_x 9993)) (not (= X thread2Thread1of1ForFork1_x))) (or (not (< thread2Thread1of1ForFork1_x 9993)) (<= 10000 Y) (not (= X thread2Thread1of1ForFork1_x)))), 91536#(and (or (not (< X 9993)) (<= (+ Y X) 19992)) (or (<= 10000 Y) (not (< X 9993)))), 91486#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 91509#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 91475#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9999)))), 91468#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 91494#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 91524#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 91542#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9993)))), 91504#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9997)))), 91487#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 91533#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19993) (not (< thread2Thread1of1ForFork1_x 9994))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9994)))), 91481#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 91545#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988) (not (< thread1Thread1of1ForFork0_x 9993)))), 91529#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9998))) (or (not (< thread2Thread1of1ForFork1_x 9998)) (<= (+ Y thread2Thread1of1ForFork1_x) 19997))), 91511#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 91549#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988) (not (< thread1Thread1of1ForFork0_x 9997)))), 91555#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19984) (not (< thread1Thread1of1ForFork0_x 9993)))), 91541#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988) (not (< thread1Thread1of1ForFork0_x 9993)))), 91508#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 91550#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9994)))), 91554#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19985))), 91473#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 91495#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 91469#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9998)))), 91507#(and (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 91502#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 91546#(and (or (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (= X thread1Thread1of1ForFork0_x)) (not (< thread1Thread1of1ForFork0_x 9993))))] [2022-03-15 22:33:10,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 114 states [2022-03-15 22:33:10,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:33:10,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2022-03-15 22:33:10,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2551, Invalid=20401, Unknown=0, NotChecked=0, Total=22952 [2022-03-15 22:33:10,688 INFO L87 Difference]: Start difference. First operand 752 states and 1917 transitions. Second operand has 114 states, 113 states have (on average 2.0088495575221237) internal successors, (227), 113 states have internal predecessors, (227), 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 22:34:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:34:22,954 INFO L93 Difference]: Finished difference Result 6128 states and 15013 transitions. [2022-03-15 22:34:22,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 868 states. [2022-03-15 22:34:22,954 INFO L78 Accepts]: Start accepts. Automaton has has 114 states, 113 states have (on average 2.0088495575221237) internal successors, (227), 113 states have internal predecessors, (227), 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 26 [2022-03-15 22:34:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:34:22,961 INFO L225 Difference]: With dead ends: 6128 [2022-03-15 22:34:22,961 INFO L226 Difference]: Without dead ends: 6053 [2022-03-15 22:34:22,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1045 GetRequests, 27 SyntacticMatches, 12 SemanticMatches, 1006 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467296 ImplicationChecksByTransitivity, 71.4s TimeCoverageRelationStatistics Valid=152681, Invalid=862375, Unknown=0, NotChecked=0, Total=1015056 [2022-03-15 22:34:22,996 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 900 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 4629 mSolverCounterSat, 1639 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 6268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1639 IncrementalHoareTripleChecker+Valid, 4629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:34:22,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [900 Valid, 18 Invalid, 6268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1639 Valid, 4629 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 22:34:23,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2022-03-15 22:34:23,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 740. [2022-03-15 22:34:23,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 2.4912043301759135) internal successors, (1841), 739 states have internal predecessors, (1841), 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 22:34:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1841 transitions. [2022-03-15 22:34:23,024 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1841 transitions. Word has length 26 [2022-03-15 22:34:23,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:34:23,024 INFO L470 AbstractCegarLoop]: Abstraction has 740 states and 1841 transitions. [2022-03-15 22:34:23,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 114 states, 113 states have (on average 2.0088495575221237) internal successors, (227), 113 states have internal predecessors, (227), 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 22:34:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1841 transitions. [2022-03-15 22:34:23,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 22:34:23,028 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:34:23,028 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:34:23,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 22:34:23,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 22:34:23,244 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:34:23,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:34:23,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1458634019, now seen corresponding path program 38 times [2022-03-15 22:34:23,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:34:23,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709237361] [2022-03-15 22:34:23,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:34:23,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:34:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:34:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:34:23,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:34:23,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709237361] [2022-03-15 22:34:23,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709237361] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:34:23,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986423608] [2022-03-15 22:34:23,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:34:23,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:34:23,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:34:23,347 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:34:23,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 22:34:23,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:34:23,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:34:23,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 22:34:23,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:34:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:34:23,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:34:23,613 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:34:23,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986423608] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:34:23,614 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:34:23,614 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 39 [2022-03-15 22:34:23,614 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1640182835] [2022-03-15 22:34:23,614 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:34:23,615 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:34:23,621 INFO L252 McrAutomatonBuilder]: Finished intersection with 136 states and 243 transitions. [2022-03-15 22:34:23,621 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:34:27,087 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 90 new interpolants: [101101#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x 9994)), 101107#(or (<= (+ 7 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 101104#(or (<= thread1Thread1of1ForFork0_x 9991) (<= 9993 thread1Thread1of1ForFork0_x)), 101110#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 101112#(or (<= (+ 7 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9993 thread1Thread1of1ForFork0_x)), 101109#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 101161#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9993 thread1Thread1of1ForFork0_x)), 101168#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9993 thread1Thread1of1ForFork0_x)), 101157#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9995 thread1Thread1of1ForFork0_x)), 101082#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 101108#(or (<= 9993 thread1Thread1of1ForFork0_x) (<= (+ 8 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 101147#(or (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x)) (<= 9998 thread1Thread1of1ForFork0_x)), 101134#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x))), 101159#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9993 thread1Thread1of1ForFork0_x)), 101117#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 101141#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 101170#(or (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 101087#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1))), 101142#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 101133#(or (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 101103#(or (<= thread1Thread1of1ForFork0_x 9992) (<= 9994 thread1Thread1of1ForFork0_x)), 101149#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9996 thread1Thread1of1ForFork0_x)), 101081#(or (<= thread1Thread1of1ForFork0_x 9998) (not (< thread1Thread1of1ForFork0_x 10000))), 101122#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x))), 101153#(or (<= thread1Thread1of1ForFork0_x (+ 6 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 101126#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 101091#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 101105#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 101115#(or (<= (+ 7 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x)), 101163#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9993 thread1Thread1of1ForFork0_x)), 101144#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 101128#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9997 thread1Thread1of1ForFork0_x)), 101138#(or (<= 9995 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 101158#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9994 thread1Thread1of1ForFork0_x)), 101114#(or (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x) (<= (+ 8 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 101154#(or (<= thread1Thread1of1ForFork0_x (+ 5 thread2Thread1of1ForFork1_x)) (<= 9998 thread1Thread1of1ForFork0_x)), 101093#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 101135#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9997 thread1Thread1of1ForFork0_x)), 101106#(or (<= (+ 6 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 101102#(or (<= 9995 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x 9993)), 101165#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x)), 101148#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (<= 9997 thread1Thread1of1ForFork0_x)), 101100#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 101113#(or (<= thread1Thread1of1ForFork0_x 9991) (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x)), 101164#(or (<= 9993 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 101169#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9993 thread1Thread1of1ForFork0_x)), 101098#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 101084#(or (<= thread1Thread1of1ForFork0_x 9997) (<= 9999 thread1Thread1of1ForFork0_x)), 101086#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 101167#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x)), 101124#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 101123#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 101146#(or (<= thread1Thread1of1ForFork0_x (+ 5 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 101130#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 101166#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x)), 101119#(or (<= (+ 6 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9993 thread1Thread1of1ForFork0_x)), 101136#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9996 thread1Thread1of1ForFork0_x)), 101096#(or (<= thread1Thread1of1ForFork0_x 9995) (<= 9997 thread1Thread1of1ForFork0_x)), 101118#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 101127#(or (<= 9997 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 101090#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 101095#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 101139#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 101094#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9999 thread1Thread1of1ForFork0_x)), 101092#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 101120#(or (<= (+ 6 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x)), 101089#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x 9996)), 101132#(or (<= thread1Thread1of1ForFork0_x (+ 5 thread2Thread1of1ForFork1_x)) (not (< thread1Thread1of1ForFork0_x 10000))), 101140#(or (<= 9995 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 101088#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 101143#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 101099#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 101137#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 101151#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 101116#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 101145#(or (<= thread1Thread1of1ForFork0_x (+ 6 thread2Thread1of1ForFork1_x)) (<= 10000 thread1Thread1of1ForFork0_x)), 101111#(or (<= (+ 6 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 101125#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9998 thread1Thread1of1ForFork0_x)), 101150#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9995 thread1Thread1of1ForFork0_x)), 101085#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 101160#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9993 thread1Thread1of1ForFork0_x)), 101162#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9993 thread1Thread1of1ForFork0_x)), 101152#(or (<= thread1Thread1of1ForFork0_x (+ 7 thread2Thread1of1ForFork1_x)) (not (< thread1Thread1of1ForFork0_x 10000))), 101156#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x))), 101131#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 101121#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (not (< thread1Thread1of1ForFork0_x 10000))), 101129#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 101097#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 101083#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 101155#(or (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x)) (<= 9997 thread1Thread1of1ForFork0_x))] [2022-03-15 22:34:27,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2022-03-15 22:34:27,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:34:27,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2022-03-15 22:34:27,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1739, Invalid=14773, Unknown=0, NotChecked=0, Total=16512 [2022-03-15 22:34:27,089 INFO L87 Difference]: Start difference. First operand 740 states and 1841 transitions. Second operand has 111 states, 111 states have (on average 2.027027027027027) internal successors, (225), 111 states have internal predecessors, (225), 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 22:35:07,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:35:07,244 INFO L93 Difference]: Finished difference Result 3887 states and 7699 transitions. [2022-03-15 22:35:07,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 827 states. [2022-03-15 22:35:07,244 INFO L78 Accepts]: Start accepts. Automaton has has 111 states, 111 states have (on average 2.027027027027027) internal successors, (225), 111 states have internal predecessors, (225), 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 27 [2022-03-15 22:35:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:35:07,251 INFO L225 Difference]: With dead ends: 3887 [2022-03-15 22:35:07,251 INFO L226 Difference]: Without dead ends: 3869 [2022-03-15 22:35:07,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 981 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 925 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352335 ImplicationChecksByTransitivity, 39.2s TimeCoverageRelationStatistics Valid=158593, Invalid=699809, Unknown=0, NotChecked=0, Total=858402 [2022-03-15 22:35:07,287 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 551 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 5215 mSolverCounterSat, 850 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 6065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 850 IncrementalHoareTripleChecker+Valid, 5215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:35:07,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 37 Invalid, 6065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [850 Valid, 5215 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 22:35:07,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3869 states. [2022-03-15 22:35:07,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3869 to 1125. [2022-03-15 22:35:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 2.7980427046263343) internal successors, (3145), 1124 states have internal predecessors, (3145), 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 22:35:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 3145 transitions. [2022-03-15 22:35:07,349 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 3145 transitions. Word has length 27 [2022-03-15 22:35:07,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:35:07,349 INFO L470 AbstractCegarLoop]: Abstraction has 1125 states and 3145 transitions. [2022-03-15 22:35:07,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 2.027027027027027) internal successors, (225), 111 states have internal predecessors, (225), 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 22:35:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 3145 transitions. [2022-03-15 22:35:07,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 22:35:07,351 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:35:07,351 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:35:07,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 22:35:07,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-15 22:35:07,566 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:35:07,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:35:07,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1380216419, now seen corresponding path program 39 times [2022-03-15 22:35:07,567 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:35:07,567 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252177046] [2022-03-15 22:35:07,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:35:07,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:35:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:35:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:35:07,695 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:35:07,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252177046] [2022-03-15 22:35:07,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252177046] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:35:07,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143751642] [2022-03-15 22:35:07,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:35:07,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:35:07,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:35:07,696 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:35:07,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 22:35:07,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:35:07,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:35:07,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 22:35:07,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:35:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 22:35:07,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:35:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 22:35:07,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143751642] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:35:07,901 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:35:07,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 5, 5] total 28 [2022-03-15 22:35:07,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1064526757] [2022-03-15 22:35:07,901 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:35:07,902 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:35:07,908 INFO L252 McrAutomatonBuilder]: Finished intersection with 149 states and 269 transitions. [2022-03-15 22:35:07,909 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:35:11,743 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 101 new interpolants: [109176#(<= 9999 thread2Thread1of1ForFork1_x), 109118#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 109090#(< thread1Thread1of1ForFork0_x 10000), 109182#(<= 9994 thread2Thread1of1ForFork1_x), 109124#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9999 thread1Thread1of1ForFork0_x)), 109122#(or (<= (+ 6 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9993 thread1Thread1of1ForFork0_x)), 109111#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 109091#(or (< thread1Thread1of1ForFork0_x 9999) (not (< thread1Thread1of1ForFork0_x 10000))), 109153#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9997 thread1Thread1of1ForFork0_x)), 109165#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9995 thread1Thread1of1ForFork0_x)), 109115#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1))), 109130#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9993 thread1Thread1of1ForFork0_x)), 109157#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (<= 9997 thread1Thread1of1ForFork0_x)), 109134#(or (<= (+ 6 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x)), 109117#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 109188#(or (<= 9993 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 109167#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 109126#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 109095#(or (< thread1Thread1of1ForFork0_x 9995) (<= 9996 thread1Thread1of1ForFork0_x)), 109120#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 109107#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 109144#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9998 thread1Thread1of1ForFork0_x)), 109101#(or (< thread1Thread1of1ForFork0_x 9994) (<= 9995 thread1Thread1of1ForFork0_x)), 109116#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 109132#(or (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x) (<= (+ 8 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 109138#(or (<= thread1Thread1of1ForFork0_x (+ 5 thread2Thread1of1ForFork1_x)) (not (< thread1Thread1of1ForFork0_x 10000))), 109147#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9997 thread1Thread1of1ForFork0_x)), 109104#(or (<= (+ 7 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 109158#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9996 thread1Thread1of1ForFork0_x)), 109162#(or (<= thread1Thread1of1ForFork0_x (+ 5 thread2Thread1of1ForFork1_x)) (<= 9998 thread1Thread1of1ForFork0_x)), 109164#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x))), 109096#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (not (< thread1Thread1of1ForFork0_x 10000))), 109152#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x))), 109181#(<= 9995 thread2Thread1of1ForFork1_x), 109189#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9993 thread1Thread1of1ForFork0_x)), 109125#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 109121#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 109160#(or (<= thread1Thread1of1ForFork0_x (+ 7 thread2Thread1of1ForFork1_x)) (not (< thread1Thread1of1ForFork0_x 10000))), 109146#(or (<= 9997 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 109154#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9996 thread1Thread1of1ForFork0_x)), 109177#(<= 9998 thread2Thread1of1ForFork1_x), 109141#(or (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 109175#(or (not (= X thread1Thread1of1ForFork0_x)) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9993 thread1Thread1of1ForFork0_x)), 109114#(or (<= (+ 7 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9993 thread1Thread1of1ForFork0_x)), 109142#(or (<= thread1Thread1of1ForFork0_x (+ 6 thread2Thread1of1ForFork1_x)) (<= 10000 thread1Thread1of1ForFork0_x)), 109100#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 109155#(or (<= 9995 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 109190#(or (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 109127#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 109129#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 109119#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9996 thread1Thread1of1ForFork0_x)), 109098#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 109150#(or (<= 9995 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 109171#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9993 thread1Thread1of1ForFork0_x)), 109128#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 109168#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 109170#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9993 thread1Thread1of1ForFork0_x)), 109139#(or (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 109105#(or (<= 9993 thread1Thread1of1ForFork0_x) (< thread1Thread1of1ForFork0_x 9992)), 109163#(or (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x)) (<= 9997 thread1Thread1of1ForFork0_x)), 109110#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 109133#(or (<= (+ 7 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x)), 109184#(<= 9992 thread2Thread1of1ForFork1_x), 109185#(or (<= 9992 thread2Thread1of1ForFork1_x) (not (= X thread2Thread1of1ForFork1_x))), 109151#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 109186#(<= 9992 X), 109173#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x)), 109109#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 109135#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x)), 109093#(or (<= 9998 thread1Thread1of1ForFork0_x) (< thread1Thread1of1ForFork0_x 9997)), 109137#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x))), 109097#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 109099#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9997 thread1Thread1of1ForFork0_x)), 109159#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9995 thread1Thread1of1ForFork0_x)), 109149#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x)), 109112#(or (<= (+ 5 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 109102#(or (<= (+ 6 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9995 thread1Thread1of1ForFork0_x)), 109145#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 109092#(or (< thread1Thread1of1ForFork0_x 9998) (<= 9999 thread1Thread1of1ForFork0_x)), 109123#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread1Thread1of1ForFork0_x (+ 2 thread2Thread1of1ForFork1_x))), 109178#(<= 9997 thread2Thread1of1ForFork1_x), 109187#(or (<= thread1Thread1of1ForFork0_x (+ thread2Thread1of1ForFork1_x 1)) (<= 9994 thread1Thread1of1ForFork0_x)), 109174#(or (<= (+ 2 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9993 thread1Thread1of1ForFork0_x)), 109179#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9993 thread1Thread1of1ForFork0_x)), 109161#(or (<= thread1Thread1of1ForFork0_x (+ 6 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 109136#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (not (< thread1Thread1of1ForFork0_x 10000))), 109103#(or (< thread1Thread1of1ForFork0_x 9993) (<= 9994 thread1Thread1of1ForFork0_x)), 109106#(or (<= 9993 thread1Thread1of1ForFork0_x) (<= (+ 8 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x)), 109094#(or (< thread1Thread1of1ForFork0_x 9996) (<= 9997 thread1Thread1of1ForFork0_x)), 109143#(or (<= thread1Thread1of1ForFork0_x (+ 5 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 109166#(or (<= (+ 3 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 109113#(or (<= (+ 6 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 109156#(or (<= thread1Thread1of1ForFork0_x (+ 4 thread2Thread1of1ForFork1_x)) (<= 9998 thread1Thread1of1ForFork0_x)), 109140#(or (<= thread1Thread1of1ForFork0_x (+ 3 thread2Thread1of1ForFork1_x)) (<= 9999 thread1Thread1of1ForFork0_x)), 109169#(or (<= thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) (<= 9994 thread1Thread1of1ForFork0_x)), 109180#(<= 9996 thread2Thread1of1ForFork1_x), 109131#(or (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x) (< thread1Thread1of1ForFork0_x 9992)), 109183#(<= 9993 thread2Thread1of1ForFork1_x), 109108#(or (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x) (<= 9999 thread1Thread1of1ForFork0_x)), 109148#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= (+ thread1Thread1of1ForFork0_x 1) thread2Thread1of1ForFork1_x)), 109172#(or (<= (+ 4 thread1Thread1of1ForFork0_x) thread2Thread1of1ForFork1_x) (not (= X thread1Thread1of1ForFork0_x)) (<= 9993 thread1Thread1of1ForFork0_x))] [2022-03-15 22:35:11,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2022-03-15 22:35:11,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:35:11,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2022-03-15 22:35:11,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2023, Invalid=14489, Unknown=0, NotChecked=0, Total=16512 [2022-03-15 22:35:11,745 INFO L87 Difference]: Start difference. First operand 1125 states and 3145 transitions. Second operand has 122 states, 122 states have (on average 2.0327868852459017) internal successors, (248), 122 states have internal predecessors, (248), 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 22:35:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:35:53,781 INFO L93 Difference]: Finished difference Result 3144 states and 7076 transitions. [2022-03-15 22:35:53,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 753 states. [2022-03-15 22:35:53,783 INFO L78 Accepts]: Start accepts. Automaton has has 122 states, 122 states have (on average 2.0327868852459017) internal successors, (248), 122 states have internal predecessors, (248), 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 27 [2022-03-15 22:35:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:35:53,786 INFO L225 Difference]: With dead ends: 3144 [2022-03-15 22:35:53,786 INFO L226 Difference]: Without dead ends: 3101 [2022-03-15 22:35:53,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 918 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 849 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281095 ImplicationChecksByTransitivity, 39.4s TimeCoverageRelationStatistics Valid=113925, Invalid=609425, Unknown=0, NotChecked=0, Total=723350 [2022-03-15 22:35:53,813 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 612 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 10713 mSolverCounterSat, 704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 11417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 704 IncrementalHoareTripleChecker+Valid, 10713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:35:53,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 44 Invalid, 11417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [704 Valid, 10713 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-03-15 22:35:53,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2022-03-15 22:35:53,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 886. [2022-03-15 22:35:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 2.522033898305085) internal successors, (2232), 885 states have internal predecessors, (2232), 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 22:35:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 2232 transitions. [2022-03-15 22:35:53,841 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 2232 transitions. Word has length 27 [2022-03-15 22:35:53,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:35:53,841 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 2232 transitions. [2022-03-15 22:35:53,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 122 states, 122 states have (on average 2.0327868852459017) internal successors, (248), 122 states have internal predecessors, (248), 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 22:35:53,841 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 2232 transitions. [2022-03-15 22:35:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 22:35:53,842 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:35:53,842 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:35:53,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-15 22:35:54,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-03-15 22:35:54,058 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:35:54,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:35:54,058 INFO L85 PathProgramCache]: Analyzing trace with hash -800674145, now seen corresponding path program 40 times [2022-03-15 22:35:54,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:35:54,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214488191] [2022-03-15 22:35:54,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:35:54,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:35:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:35:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:35:54,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:35:54,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214488191] [2022-03-15 22:35:54,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214488191] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:35:54,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525546481] [2022-03-15 22:35:54,189 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:35:54,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:35:54,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:35:54,190 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:35:54,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 22:35:54,212 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:35:54,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:35:54,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 22:35:54,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:35:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:35:54,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:35:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:35:54,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525546481] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:35:54,343 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:35:54,343 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2022-03-15 22:35:54,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2087429173] [2022-03-15 22:35:54,343 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:35:54,344 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:35:54,350 INFO L252 McrAutomatonBuilder]: Finished intersection with 138 states and 247 transitions. [2022-03-15 22:35:54,350 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:35:56,231 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 109 new interpolants: [115829#(or (<= (+ thread2Thread1of1ForFork1_x 1) thread1Thread1of1ForFork0_x) (not (= X thread2Thread1of1ForFork1_x))), 115840#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9992 thread1Thread1of1ForFork0_x)), 115837#(or (<= 9993 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9993)), 115801#(or (<= (+ 8 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x) (not (= X thread2Thread1of1ForFork1_x))), 115745#(<= 9995 thread1Thread1of1ForFork0_x), 115755#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9997 thread1Thread1of1ForFork0_x)), 115786#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 10000 thread1Thread1of1ForFork0_x)), 115828#(<= (+ 2 X) thread1Thread1of1ForFork0_x), 115766#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9995 thread1Thread1of1ForFork0_x)), 115788#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9999 thread1Thread1of1ForFork0_x)), 115797#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9996 thread1Thread1of1ForFork0_x)), 115767#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9994 thread1Thread1of1ForFork0_x)), 115803#(<= X 9991), 115752#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 115827#(<= (+ 3 X) thread1Thread1of1ForFork0_x), 115756#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 115777#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9999 thread1Thread1of1ForFork0_x)), 115821#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 4 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 115748#(or (<= 9998 thread1Thread1of1ForFork0_x) (< thread2Thread1of1ForFork1_x 10000)), 115765#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9997)), 115807#(or (<= thread2Thread1of1ForFork1_x 9992) (<= 9999 thread1Thread1of1ForFork0_x)), 115841#(or (<= 9992 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9993)), 115798#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9996 thread1Thread1of1ForFork0_x)), 115762#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9999 thread1Thread1of1ForFork0_x)), 115776#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9996)), 115823#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 2 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 115746#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9999)), 115782#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9994 thread1Thread1of1ForFork0_x)), 115784#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9992 thread1Thread1of1ForFork0_x)), 115751#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9995 thread1Thread1of1ForFork0_x)), 115758#(<= 9994 thread1Thread1of1ForFork0_x), 115759#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9994 thread1Thread1of1ForFork0_x)), 115742#(<= 9998 thread1Thread1of1ForFork0_x), 115819#(or (<= (+ 6 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x) (not (= X thread2Thread1of1ForFork1_x))), 115796#(or (<= 9997 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9993)), 115818#(or (<= 9992 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (<= thread2Thread1of1ForFork1_x 9997)), 115791#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9997 thread1Thread1of1ForFork0_x)), 115815#(or (<= 9992 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x))), 115835#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9993 thread1Thread1of1ForFork0_x)), 115817#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9992 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x))), 115760#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9994 thread1Thread1of1ForFork0_x)), 115813#(or (<= 9995 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9993)), 115775#(or (<= 9992 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9997)), 115846#(or (<= 9992 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (<= thread2Thread1of1ForFork1_x 9993)), 115741#(<= 9999 thread1Thread1of1ForFork0_x), 115832#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9994 thread1Thread1of1ForFork0_x)), 115764#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9997 thread1Thread1of1ForFork0_x)), 115743#(<= 9997 thread1Thread1of1ForFork0_x), 115848#(or (not (= X thread1Thread1of1ForFork0_x)) (<= thread2Thread1of1ForFork1_x thread1Thread1of1ForFork0_x)), 115839#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9992 thread1Thread1of1ForFork0_x)), 115773#(or (<= 9992 thread1Thread1of1ForFork0_x) (< thread2Thread1of1ForFork1_x 10000)), 115833#(or (<= thread2Thread1of1ForFork1_x 9993) (<= 9994 thread1Thread1of1ForFork0_x)), 115780#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9996)), 115757#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9995 thread1Thread1of1ForFork0_x)), 115795#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9993)), 115778#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9996)), 115785#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9995)), 115744#(<= 9996 thread1Thread1of1ForFork0_x), 115799#(or (<= 9996 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9993)), 115783#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9993 thread1Thread1of1ForFork0_x)), 115774#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9992 thread1Thread1of1ForFork0_x)), 115800#(or (<= thread2Thread1of1ForFork1_x 9991) (not (= X thread2Thread1of1ForFork1_x))), 115772#(<= 9992 thread1Thread1of1ForFork0_x), 115787#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9999 thread1Thread1of1ForFork0_x)), 115842#(or (<= thread2Thread1of1ForFork1_x 9992) (<= 9992 thread1Thread1of1ForFork0_x)), 115811#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9995 thread1Thread1of1ForFork0_x)), 115768#(<= 9993 thread1Thread1of1ForFork0_x), 115825#(<= (+ 5 X) thread1Thread1of1ForFork0_x), 115822#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 3 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 115747#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9999 thread1Thread1of1ForFork0_x)), 115814#(or (<= thread2Thread1of1ForFork1_x 9992) (<= 9995 thread1Thread1of1ForFork0_x)), 115790#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9998 thread1Thread1of1ForFork0_x)), 115789#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9998 thread1Thread1of1ForFork0_x)), 115754#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9998)), 115749#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9997 thread1Thread1of1ForFork0_x)), 115779#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9997 thread1Thread1of1ForFork0_x)), 115792#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9997 thread1Thread1of1ForFork0_x)), 115753#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9999 thread1Thread1of1ForFork0_x)), 115806#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9992)), 115812#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9995 thread1Thread1of1ForFork0_x)), 115770#(or (<= thread2Thread1of1ForFork1_x 9998) (<= 9993 thread1Thread1of1ForFork0_x)), 115831#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9994 thread1Thread1of1ForFork0_x)), 115816#(or (<= 9992 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x)) (< thread2Thread1of1ForFork1_x 10000)), 115781#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9995 thread1Thread1of1ForFork0_x)), 115826#(<= (+ X 4) thread1Thread1of1ForFork0_x), 115810#(or (<= thread2Thread1of1ForFork1_x 9992) (<= 9996 thread1Thread1of1ForFork0_x)), 115843#(or (<= thread2Thread1of1ForFork1_x 9996) (<= 9992 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x))), 115793#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9993)), 115804#(<= (+ X 8) thread1Thread1of1ForFork0_x), 115750#(or (<= 9996 thread1Thread1of1ForFork0_x) (< thread2Thread1of1ForFork1_x 10000)), 115838#(or (<= thread2Thread1of1ForFork1_x 9992) (<= 9993 thread1Thread1of1ForFork0_x)), 115761#(or (<= 10000 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9997)), 115844#(or (<= thread2Thread1of1ForFork1_x 9995) (<= 9992 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x))), 115830#(<= (+ X 1) thread1Thread1of1ForFork0_x), 115845#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9992 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x))), 115740#(<= 10000 thread1Thread1of1ForFork0_x), 115820#(or (not (= X thread2Thread1of1ForFork1_x)) (<= (+ 5 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x)), 115763#(or (<= 9998 thread1Thread1of1ForFork0_x) (<= thread2Thread1of1ForFork1_x 9997)), 115771#(or (<= thread2Thread1of1ForFork1_x 9997) (<= 9993 thread1Thread1of1ForFork0_x)), 115805#(<= (+ 7 X) thread1Thread1of1ForFork0_x), 115769#(or (< thread2Thread1of1ForFork1_x 10000) (<= 9993 thread1Thread1of1ForFork0_x)), 115794#(or (<= thread2Thread1of1ForFork1_x 9993) (<= 9999 thread1Thread1of1ForFork0_x)), 115834#(or (<= thread2Thread1of1ForFork1_x 9992) (<= 9994 thread1Thread1of1ForFork0_x)), 115802#(or (<= (+ 7 thread2Thread1of1ForFork1_x) thread1Thread1of1ForFork0_x) (not (= X thread2Thread1of1ForFork1_x))), 115836#(or (<= thread2Thread1of1ForFork1_x 9994) (<= 9993 thread1Thread1of1ForFork0_x)), 115808#(or (<= thread2Thread1of1ForFork1_x 9992) (<= 9998 thread1Thread1of1ForFork0_x)), 115809#(or (<= thread2Thread1of1ForFork1_x 9992) (<= 9997 thread1Thread1of1ForFork0_x)), 115847#(or (<= thread2Thread1of1ForFork1_x 9992) (<= 9992 thread1Thread1of1ForFork0_x) (not (= X thread1Thread1of1ForFork0_x))), 115824#(<= (+ 6 X) thread1Thread1of1ForFork0_x)] [2022-03-15 22:35:56,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2022-03-15 22:35:56,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:35:56,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2022-03-15 22:35:56,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4631, Invalid=14829, Unknown=0, NotChecked=0, Total=19460 [2022-03-15 22:35:56,233 INFO L87 Difference]: Start difference. First operand 886 states and 2232 transitions. Second operand has 130 states, 130 states have (on average 1.8923076923076922) internal successors, (246), 130 states have internal predecessors, (246), 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 22:36:19,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:36:19,317 INFO L93 Difference]: Finished difference Result 3761 states and 9783 transitions. [2022-03-15 22:36:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 688 states. [2022-03-15 22:36:19,332 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 130 states have (on average 1.8923076923076922) internal successors, (246), 130 states have internal predecessors, (246), 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 27 [2022-03-15 22:36:19,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:36:19,337 INFO L225 Difference]: With dead ends: 3761 [2022-03-15 22:36:19,337 INFO L226 Difference]: Without dead ends: 3551 [2022-03-15 22:36:19,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 805 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300037 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=154271, Invalid=496171, Unknown=0, NotChecked=0, Total=650442 [2022-03-15 22:36:19,359 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 359 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 3571 mSolverCounterSat, 954 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 4525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 954 IncrementalHoareTripleChecker+Valid, 3571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:36:19,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 15 Invalid, 4525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [954 Valid, 3571 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 22:36:19,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3551 states. [2022-03-15 22:36:19,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3551 to 780. [2022-03-15 22:36:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 779 states have (on average 2.5301668806161746) internal successors, (1971), 779 states have internal predecessors, (1971), 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 22:36:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1971 transitions. [2022-03-15 22:36:19,381 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1971 transitions. Word has length 27 [2022-03-15 22:36:19,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:36:19,381 INFO L470 AbstractCegarLoop]: Abstraction has 780 states and 1971 transitions. [2022-03-15 22:36:19,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 130 states have (on average 1.8923076923076922) internal successors, (246), 130 states have internal predecessors, (246), 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 22:36:19,381 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1971 transitions. [2022-03-15 22:36:19,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 22:36:19,382 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:36:19,382 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:36:19,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-15 22:36:19,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:36:19,598 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:36:19,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:36:19,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1224815906, now seen corresponding path program 41 times [2022-03-15 22:36:19,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:36:19,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164685267] [2022-03-15 22:36:19,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:36:19,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:36:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:36:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 36 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:36:19,820 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:36:19,820 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164685267] [2022-03-15 22:36:19,820 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164685267] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:36:19,820 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469828755] [2022-03-15 22:36:19,820 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:36:19,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:36:19,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:36:19,821 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:36:19,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 22:36:19,843 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 22:36:19,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:36:19,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 22:36:19,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:36:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-03-15 22:36:19,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:36:20,065 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-03-15 22:36:20,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469828755] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:36:20,065 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:36:20,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 5, 5] total 29 [2022-03-15 22:36:20,065 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [344318271] [2022-03-15 22:36:20,065 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:36:20,066 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:36:20,073 INFO L252 McrAutomatonBuilder]: Finished intersection with 149 states and 268 transitions. [2022-03-15 22:36:20,073 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:36:24,329 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 110 new interpolants: [122755#(and (or (<= (+ Y thread1Thread1of1ForFork0_x) 19991) (not (< thread1Thread1of1ForFork0_x 9992))) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 10000 Y))), 122721#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 122732#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 122799#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 122729#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x) 19994)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 10000 Y))), 122792#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 122734#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 122752#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (< thread1Thread1of1ForFork0_x 9993)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 122779#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19984))), 122712#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996))), 122710#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 122782#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989) (not (< thread1Thread1of1ForFork0_x 9998)))), 122747#(and (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 122778#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (< thread1Thread1of1ForFork0_x 9993)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19985))), 122699#(and (or (<= (+ Y thread1Thread1of1ForFork0_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 122749#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9993)))), 122720#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 122746#(and (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 122786#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 10000 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (<= (+ Y thread1Thread1of1ForFork0_x) 19991) (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x)))), 122758#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 122797#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988) (not (< thread1Thread1of1ForFork0_x 9998)))), 122731#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9995)))), 122748#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (< thread1Thread1of1ForFork0_x 9993)) (<= (+ Y thread1Thread1of1ForFork0_x) 19992))), 122775#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 122766#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 122751#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9993)))), 122796#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 122705#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x) 19997))), 122728#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 122795#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 122759#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988))), 122757#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9992)))), 122715#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 122743#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 122788#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x)))), 122701#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 122753#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988) (not (< thread1Thread1of1ForFork0_x 9993)))), 122802#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19984) (not (< thread1Thread1of1ForFork0_x 9993)))), 122718#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 122722#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9996)))), 122798#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9997)))), 122740#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 122750#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993)))), 122745#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 122789#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 122761#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9992)))), 122737#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9998)))), 122741#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= (+ Y thread1Thread1of1ForFork0_x) 19993) (not (< thread1Thread1of1ForFork0_x 9994)))), 122801#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19984) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 122708#(and (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x) 19996) (not (< thread1Thread1of1ForFork0_x 9997)))), 122756#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9992)))), 122772#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 122791#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 122707#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9998)))), 122767#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 122717#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 122725#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 122733#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991))), 122771#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 122805#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19982))), 122704#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9999)))), 122762#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 122793#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19985))), 122727#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9997)))), 122781#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9999)))), 122742#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 122765#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 122808#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19982))), 122768#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9994)))), 122783#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988) (not (< thread1Thread1of1ForFork0_x 9997)))), 122716#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 122790#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 122730#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 122754#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9993)))), 122803#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19983))), 122807#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19983))), 122724#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 122738#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 122800#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19985)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 122770#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19985)) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y))), 122711#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 122774#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 122777#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9994)))), 122785#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9995))) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 122735#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 122804#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (< thread1Thread1of1ForFork0_x 9993)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19983))), 122700#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 122702#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x) 19998)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 10000 Y))), 122760#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9992)))), 122764#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9998)))), 122794#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19985))), 122744#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 122706#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9998)))), 122806#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19984) (not (= X thread1Thread1of1ForFork0_x)))), 122736#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 122784#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9996)))), 122776#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9995)))), 122780#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 122739#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 122726#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998)))), 122787#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x)))), 122709#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9997)))), 122773#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998)))), 122713#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 9998)))), 122703#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 122763#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 122719#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x) 19995)) (or (<= 10000 Y) (not (< thread1Thread1of1ForFork0_x 9996)))), 122723#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 122714#(and (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 122769#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9993))))] [2022-03-15 22:36:24,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 135 states [2022-03-15 22:36:24,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:36:24,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2022-03-15 22:36:24,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2314, Invalid=17426, Unknown=0, NotChecked=0, Total=19740 [2022-03-15 22:36:24,332 INFO L87 Difference]: Start difference. First operand 780 states and 1971 transitions. Second operand has 135 states, 134 states have (on average 1.9253731343283582) internal successors, (258), 134 states have internal predecessors, (258), 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 22:38:24,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:38:24,622 INFO L93 Difference]: Finished difference Result 8278 states and 21409 transitions. [2022-03-15 22:38:24,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1151 states. [2022-03-15 22:38:24,623 INFO L78 Accepts]: Start accepts. Automaton has has 135 states, 134 states have (on average 1.9253731343283582) internal successors, (258), 134 states have internal predecessors, (258), 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 28 [2022-03-15 22:38:24,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:38:24,632 INFO L225 Difference]: With dead ends: 8278 [2022-03-15 22:38:24,632 INFO L226 Difference]: Without dead ends: 8274 [2022-03-15 22:38:24,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1344 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 1286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800731 ImplicationChecksByTransitivity, 115.1s TimeCoverageRelationStatistics Valid=262143, Invalid=1395513, Unknown=0, NotChecked=0, Total=1657656 [2022-03-15 22:38:24,703 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 442 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 5995 mSolverCounterSat, 1742 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 7737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1742 IncrementalHoareTripleChecker+Valid, 5995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:38:24,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [442 Valid, 15 Invalid, 7737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1742 Valid, 5995 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-03-15 22:38:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8274 states. [2022-03-15 22:38:24,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8274 to 958. [2022-03-15 22:38:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 2.541274817136886) internal successors, (2432), 957 states have internal predecessors, (2432), 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 22:38:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 2432 transitions. [2022-03-15 22:38:24,757 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 2432 transitions. Word has length 28 [2022-03-15 22:38:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:38:24,757 INFO L470 AbstractCegarLoop]: Abstraction has 958 states and 2432 transitions. [2022-03-15 22:38:24,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 135 states, 134 states have (on average 1.9253731343283582) internal successors, (258), 134 states have internal predecessors, (258), 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 22:38:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 2432 transitions. [2022-03-15 22:38:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 22:38:24,758 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:38:24,758 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:38:24,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 22:38:24,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:38:24,959 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 22:38:24,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:38:24,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1223259086, now seen corresponding path program 42 times [2022-03-15 22:38:24,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:38:24,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204051517] [2022-03-15 22:38:24,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:38:24,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:38:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:38:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 36 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:38:25,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:38:25,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204051517] [2022-03-15 22:38:25,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204051517] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:38:25,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367660059] [2022-03-15 22:38:25,140 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:38:25,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:38:25,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:38:25,142 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:38:25,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 22:38:25,164 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:38:25,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:38:25,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 22:38:25,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:38:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-03-15 22:38:25,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:38:25,353 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-03-15 22:38:25,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367660059] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:38:25,353 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:38:25,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 5, 5] total 29 [2022-03-15 22:38:25,354 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [793956534] [2022-03-15 22:38:25,354 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:38:25,355 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:38:25,361 INFO L252 McrAutomatonBuilder]: Finished intersection with 161 states and 292 transitions. [2022-03-15 22:38:25,361 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:38:28,833 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 111 new interpolants: [135587#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x)))), 135565#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993)))), 135589#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 135588#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x)))), 135598#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19983))), 135573#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9994)))), 135502#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 135518#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 135522#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9992)))), 135564#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 135507#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9999)))), 135541#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 135559#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9996)))), 135583#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 135509#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9998)))), 135550#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19993) (not (< thread2Thread1of1ForFork1_x 9994))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9994)))), 135570#(and (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 135517#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 9997)))), 135590#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 135595#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19984))), 135494#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 135579#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (< thread1Thread1of1ForFork0_x 9993)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19985))), 135545#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19998) (not (< thread2Thread1of1ForFork1_x 9999))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9999)))), 135576#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19985)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 135523#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 135525#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 135513#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9998)))), 135563#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 135504#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 135600#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19982))), 135574#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9994)))), 135543#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9995)))), 135593#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19985)) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y))), 135500#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996))), 135585#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9992)))), 135527#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9996)))), 135567#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (< thread1Thread1of1ForFork0_x 9993)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 135520#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 135515#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998)))), 135516#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989) (not (< thread1Thread1of1ForFork0_x 9998)))), 135496#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 135501#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995))), 135532#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9997)))), 135562#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 135582#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9992)))), 135542#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 135521#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 9993)))), 135490#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19999) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 135599#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19982))), 135547#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19996) (not (< thread2Thread1of1ForFork1_x 9997))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9997)))), 135495#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 135596#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19983))), 135493#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19996) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 135568#(and (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 135524#(and (or (not (< thread1Thread1of1ForFork0_x 9997)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994)) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 135578#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9993)))), 135575#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994))) (or (not (< thread1Thread1of1ForFork0_x 9994)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19985))), 135533#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 135544#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 10000))) (or (<= (+ Y thread2Thread1of1ForFork1_x) 19999) (not (< thread2Thread1of1ForFork1_x 10000)))), 135508#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9998)))), 135591#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 135556#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988) (not (< thread1Thread1of1ForFork0_x 9998)))), 135534#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 135549#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19994) (not (< thread2Thread1of1ForFork1_x 9995))) (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9995)))), 135553#(and (or (not (= X thread2Thread1of1ForFork1_x)) (not (< thread2Thread1of1ForFork1_x 9992)) (<= (+ Y thread2Thread1of1ForFork1_x) 19991)) (or (<= 10000 Y) (not (= X thread2Thread1of1ForFork1_x)) (not (< thread2Thread1of1ForFork1_x 9992)))), 135498#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 135506#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 135555#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989)) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 135546#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9998))) (or (not (< thread2Thread1of1ForFork1_x 9998)) (<= (+ Y thread2Thread1of1ForFork1_x) 19997))), 135572#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9995))) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 135558#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9997)))), 135529#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9995)))), 135491#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19998) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 135512#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998)))), 135597#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19984) (not (= X thread1Thread1of1ForFork0_x)))), 135511#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (not (< thread1Thread1of1ForFork0_x 9998)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 135535#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 135566#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9993)))), 135592#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x)))), 135548#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9996))) (or (<= (+ Y thread2Thread1of1ForFork1_x) 19995) (not (< thread2Thread1of1ForFork1_x 9996)))), 135571#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19987) (not (< thread1Thread1of1ForFork0_x 9993)))), 135538#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 135551#(and (or (<= (+ Y thread2Thread1of1ForFork1_x) 19992) (not (< thread2Thread1of1ForFork1_x 9993))) (or (not (< thread2Thread1of1ForFork1_x 9993)) (<= 10000 Y))), 135531#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991))), 135581#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (not (< thread1Thread1of1ForFork0_x 9993)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19983))), 135528#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 135586#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9992)))), 135499#(and (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y)) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 9999)))), 135569#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988) (not (< thread1Thread1of1ForFork0_x 9993)))), 135537#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 135497#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 135505#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 135536#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997)))), 135577#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19984) (not (< thread1Thread1of1ForFork0_x 9994))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9994)))), 135561#(and (or (not (< X 9992)) (<= 10000 Y)) (or (<= (+ Y X) 19991) (not (< X 9992)))), 135540#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y))), 135557#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9997))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988) (not (< thread1Thread1of1ForFork0_x 9997)))), 135503#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19993) (not (< thread1Thread1of1ForFork0_x 9999))) (or (not (< thread1Thread1of1ForFork0_x 9999)) (<= 0 Y))), 135560#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19986) (not (< thread1Thread1of1ForFork0_x 9996))) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y))), 135539#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19989))), 135492#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19997) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 135526#(and (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9996)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 135584#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19988))), 135530#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19992))), 135510#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19995) (not (< thread1Thread1of1ForFork0_x 9998)))), 135552#(and (or (<= 10000 Y) (not (< thread2Thread1of1ForFork1_x 9992))) (or (not (< thread2Thread1of1ForFork1_x 9992)) (<= (+ Y thread2Thread1of1ForFork1_x) 19991))), 135519#(and (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= 0 Y)) (or (not (< thread1Thread1of1ForFork0_x 9995)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19994))), 135554#(and (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19990) (not (< thread1Thread1of1ForFork0_x 10000))) (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 10000)))), 135580#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9993))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19984) (not (< thread1Thread1of1ForFork0_x 9993)))), 135514#(and (or (<= 0 Y) (not (< thread1Thread1of1ForFork0_x 9998))) (or (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19991) (not (< thread1Thread1of1ForFork0_x 9998)))), 135594#(and (or (not (< thread1Thread1of1ForFork0_x 9992)) (<= 0 Y) (not (= X thread1Thread1of1ForFork0_x))) (or (not (< thread1Thread1of1ForFork0_x 9992)) (not (= X thread1Thread1of1ForFork0_x)) (<= (+ Y thread1Thread1of1ForFork0_x thread2Thread1of1ForFork1_x) 19985)))] [2022-03-15 22:38:28,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2022-03-15 22:38:28,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:38:28,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2022-03-15 22:38:28,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2310, Invalid=17712, Unknown=0, NotChecked=0, Total=20022 [2022-03-15 22:38:28,837 INFO L87 Difference]: Start difference. First operand 958 states and 2432 transitions. Second operand has 136 states, 135 states have (on average 2.0074074074074075) internal successors, (271), 135 states have internal predecessors, (271), 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 22:39:57,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 965 states. [2022-03-15 22:39:57,076 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:39:57,083 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 22:39:57,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1171 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 1101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582408 ImplicationChecksByTransitivity, 85.6s TimeCoverageRelationStatistics Valid=209053, Invalid=1006453, Unknown=0, NotChecked=0, Total=1215506 [2022-03-15 22:39:57,099 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 477 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 4719 mSolverCounterSat, 1437 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 6156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1437 IncrementalHoareTripleChecker+Valid, 4719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:39:57,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 18 Invalid, 6156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1437 Valid, 4719 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 22:39:57,100 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2022-03-15 22:39:57,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-03-15 22:39:57,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-03-15 22:39:57,316 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (958states) and FLOYD_HOARE automaton (currently 965 states, 136 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1103 known predicates. [2022-03-15 22:39:57,317 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 22:39:57,317 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 22:39:57,318 INFO L732 BasicCegarLoop]: Path program histogram: [42, 2, 2, 1] [2022-03-15 22:39:57,320 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:39:57,320 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:39:57,321 INFO L202 PluginConnector]: Adding new model easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:39:57 BasicIcfg [2022-03-15 22:39:57,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:39:57,321 INFO L158 Benchmark]: Toolchain (without parser) took 860269.87ms. Allocated memory was 183.5MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 145.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 671.6MB. Max. memory is 8.0GB. [2022-03-15 22:39:57,321 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 183.5MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:39:57,321 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.35ms. Allocated memory is still 183.5MB. Free memory was 144.9MB in the beginning and 143.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:39:57,321 INFO L158 Benchmark]: Boogie Preprocessor took 13.82ms. Allocated memory is still 183.5MB. Free memory was 143.4MB in the beginning and 142.5MB in the end (delta: 919.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:39:57,321 INFO L158 Benchmark]: RCFGBuilder took 165.81ms. Allocated memory is still 183.5MB. Free memory was 142.5MB in the beginning and 134.0MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-03-15 22:39:57,321 INFO L158 Benchmark]: TraceAbstraction took 860067.92ms. Allocated memory was 183.5MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 133.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 660.0MB. Max. memory is 8.0GB. [2022-03-15 22:39:57,322 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.10ms. Allocated memory is still 183.5MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.35ms. Allocated memory is still 183.5MB. Free memory was 144.9MB in the beginning and 143.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.82ms. Allocated memory is still 183.5MB. Free memory was 143.4MB in the beginning and 142.5MB in the end (delta: 919.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 165.81ms. Allocated memory is still 183.5MB. Free memory was 142.5MB in the beginning and 134.0MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 860067.92ms. Allocated memory was 183.5MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 133.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 660.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 28 PlacesBefore, 20 PlacesAfterwards, 23 TransitionsBefore, 15 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 89 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 85, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 44, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 85, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 44, unknown conditional: 0, unknown unconditional: 44] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - 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: 43]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (958states) and FLOYD_HOARE automaton (currently 965 states, 136 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1103 known predicates. - TimeoutResultAtElement [Line: 38]: 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 (958states) and FLOYD_HOARE automaton (currently 965 states, 136 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1103 known predicates. - TimeoutResultAtElement [Line: 38]: 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 (958states) and FLOYD_HOARE automaton (currently 965 states, 136 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1103 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 36 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 860.0s, OverallIterations: 47, TraceHistogramMax: 9, PathProgramHistogramMax: 42, EmptinessCheckTime: 0.1s, AutomataDifference: 769.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12572 SdHoareTripleChecker+Valid, 38.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12572 mSDsluCounter, 690 SdHoareTripleChecker+Invalid, 32.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7360 mSDsCounter, 22141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104470 IncrementalHoareTripleChecker+Invalid, 126611 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22141 mSolverCounterUnsat, 154 mSDtfsCounter, 104470 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18959 GetRequests, 1489 SyntacticMatches, 164 SemanticMatches, 17305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5088165 ImplicationChecksByTransitivity, 745.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1125occurred in iteration=43, InterpolantAutomatonStates: 13803, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 46 MinimizatonAttempts, 52600 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 1744 NumberOfCodeBlocks, 1687 NumberOfCodeBlocksAsserted, 162 NumberOfCheckSat, 2462 ConstructedInterpolants, 0 QuantifiedInterpolants, 17298 SizeOfPredicates, 197 NumberOfNonLiveVariables, 2296 ConjunctsInSsa, 620 ConjunctsInUnsatCore, 133 InterpolantComputations, 5 PerfectInterpolantSequences, 2431/4541 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