/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/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:10:13,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:10:13,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:10:13,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:10:13,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:10:13,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:10:13,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:10:13,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:10:13,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:10:13,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:10:13,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:10:13,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:10:13,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:10:13,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:10:13,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:10:13,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:10:13,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:10:13,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:10:13,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:10:13,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:10:13,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:10:13,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:10:13,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:10:13,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:10:13,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:10:13,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:10:13,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:10:13,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:10:13,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:10:13,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:10:13,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:10:13,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:10:13,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:10:13,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:10:13,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:10:13,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:10:13,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:10:13,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:10:13,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:10:13,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:10:13,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:10:13,642 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 19:10:13,669 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:10:13,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:10:13,670 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:10:13,670 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:10:13,671 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:10:13,671 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:10:13,671 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:10:13,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:10:13,671 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:10:13,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:10:13,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:10:13,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:10:13,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:10:13,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:10:13,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:10:13,672 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:10:13,672 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:10:13,672 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:10:13,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:10:13,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:10:13,673 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:10:13,673 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:10:13,673 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:10:13,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:10:13,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:10:13,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:10:13,673 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:10:13,674 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:10:13,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:10:13,674 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:10:13,674 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:10:13,674 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:10:13,674 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 19:10:13,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:10:13,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:10:13,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:10:13,872 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:10:13,873 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:10:13,874 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2022-03-15 19:10:13,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8cce22fa/595f6a7130ad41ed8d68700d07243106/FLAG48f026ce5 [2022-03-15 19:10:14,252 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:10:14,252 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2022-03-15 19:10:14,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8cce22fa/595f6a7130ad41ed8d68700d07243106/FLAG48f026ce5 [2022-03-15 19:10:14,686 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8cce22fa/595f6a7130ad41ed8d68700d07243106 [2022-03-15 19:10:14,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:10:14,688 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:10:14,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:10:14,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:10:14,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:10:14,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:10:14" (1/1) ... [2022-03-15 19:10:14,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d823b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:14, skipping insertion in model container [2022-03-15 19:10:14,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:10:14" (1/1) ... [2022-03-15 19:10:14,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:10:14,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:10:14,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2022-03-15 19:10:14,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:10:14,861 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:10:14,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2022-03-15 19:10:14,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:10:14,899 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:10:14,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:14 WrapperNode [2022-03-15 19:10:14,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:10:14,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:10:14,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:10:14,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:10:14,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:14" (1/1) ... [2022-03-15 19:10:14,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:14" (1/1) ... [2022-03-15 19:10:14,921 INFO L137 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2022-03-15 19:10:14,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:10:14,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:10:14,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:10:14,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:10:14,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:14" (1/1) ... [2022-03-15 19:10:14,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:14" (1/1) ... [2022-03-15 19:10:14,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:14" (1/1) ... [2022-03-15 19:10:14,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:14" (1/1) ... [2022-03-15 19:10:14,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:14" (1/1) ... [2022-03-15 19:10:14,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:14" (1/1) ... [2022-03-15 19:10:14,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:14" (1/1) ... [2022-03-15 19:10:14,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:10:14,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:10:14,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:10:14,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:10:14,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:14" (1/1) ... [2022-03-15 19:10:14,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:10:14,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:14,971 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 19:10:14,980 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 19:10:15,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:10:15,000 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:10:15,000 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:10:15,000 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:10:15,000 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:10:15,001 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:10:15,001 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:10:15,001 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 19:10:15,001 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 19:10:15,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:10:15,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:10:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:10:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:10:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:10:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:10:15,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:10:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:10:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:10:15,006 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 19:10:15,081 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:10:15,082 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:10:15,275 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:10:15,310 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:10:15,310 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 19:10:15,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:10:15 BoogieIcfgContainer [2022-03-15 19:10:15,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:10:15,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:10:15,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:10:15,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:10:15,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:10:14" (1/3) ... [2022-03-15 19:10:15,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5e1a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:10:15, skipping insertion in model container [2022-03-15 19:10:15,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:14" (2/3) ... [2022-03-15 19:10:15,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5e1a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:10:15, skipping insertion in model container [2022-03-15 19:10:15,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:10:15" (3/3) ... [2022-03-15 19:10:15,319 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2022-03-15 19:10:15,322 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:10:15,322 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:10:15,322 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:10:15,323 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:10:15,372 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,372 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,372 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,372 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,373 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,373 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,373 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,373 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,373 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,373 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,373 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,374 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,374 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,374 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,374 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,374 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,374 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,374 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,374 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,375 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,375 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,375 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,375 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,375 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,375 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,379 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,379 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,379 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,379 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,379 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,379 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,379 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,380 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,380 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,380 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,380 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,380 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,380 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,380 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,380 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,380 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,381 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,381 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,381 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,381 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,382 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,382 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,382 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,382 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,382 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,382 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,383 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,383 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,383 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,387 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,387 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,388 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,388 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,389 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,390 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,392 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,396 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,396 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,396 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,396 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,396 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,397 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,397 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,397 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,399 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,399 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,399 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,399 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,399 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,400 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,400 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,400 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,400 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,400 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,401 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,401 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,401 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,401 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,401 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,401 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,401 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,402 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,402 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,402 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,402 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,402 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,402 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,402 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:15,406 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 19:10:15,463 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:10:15,468 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 19:10:15,468 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 19:10:15,481 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:10:15,487 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 124 transitions, 280 flow [2022-03-15 19:10:15,490 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 124 transitions, 280 flow [2022-03-15 19:10:15,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 124 transitions, 280 flow [2022-03-15 19:10:15,548 INFO L129 PetriNetUnfolder]: 9/120 cut-off events. [2022-03-15 19:10:15,548 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-03-15 19:10:15,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 120 events. 9/120 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 97 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-03-15 19:10:15,557 INFO L116 LiptonReduction]: Number of co-enabled transitions 2520 [2022-03-15 19:10:17,886 INFO L131 LiptonReduction]: Checked pairs total: 2875 [2022-03-15 19:10:17,886 INFO L133 LiptonReduction]: Total number of compositions: 99 [2022-03-15 19:10:17,893 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 34 transitions, 100 flow [2022-03-15 19:10:17,937 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 322 states, 321 states have (on average 4.040498442367602) internal successors, (1297), 321 states have internal predecessors, (1297), 0 states have call successors, (0), 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 19:10:17,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 322 states, 321 states have (on average 4.040498442367602) internal successors, (1297), 321 states have internal predecessors, (1297), 0 states have call successors, (0), 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 19:10:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:10:17,956 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:17,956 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:17,957 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:17,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:17,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1334897354, now seen corresponding path program 1 times [2022-03-15 19:10:17,971 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:17,972 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557613137] [2022-03-15 19:10:17,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:17,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:18,243 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 19:10:18,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:18,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557613137] [2022-03-15 19:10:18,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557613137] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:10:18,244 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:10:18,244 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 19:10:18,245 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1008548669] [2022-03-15 19:10:18,246 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:18,250 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:18,355 INFO L252 McrAutomatonBuilder]: Finished intersection with 322 states and 945 transitions. [2022-03-15 19:10:18,355 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:20,385 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:10:20,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:10:20,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:20,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:10:20,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:10:20,420 INFO L87 Difference]: Start difference. First operand has 322 states, 321 states have (on average 4.040498442367602) internal successors, (1297), 321 states have internal predecessors, (1297), 0 states have call successors, (0), 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 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 19:10:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:20,472 INFO L93 Difference]: Finished difference Result 633 states and 2564 transitions. [2022-03-15 19:10:20,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:10:20,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 19:10:20,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:20,491 INFO L225 Difference]: With dead ends: 633 [2022-03-15 19:10:20,491 INFO L226 Difference]: Without dead ends: 624 [2022-03-15 19:10:20,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:10:20,494 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:20,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:10:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-03-15 19:10:20,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2022-03-15 19:10:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 623 states have (on average 4.070626003210273) internal successors, (2536), 623 states have internal predecessors, (2536), 0 states have call successors, (0), 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 19:10:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 2536 transitions. [2022-03-15 19:10:20,559 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 2536 transitions. Word has length 25 [2022-03-15 19:10:20,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:20,560 INFO L470 AbstractCegarLoop]: Abstraction has 624 states and 2536 transitions. [2022-03-15 19:10:20,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 19:10:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 2536 transitions. [2022-03-15 19:10:20,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:10:20,563 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:20,563 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:20,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:10:20,564 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:20,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:20,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1704111608, now seen corresponding path program 1 times [2022-03-15 19:10:20,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:20,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835958854] [2022-03-15 19:10:20,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:20,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:20,627 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 19:10:20,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:20,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835958854] [2022-03-15 19:10:20,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835958854] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:20,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728817946] [2022-03-15 19:10:20,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:20,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:20,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:20,642 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 19:10:20,672 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 19:10:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:20,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 19:10:20,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:20,796 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 19:10:20,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:20,850 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 19:10:20,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728817946] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:10:20,850 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:10:20,850 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-03-15 19:10:20,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [308106094] [2022-03-15 19:10:20,851 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:20,855 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:20,947 INFO L252 McrAutomatonBuilder]: Finished intersection with 402 states and 1214 transitions. [2022-03-15 19:10:20,947 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:24,150 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [2795#(< |thread2Thread1of1ForFork3_~i~1#1| ~N~0), 2825#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))), 2819#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 2826#(and (or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 2820#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 2818#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0)), 2827#(or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (< 1 ~N~0)), 2821#(or (<= ~N~0 0) (< 1 ~N~0)), 2823#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< 0 ~N~0)), 2822#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 2817#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 2824#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< 0 ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))] [2022-03-15 19:10:24,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:10:24,151 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:24,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:10:24,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:10:24,153 INFO L87 Difference]: Start difference. First operand 624 states and 2536 transitions. Second operand has 17 states, 17 states have (on average 9.352941176470589) internal successors, (159), 17 states have internal predecessors, (159), 0 states have call successors, (0), 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 19:10:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:24,881 INFO L93 Difference]: Finished difference Result 1214 states and 5022 transitions. [2022-03-15 19:10:24,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:10:24,882 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.352941176470589) internal successors, (159), 17 states have internal predecessors, (159), 0 states have call successors, (0), 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 19:10:24,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:24,889 INFO L225 Difference]: With dead ends: 1214 [2022-03-15 19:10:24,889 INFO L226 Difference]: Without dead ends: 1214 [2022-03-15 19:10:24,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 413 SyntacticMatches, 10 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:10:24,890 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 227 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:24,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 228 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:10:24,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2022-03-15 19:10:24,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 874. [2022-03-15 19:10:24,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 4.233676975945017) internal successors, (3696), 873 states have internal predecessors, (3696), 0 states have call successors, (0), 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 19:10:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 3696 transitions. [2022-03-15 19:10:24,915 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 3696 transitions. Word has length 26 [2022-03-15 19:10:24,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:24,916 INFO L470 AbstractCegarLoop]: Abstraction has 874 states and 3696 transitions. [2022-03-15 19:10:24,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.352941176470589) internal successors, (159), 17 states have internal predecessors, (159), 0 states have call successors, (0), 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 19:10:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 3696 transitions. [2022-03-15 19:10:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:10:24,918 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:24,918 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:24,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 19:10:25,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:25,125 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:25,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:25,125 INFO L85 PathProgramCache]: Analyzing trace with hash 780317462, now seen corresponding path program 1 times [2022-03-15 19:10:25,126 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:25,126 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262538836] [2022-03-15 19:10:25,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:25,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:25,198 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 19:10:25,199 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:25,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262538836] [2022-03-15 19:10:25,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262538836] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:10:25,200 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:10:25,200 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:10:25,200 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [653936412] [2022-03-15 19:10:25,200 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:25,203 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:25,265 INFO L252 McrAutomatonBuilder]: Finished intersection with 418 states and 1270 transitions. [2022-03-15 19:10:25,265 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:28,831 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [5830#(or (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 5837#(or (< 0 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 5835#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 5827#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 5831#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 5836#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0)), 5833#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0))), 5826#(< thread3Thread1of1ForFork0_~i~2 ~N~0), 5825#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 5832#(or (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (< 0 ~N~0)), 5828#(< 0 ~N~0), 5829#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (< 0 ~N~0)), 5834#(or (<= ~N~0 0) (< 1 ~N~0))] [2022-03-15 19:10:28,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:10:28,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:28,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:10:28,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:10:28,832 INFO L87 Difference]: Start difference. First operand 874 states and 3696 transitions. Second operand has 18 states, 18 states have (on average 8.833333333333334) internal successors, (159), 18 states have internal predecessors, (159), 0 states have call successors, (0), 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 19:10:29,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:29,311 INFO L93 Difference]: Finished difference Result 1258 states and 5178 transitions. [2022-03-15 19:10:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:10:29,311 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.833333333333334) internal successors, (159), 18 states have internal predecessors, (159), 0 states have call successors, (0), 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 19:10:29,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:29,318 INFO L225 Difference]: With dead ends: 1258 [2022-03-15 19:10:29,319 INFO L226 Difference]: Without dead ends: 1246 [2022-03-15 19:10:29,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 384 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:10:29,321 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 207 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:29,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 179 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:10:29,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2022-03-15 19:10:29,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1156. [2022-03-15 19:10:29,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 4.225108225108225) internal successors, (4880), 1155 states have internal predecessors, (4880), 0 states have call successors, (0), 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 19:10:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 4880 transitions. [2022-03-15 19:10:29,352 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 4880 transitions. Word has length 26 [2022-03-15 19:10:29,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:29,352 INFO L470 AbstractCegarLoop]: Abstraction has 1156 states and 4880 transitions. [2022-03-15 19:10:29,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.833333333333334) internal successors, (159), 18 states have internal predecessors, (159), 0 states have call successors, (0), 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 19:10:29,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 4880 transitions. [2022-03-15 19:10:29,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:10:29,356 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:29,356 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:29,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:10:29,357 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:29,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:29,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1819520651, now seen corresponding path program 1 times [2022-03-15 19:10:29,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:29,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331773078] [2022-03-15 19:10:29,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:29,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:29,429 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 19:10:29,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:29,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331773078] [2022-03-15 19:10:29,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331773078] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:10:29,431 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:10:29,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:10:29,433 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [683877314] [2022-03-15 19:10:29,433 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:29,436 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:29,523 INFO L252 McrAutomatonBuilder]: Finished intersection with 402 states and 1214 transitions. [2022-03-15 19:10:29,523 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:33,117 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [9449#(< 0 ~N~0), 9442#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 9443#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 9440#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 9447#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 9452#(or (= |thread4Thread1of1ForFork2_~i~3#1| 0) (< 0 ~N~0)), 9441#(< |thread4Thread1of1ForFork2_~i~3#1| ~N~0), 9448#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0)), 9446#(or (<= ~N~0 0) (< 1 ~N~0)), 9444#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 9451#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< 0 ~N~0)), 9450#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< 0 ~N~0)), 9445#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= |thread4Thread1of1ForFork2_~i~3#1| 0)))] [2022-03-15 19:10:33,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:10:33,118 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:33,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:10:33,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:10:33,119 INFO L87 Difference]: Start difference. First operand 1156 states and 4880 transitions. Second operand has 18 states, 18 states have (on average 8.88888888888889) internal successors, (160), 18 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:33,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:33,612 INFO L93 Difference]: Finished difference Result 1464 states and 6024 transitions. [2022-03-15 19:10:33,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:10:33,612 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.88888888888889) internal successors, (160), 18 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:10:33,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:33,621 INFO L225 Difference]: With dead ends: 1464 [2022-03-15 19:10:33,621 INFO L226 Difference]: Without dead ends: 1416 [2022-03-15 19:10:33,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 370 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:10:33,624 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 134 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:33,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 190 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:10:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2022-03-15 19:10:33,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1190. [2022-03-15 19:10:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1189 states have (on average 4.179983179142137) internal successors, (4970), 1189 states have internal predecessors, (4970), 0 states have call successors, (0), 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 19:10:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 4970 transitions. [2022-03-15 19:10:33,675 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 4970 transitions. Word has length 26 [2022-03-15 19:10:33,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:33,676 INFO L470 AbstractCegarLoop]: Abstraction has 1190 states and 4970 transitions. [2022-03-15 19:10:33,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.88888888888889) internal successors, (160), 18 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:33,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 4970 transitions. [2022-03-15 19:10:33,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:10:33,686 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:33,686 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:33,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 19:10:33,687 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:33,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:33,687 INFO L85 PathProgramCache]: Analyzing trace with hash 907894187, now seen corresponding path program 1 times [2022-03-15 19:10:33,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:33,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237325900] [2022-03-15 19:10:33,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:33,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:33,731 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 19:10:33,731 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:33,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237325900] [2022-03-15 19:10:33,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237325900] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:10:33,732 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:10:33,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:10:33,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2041588583] [2022-03-15 19:10:33,732 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:33,735 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:33,805 INFO L252 McrAutomatonBuilder]: Finished intersection with 418 states and 1270 transitions. [2022-03-15 19:10:33,806 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:37,726 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [13335#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 13337#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (< 0 ~N~0)), 13334#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 13330#(< |thread2Thread1of1ForFork3_~i~1#1| ~N~0), 13339#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))), 13336#(< 0 ~N~0), 13331#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0)), 13333#(or (<= ~N~0 0) (< 1 ~N~0)), 13338#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< 0 ~N~0)), 13340#(or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (< 0 ~N~0)), 13332#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 13329#(< thread1Thread1of1ForFork1_~i~0 ~N~0)] [2022-03-15 19:10:37,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:10:37,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:37,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:10:37,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:10:37,727 INFO L87 Difference]: Start difference. First operand 1190 states and 4970 transitions. Second operand has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:38,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:38,156 INFO L93 Difference]: Finished difference Result 1184 states and 4902 transitions. [2022-03-15 19:10:38,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:10:38,156 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:10:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:38,165 INFO L225 Difference]: With dead ends: 1184 [2022-03-15 19:10:38,165 INFO L226 Difference]: Without dead ends: 1094 [2022-03-15 19:10:38,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:10:38,166 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 155 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:38,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 150 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:10:38,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2022-03-15 19:10:38,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 852. [2022-03-15 19:10:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 4.216216216216216) internal successors, (3588), 851 states have internal predecessors, (3588), 0 states have call successors, (0), 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 19:10:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 3588 transitions. [2022-03-15 19:10:38,197 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 3588 transitions. Word has length 26 [2022-03-15 19:10:38,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:38,197 INFO L470 AbstractCegarLoop]: Abstraction has 852 states and 3588 transitions. [2022-03-15 19:10:38,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:38,197 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 3588 transitions. [2022-03-15 19:10:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:10:38,200 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:38,200 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:38,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 19:10:38,200 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:38,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:38,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1301659612, now seen corresponding path program 2 times [2022-03-15 19:10:38,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:38,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112792619] [2022-03-15 19:10:38,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:38,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:10:38,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:38,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112792619] [2022-03-15 19:10:38,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112792619] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:10:38,245 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:10:38,245 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:10:38,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2138020923] [2022-03-15 19:10:38,246 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:38,248 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:38,318 INFO L252 McrAutomatonBuilder]: Finished intersection with 482 states and 1483 transitions. [2022-03-15 19:10:38,318 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:41,046 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [16273#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (<= ~N~0 0)), 16265#(or (< 0 ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 16266#(<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)), 16268#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< 0 ~N~0)), 16275#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 16274#(or (= thread1Thread1of1ForFork1_~i~0 0) (< 0 ~N~0)), 16272#(and (or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 16264#(< 0 ~N~0), 16269#(<= ~N~0 1), 16261#(<= ~N~0 thread1Thread1of1ForFork1_~i~0), 16262#(< |thread2Thread1of1ForFork3_~i~1#1| ~N~0), 16263#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 16270#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (<= ~N~0 1)), 16267#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0)), 16271#(<= ~N~0 0)] [2022-03-15 19:10:41,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:10:41,047 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:41,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:10:41,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:10:41,048 INFO L87 Difference]: Start difference. First operand 852 states and 3588 transitions. Second operand has 20 states, 20 states have (on average 8.85) internal successors, (177), 20 states have internal predecessors, (177), 0 states have call successors, (0), 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 19:10:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:41,665 INFO L93 Difference]: Finished difference Result 1512 states and 6340 transitions. [2022-03-15 19:10:41,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:10:41,666 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 8.85) internal successors, (177), 20 states have internal predecessors, (177), 0 states have call successors, (0), 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 19:10:41,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:41,674 INFO L225 Difference]: With dead ends: 1512 [2022-03-15 19:10:41,674 INFO L226 Difference]: Without dead ends: 1460 [2022-03-15 19:10:41,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 448 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=290, Invalid=900, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:10:41,675 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 307 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:41,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 216 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:10:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2022-03-15 19:10:41,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 912. [2022-03-15 19:10:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 911 states have (on average 4.212952799121844) internal successors, (3838), 911 states have internal predecessors, (3838), 0 states have call successors, (0), 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 19:10:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 3838 transitions. [2022-03-15 19:10:41,706 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 3838 transitions. Word has length 27 [2022-03-15 19:10:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:41,706 INFO L470 AbstractCegarLoop]: Abstraction has 912 states and 3838 transitions. [2022-03-15 19:10:41,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.85) internal successors, (177), 20 states have internal predecessors, (177), 0 states have call successors, (0), 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 19:10:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 3838 transitions. [2022-03-15 19:10:41,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:10:41,710 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:41,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:41,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 19:10:41,710 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:41,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:41,711 INFO L85 PathProgramCache]: Analyzing trace with hash -837850089, now seen corresponding path program 1 times [2022-03-15 19:10:41,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:41,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636765632] [2022-03-15 19:10:41,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:41,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:10:41,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:41,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636765632] [2022-03-15 19:10:41,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636765632] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:41,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814358833] [2022-03-15 19:10:41,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:41,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:41,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:41,761 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:10:41,762 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 19:10:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:41,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 19:10:41,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:10:41,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:41,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:10:41,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814358833] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:10:41,902 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:10:41,902 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-03-15 19:10:41,903 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1708473331] [2022-03-15 19:10:41,903 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:41,905 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:41,957 INFO L252 McrAutomatonBuilder]: Finished intersection with 380 states and 1120 transitions. [2022-03-15 19:10:41,957 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:45,037 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [19826#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 19824#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 19831#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< 0 ~N~0)), 19821#(< |thread2Thread1of1ForFork3_~i~1#1| ~N~0), 19829#(and (or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 0)) (or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< thread3Thread1of1ForFork0_~i~2 ~N~0))), 19823#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (< 0 ~N~0)), 19787#(< thread3Thread1of1ForFork0_~i~2 ~N~0), 19828#(and (or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)) (or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0))), 19825#(or (<= ~N~0 0) (< 1 ~N~0)), 19822#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 19830#(or (<= ~N~0 0) (< 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 19827#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 0) (< 1 ~N~0))] [2022-03-15 19:10:45,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:10:45,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:45,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:10:45,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:10:45,039 INFO L87 Difference]: Start difference. First operand 912 states and 3838 transitions. Second operand has 17 states, 17 states have (on average 9.529411764705882) internal successors, (162), 17 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:45,659 INFO L93 Difference]: Finished difference Result 1838 states and 7872 transitions. [2022-03-15 19:10:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:10:45,659 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.529411764705882) internal successors, (162), 17 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:10:45,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:45,668 INFO L225 Difference]: With dead ends: 1838 [2022-03-15 19:10:45,668 INFO L226 Difference]: Without dead ends: 1838 [2022-03-15 19:10:45,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 387 SyntacticMatches, 15 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:10:45,669 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 171 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:45,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 224 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:10:45,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-03-15 19:10:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1222. [2022-03-15 19:10:45,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 1221 states have (on average 4.327600327600328) internal successors, (5284), 1221 states have internal predecessors, (5284), 0 states have call successors, (0), 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 19:10:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 5284 transitions. [2022-03-15 19:10:45,697 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 5284 transitions. Word has length 27 [2022-03-15 19:10:45,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:45,698 INFO L470 AbstractCegarLoop]: Abstraction has 1222 states and 5284 transitions. [2022-03-15 19:10:45,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.529411764705882) internal successors, (162), 17 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:45,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 5284 transitions. [2022-03-15 19:10:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:10:45,701 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:45,701 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:45,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 19:10:45,915 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,SelfDestructingSolverStorable6 [2022-03-15 19:10:45,915 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:45,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:45,916 INFO L85 PathProgramCache]: Analyzing trace with hash -355401931, now seen corresponding path program 1 times [2022-03-15 19:10:45,917 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:45,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779442361] [2022-03-15 19:10:45,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:45,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:10:45,950 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:45,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779442361] [2022-03-15 19:10:45,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779442361] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:45,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457794777] [2022-03-15 19:10:45,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:45,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:45,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:45,952 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 19:10:45,953 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 19:10:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:46,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 19:10:46,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:10:46,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:10:46,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457794777] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:10:46,099 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:10:46,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-03-15 19:10:46,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [265707531] [2022-03-15 19:10:46,099 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:46,102 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:46,182 INFO L252 McrAutomatonBuilder]: Finished intersection with 494 states and 1506 transitions. [2022-03-15 19:10:46,182 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:50,337 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [24317#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (< 0 ~N~0)), 24321#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 24268#(< |thread4Thread1of1ForFork2_~i~3#1| ~N~0), 24316#(and (or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0)) (or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= |thread4Thread1of1ForFork2_~i~3#1| 0))), 24323#(or (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (< 1 ~N~0)), 24314#(< |thread2Thread1of1ForFork3_~i~1#1| ~N~0), 24318#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 24324#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< 0 ~N~0)), 24322#(and (or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)) (or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|))), 24319#(or (<= ~N~0 0) (< 1 ~N~0)), 24315#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0)), 24320#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|))] [2022-03-15 19:10:50,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:10:50,338 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:50,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:10:50,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:10:50,339 INFO L87 Difference]: Start difference. First operand 1222 states and 5284 transitions. Second operand has 17 states, 17 states have (on average 10.117647058823529) internal successors, (172), 17 states have internal predecessors, (172), 0 states have call successors, (0), 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 19:10:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:50,848 INFO L93 Difference]: Finished difference Result 2190 states and 9600 transitions. [2022-03-15 19:10:50,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:10:50,849 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 10.117647058823529) internal successors, (172), 17 states have internal predecessors, (172), 0 states have call successors, (0), 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 19:10:50,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:50,860 INFO L225 Difference]: With dead ends: 2190 [2022-03-15 19:10:50,860 INFO L226 Difference]: Without dead ends: 2190 [2022-03-15 19:10:50,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 497 SyntacticMatches, 20 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:10:50,861 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 171 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:50,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 189 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:10:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2022-03-15 19:10:50,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 1510. [2022-03-15 19:10:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1509 states have (on average 4.491053677932405) internal successors, (6777), 1509 states have internal predecessors, (6777), 0 states have call successors, (0), 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 19:10:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 6777 transitions. [2022-03-15 19:10:50,900 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 6777 transitions. Word has length 28 [2022-03-15 19:10:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:50,900 INFO L470 AbstractCegarLoop]: Abstraction has 1510 states and 6777 transitions. [2022-03-15 19:10:50,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.117647058823529) internal successors, (172), 17 states have internal predecessors, (172), 0 states have call successors, (0), 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 19:10:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 6777 transitions. [2022-03-15 19:10:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:10:50,904 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:50,905 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:50,925 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 19:10:51,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:51,115 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:51,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:51,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1514545434, now seen corresponding path program 2 times [2022-03-15 19:10:51,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:51,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430970359] [2022-03-15 19:10:51,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:51,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:10:51,168 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:51,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430970359] [2022-03-15 19:10:51,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430970359] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:10:51,168 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:10:51,168 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:10:51,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1583157241] [2022-03-15 19:10:51,168 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:51,171 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:51,261 INFO L252 McrAutomatonBuilder]: Finished intersection with 490 states and 1476 transitions. [2022-03-15 19:10:51,261 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:54,180 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [29578#(<= ~N~0 0), 29579#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 0)), 29582#(= thread3Thread1of1ForFork0_~i~2 0), 29581#(or (= thread1Thread1of1ForFork1_~i~0 0) (< 0 ~N~0)), 29574#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 29571#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 29572#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 29576#(< 0 ~N~0), 29575#(and (or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 0))), 29577#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< 0 ~N~0)), 29573#(<= ~N~0 thread1Thread1of1ForFork1_~i~0), 29580#(or (< 0 ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 29570#(< thread3Thread1of1ForFork0_~i~2 ~N~0)] [2022-03-15 19:10:54,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:10:54,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:54,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:10:54,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:10:54,181 INFO L87 Difference]: Start difference. First operand 1510 states and 6777 transitions. Second operand has 18 states, 18 states have (on average 9.11111111111111) internal successors, (164), 18 states have internal predecessors, (164), 0 states have call successors, (0), 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 19:10:54,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:54,513 INFO L93 Difference]: Finished difference Result 1674 states and 7321 transitions. [2022-03-15 19:10:54,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:10:54,514 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 9.11111111111111) internal successors, (164), 18 states have internal predecessors, (164), 0 states have call successors, (0), 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 19:10:54,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:54,522 INFO L225 Difference]: With dead ends: 1674 [2022-03-15 19:10:54,522 INFO L226 Difference]: Without dead ends: 1582 [2022-03-15 19:10:54,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 450 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:10:54,523 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 186 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:54,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 175 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:10:54,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2022-03-15 19:10:54,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1296. [2022-03-15 19:10:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1295 states have (on average 4.341312741312741) internal successors, (5622), 1295 states have internal predecessors, (5622), 0 states have call successors, (0), 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 19:10:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 5622 transitions. [2022-03-15 19:10:54,559 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 5622 transitions. Word has length 28 [2022-03-15 19:10:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:54,560 INFO L470 AbstractCegarLoop]: Abstraction has 1296 states and 5622 transitions. [2022-03-15 19:10:54,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.11111111111111) internal successors, (164), 18 states have internal predecessors, (164), 0 states have call successors, (0), 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 19:10:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 5622 transitions. [2022-03-15 19:10:54,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:10:54,563 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:54,563 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:54,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 19:10:54,563 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:54,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:54,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1929804338, now seen corresponding path program 1 times [2022-03-15 19:10:54,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:54,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521784109] [2022-03-15 19:10:54,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:54,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:54,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:54,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521784109] [2022-03-15 19:10:54,668 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521784109] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:54,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344416440] [2022-03-15 19:10:54,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:54,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:54,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:54,669 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 19:10:54,670 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 19:10:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:54,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:10:54,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:54,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:54,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344416440] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:10:54,941 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:10:54,941 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2022-03-15 19:10:54,941 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [46793577] [2022-03-15 19:10:54,941 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:54,943 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:55,036 INFO L252 McrAutomatonBuilder]: Finished intersection with 548 states and 1648 transitions. [2022-03-15 19:10:55,036 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:11:04,970 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [34045#(and (or (<= ~counter1~0 0) (< ~counter2~0 ~counter1~0)) (or (<= ~counter1~0 (+ ~counter2~0 1)) (<= ~counter1~0 0))), 34053#(and (or (< ~counter2~0 (+ ~counter1~0 1)) (<= (+ ~counter1~0 1) 0)) (or (<= (+ ~counter2~0 1) 0) (<= ~counter1~0 ~counter2~0))), 34054#(and (or (<= (+ ~counter1~0 1) 0) (<= ~counter1~0 ~counter2~0)) (or (<= (+ ~counter1~0 1) 0) (= ~counter2~0 0))), 34044#(and (or (<= (+ ~counter2~0 1) 0) (< ~counter2~0 (+ ~counter1~0 1))) (or (<= (+ ~counter2~0 1) 0) (<= ~counter1~0 ~counter2~0))), 34049#(and (or (<= (+ ~counter1~0 1) ~counter2~0) (<= ~counter2~0 0)) (or (<= (+ ~counter1~0 1) 0) (< ~counter2~0 (+ 2 ~counter1~0)))), 34046#(and (or (<= ~counter1~0 ~counter2~0) (<= ~counter2~0 0)) (or (<= ~counter1~0 0) (< ~counter2~0 (+ ~counter1~0 1)))), 34047#(and (or (<= ~counter1~0 0) (<= ~counter1~0 ~counter2~0)) (or (<= ~counter1~0 0) (< ~counter2~0 (+ ~counter1~0 1)))), 34043#(and (or (<= (+ ~counter1~0 1) ~counter2~0) (<= ~counter2~0 0)) (or (< ~counter2~0 (+ 2 ~counter1~0)) (<= ~counter2~0 0))), 34050#(and (or (<= (+ ~counter1~0 1) 0) (< ~counter2~0 (+ 2 ~counter1~0))) (or (<= (+ ~counter1~0 1) ~counter2~0) (<= (+ ~counter1~0 1) 0))), 34052#(and (or (<= ~counter1~0 (+ ~counter2~0 1)) (<= ~counter1~0 0)) (or (<= ~counter1~0 0) (= ~counter2~0 0))), 34051#(and (or (<= ~counter1~0 0) (< ~counter2~0 ~counter1~0)) (or (<= ~counter1~0 (+ ~counter2~0 1)) (<= (+ ~counter2~0 1) 0))), 34048#(and (or (<= (+ ~counter1~0 1) 0) (<= ~counter1~0 ~counter2~0)) (or (< ~counter2~0 (+ ~counter1~0 1)) (<= (+ ~counter1~0 1) 0)))] [2022-03-15 19:11:04,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:11:04,970 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:11:04,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:11:04,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:11:04,971 INFO L87 Difference]: Start difference. First operand 1296 states and 5622 transitions. Second operand has 18 states, 17 states have (on average 8.882352941176471) internal successors, (151), 17 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 19:11:05,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:11:05,299 INFO L93 Difference]: Finished difference Result 4599 states and 18508 transitions. [2022-03-15 19:11:05,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:11:05,300 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 8.882352941176471) internal successors, (151), 17 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 29 [2022-03-15 19:11:05,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:11:05,314 INFO L225 Difference]: With dead ends: 4599 [2022-03-15 19:11:05,314 INFO L226 Difference]: Without dead ends: 4389 [2022-03-15 19:11:05,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 542 SyntacticMatches, 19 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:11:05,315 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 477 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:11:05,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 78 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:11:05,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4389 states. [2022-03-15 19:11:05,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4389 to 3110. [2022-03-15 19:11:05,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3110 states, 3109 states have (on average 4.406561595368285) internal successors, (13700), 3109 states have internal predecessors, (13700), 0 states have call successors, (0), 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 19:11:05,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 13700 transitions. [2022-03-15 19:11:05,397 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 13700 transitions. Word has length 29 [2022-03-15 19:11:05,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:11:05,398 INFO L470 AbstractCegarLoop]: Abstraction has 3110 states and 13700 transitions. [2022-03-15 19:11:05,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 8.882352941176471) internal successors, (151), 17 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 19:11:05,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 13700 transitions. [2022-03-15 19:11:05,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:11:05,407 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:11:05,407 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:11:05,439 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 19:11:05,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:05,619 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:11:05,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:11:05,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1902441924, now seen corresponding path program 2 times [2022-03-15 19:11:05,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:11:05,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322556523] [2022-03-15 19:11:05,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:11:05,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:11:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:11:05,650 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:11:05,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322556523] [2022-03-15 19:11:05,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322556523] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:11:05,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756322099] [2022-03-15 19:11:05,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:11:05,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:05,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:11:05,651 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 19:11:05,652 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 19:11:05,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:11:05,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:11:05,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 19:11:05,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:11:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:11:05,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:11:05,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756322099] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:11:05,786 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:11:05,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-03-15 19:11:05,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1169673381] [2022-03-15 19:11:05,788 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:05,791 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:05,952 INFO L252 McrAutomatonBuilder]: Finished intersection with 638 states and 1986 transitions. [2022-03-15 19:11:05,952 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:11:10,985 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [44975#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (< 0 ~N~0)), 44978#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< 0 ~N~0)), 44984#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 1) (< 2 ~N~0)), 44980#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0)), 44985#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 0)), 44986#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< 0 ~N~0)), 44977#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 44973#(< |thread2Thread1of1ForFork3_~i~1#1| ~N~0), 44979#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 44972#(< |thread4Thread1of1ForFork2_~i~3#1| ~N~0), 44883#(<= 1 ~N~0), 44987#(or (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (< 0 ~N~0)), 44974#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0)), 44983#(<= ~N~0 0), 44976#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 44981#(and (or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 0)) (or (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0))), 44982#(or (<= ~N~0 1) (< 2 ~N~0)), 44988#(<= |thread4Thread1of1ForFork2_~i~3#1| 0)] [2022-03-15 19:11:10,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:11:10,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:11:10,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:11:10,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:11:10,986 INFO L87 Difference]: Start difference. First operand 3110 states and 13700 transitions. Second operand has 23 states, 23 states have (on average 9.130434782608695) internal successors, (210), 23 states have internal predecessors, (210), 0 states have call successors, (0), 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 19:11:11,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:11:11,763 INFO L93 Difference]: Finished difference Result 5748 states and 25754 transitions. [2022-03-15 19:11:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:11:11,767 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.130434782608695) internal successors, (210), 23 states have internal predecessors, (210), 0 states have call successors, (0), 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 29 [2022-03-15 19:11:11,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:11:11,787 INFO L225 Difference]: With dead ends: 5748 [2022-03-15 19:11:11,788 INFO L226 Difference]: Without dead ends: 5556 [2022-03-15 19:11:11,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 679 GetRequests, 606 SyntacticMatches, 31 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=416, Invalid=1476, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:11:11,789 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 337 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:11:11,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 192 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:11:11,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5556 states. [2022-03-15 19:11:11,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5556 to 3922. [2022-03-15 19:11:11,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3922 states, 3921 states have (on average 4.601632236674318) internal successors, (18043), 3921 states have internal predecessors, (18043), 0 states have call successors, (0), 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 19:11:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 18043 transitions. [2022-03-15 19:11:11,900 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 18043 transitions. Word has length 29 [2022-03-15 19:11:11,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:11:11,900 INFO L470 AbstractCegarLoop]: Abstraction has 3922 states and 18043 transitions. [2022-03-15 19:11:11,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.130434782608695) internal successors, (210), 23 states have internal predecessors, (210), 0 states have call successors, (0), 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 19:11:11,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 18043 transitions. [2022-03-15 19:11:11,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:11:11,910 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:11:11,910 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:11:11,931 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 19:11:12,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 19:11:12,129 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:11:12,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:11:12,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1593243232, now seen corresponding path program 2 times [2022-03-15 19:11:12,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:11:12,130 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068477177] [2022-03-15 19:11:12,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:11:12,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:11:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:12,172 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 19:11:12,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:11:12,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068477177] [2022-03-15 19:11:12,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068477177] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:11:12,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345809006] [2022-03-15 19:11:12,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:11:12,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:12,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:11:12,179 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 19:11:12,180 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 19:11:12,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:11:12,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:11:12,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:11:12,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:11:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:11:12,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:11:12,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:11:12,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345809006] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:11:12,419 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:11:12,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-03-15 19:11:12,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1553191329] [2022-03-15 19:11:12,419 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:12,422 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:12,534 INFO L252 McrAutomatonBuilder]: Finished intersection with 618 states and 1874 transitions. [2022-03-15 19:11:12,535 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:11:20,605 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [58826#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0)), 58832#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 58830#(or (<= (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 58824#(or (<= (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 58837#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 2 ~N~0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0))), 58827#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 58831#(or (<= ~N~0 0) (<= 2 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 58828#(or (<= ~N~0 0) (<= 2 ~N~0)), 58838#(or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 1) (< 2 ~N~0)), 58829#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (<= 2 ~N~0)), 58833#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 0) (<= 2 ~N~0)), 58835#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 2 ~N~0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))), 58834#(or (<= (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (<= ~N~0 1) (< 2 ~N~0)), 58825#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 58836#(and (or (<= 2 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)))] [2022-03-15 19:11:20,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:11:20,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:11:20,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:11:20,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:11:20,606 INFO L87 Difference]: Start difference. First operand 3922 states and 18043 transitions. Second operand has 22 states, 22 states have (on average 9.636363636363637) internal successors, (212), 22 states have internal predecessors, (212), 0 states have call successors, (0), 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 19:11:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:11:22,414 INFO L93 Difference]: Finished difference Result 14774 states and 68358 transitions. [2022-03-15 19:11:22,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 19:11:22,414 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.636363636363637) internal successors, (212), 22 states have internal predecessors, (212), 0 states have call successors, (0), 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 30 [2022-03-15 19:11:22,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:11:22,477 INFO L225 Difference]: With dead ends: 14774 [2022-03-15 19:11:22,477 INFO L226 Difference]: Without dead ends: 14614 [2022-03-15 19:11:22,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 714 GetRequests, 642 SyntacticMatches, 16 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=672, Invalid=2634, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 19:11:22,479 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 313 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 1839 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:11:22,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 307 Invalid, 1906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1839 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:11:22,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14614 states. [2022-03-15 19:11:22,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14614 to 7520. [2022-03-15 19:11:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7520 states, 7519 states have (on average 4.9075674956776165) internal successors, (36900), 7519 states have internal predecessors, (36900), 0 states have call successors, (0), 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 19:11:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7520 states to 7520 states and 36900 transitions. [2022-03-15 19:11:22,760 INFO L78 Accepts]: Start accepts. Automaton has 7520 states and 36900 transitions. Word has length 30 [2022-03-15 19:11:22,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:11:22,760 INFO L470 AbstractCegarLoop]: Abstraction has 7520 states and 36900 transitions. [2022-03-15 19:11:22,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.636363636363637) internal successors, (212), 22 states have internal predecessors, (212), 0 states have call successors, (0), 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 19:11:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 7520 states and 36900 transitions. [2022-03-15 19:11:22,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:11:22,779 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:11:22,779 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:11:22,801 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 19:11:22,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:22,992 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:11:22,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:11:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1593254456, now seen corresponding path program 3 times [2022-03-15 19:11:22,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:11:22,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141678426] [2022-03-15 19:11:22,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:11:22,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:11:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:23,037 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 19:11:23,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:11:23,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141678426] [2022-03-15 19:11:23,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141678426] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:11:23,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479670074] [2022-03-15 19:11:23,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:11:23,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:23,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:11:23,038 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 19:11:23,039 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 19:11:23,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:11:23,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:11:23,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:11:23,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:11:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:11:23,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:11:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:11:23,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479670074] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:11:23,226 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:11:23,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-03-15 19:11:23,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [282680232] [2022-03-15 19:11:23,226 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:23,229 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:23,349 INFO L252 McrAutomatonBuilder]: Finished intersection with 640 states and 1950 transitions. [2022-03-15 19:11:23,349 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:11:29,385 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [88937#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 88939#(or (<= ~N~0 0) (< 1 ~N~0)), 88948#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 1) (< 2 ~N~0)), 88940#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 88943#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 88951#(or (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 88938#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 88956#(and (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 88941#(or (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 88955#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 88935#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 88934#(< thread3Thread1of1ForFork0_~i~2 ~N~0), 88942#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 88958#(or (<= ~N~0 0) (< 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 88945#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 88953#(or (<= ~N~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 88949#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 1)), 88954#(or (<= ~N~0 0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 88946#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)))), 88944#(or (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 88952#(or (<= ~N~0 1) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< 2 ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 88950#(or (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 88959#(or (<= ~N~0 1) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 88936#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 88957#(or (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 88947#(or (<= ~N~0 1) (< 2 ~N~0))] [2022-03-15 19:11:29,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:11:29,386 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:11:29,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:11:29,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1369, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:11:29,386 INFO L87 Difference]: Start difference. First operand 7520 states and 36900 transitions. Second operand has 33 states, 33 states have (on average 7.878787878787879) internal successors, (260), 33 states have internal predecessors, (260), 0 states have call successors, (0), 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 19:11:30,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:11:30,704 INFO L93 Difference]: Finished difference Result 11072 states and 53082 transitions. [2022-03-15 19:11:30,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 19:11:30,704 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.878787878787879) internal successors, (260), 33 states have internal predecessors, (260), 0 states have call successors, (0), 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 30 [2022-03-15 19:11:30,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:11:30,738 INFO L225 Difference]: With dead ends: 11072 [2022-03-15 19:11:30,738 INFO L226 Difference]: Without dead ends: 10936 [2022-03-15 19:11:30,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 726 GetRequests, 655 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=777, Invalid=3513, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 19:11:30,739 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 487 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 2272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:11:30,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [487 Valid, 526 Invalid, 2272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2181 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:11:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10936 states. [2022-03-15 19:11:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10936 to 7968. [2022-03-15 19:11:30,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7968 states, 7967 states have (on average 4.867202209112589) internal successors, (38777), 7967 states have internal predecessors, (38777), 0 states have call successors, (0), 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 19:11:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7968 states to 7968 states and 38777 transitions. [2022-03-15 19:11:30,970 INFO L78 Accepts]: Start accepts. Automaton has 7968 states and 38777 transitions. Word has length 30 [2022-03-15 19:11:30,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:11:30,971 INFO L470 AbstractCegarLoop]: Abstraction has 7968 states and 38777 transitions. [2022-03-15 19:11:30,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.878787878787879) internal successors, (260), 33 states have internal predecessors, (260), 0 states have call successors, (0), 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 19:11:30,971 INFO L276 IsEmpty]: Start isEmpty. Operand 7968 states and 38777 transitions. [2022-03-15 19:11:30,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:11:30,991 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:11:30,991 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:11:31,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-15 19:11:31,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:31,195 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:11:31,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:11:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1749003861, now seen corresponding path program 4 times [2022-03-15 19:11:31,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:11:31,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847815841] [2022-03-15 19:11:31,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:11:31,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:11:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:31,232 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 19:11:31,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:11:31,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847815841] [2022-03-15 19:11:31,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847815841] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:11:31,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264696456] [2022-03-15 19:11:31,232 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:11:31,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:31,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:11:31,233 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 19:11:31,234 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 19:11:31,295 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:11:31,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:11:31,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:11:31,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:11:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:11:31,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:11:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:11:31,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264696456] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:11:31,392 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:11:31,392 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 19:11:31,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [361879071] [2022-03-15 19:11:31,392 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:31,395 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:31,538 INFO L252 McrAutomatonBuilder]: Finished intersection with 618 states and 1874 transitions. [2022-03-15 19:11:31,538 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:11:39,405 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [116245#(or (<= ~N~0 0) (< 1 ~N~0)), 116234#(or (<= ~N~0 1) (< 2 ~N~0)), 116248#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (<= ~N~0 0) (<= ~N~0 (+ |thread4Thread1of1ForFork2_~i~3#1| 1)) (< 1 ~N~0)), 116255#(or (<= ~N~0 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< 1 ~N~0)), 116242#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 116239#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 1) (< 2 ~N~0)), 116240#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 116233#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (<= ~N~0 (+ |thread4Thread1of1ForFork2_~i~3#1| 1))), 116235#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 116244#(or (<= ~N~0 1) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< 2 ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 116249#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 116247#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< 1 ~N~0)), 116256#(or (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (< 1 ~N~0)), 116254#(or (<= ~N~0 1) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 116252#(or (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 116241#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 116246#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 116231#(< |thread4Thread1of1ForFork2_~i~3#1| ~N~0), 116250#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 1)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= |thread4Thread1of1ForFork2_~i~3#1| 0))), 116251#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 1)), 116237#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 116238#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (<= ~N~0 (+ |thread4Thread1of1ForFork2_~i~3#1| 1))), 116236#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 116243#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (<= ~N~0 (+ |thread4Thread1of1ForFork2_~i~3#1| 1)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 116253#(and (or (= |thread4Thread1of1ForFork2_~i~3#1| 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 1) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 116232#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|))] [2022-03-15 19:11:39,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:11:39,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:11:39,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:11:39,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:11:39,406 INFO L87 Difference]: Start difference. First operand 7968 states and 38777 transitions. Second operand has 33 states, 33 states have (on average 8.030303030303031) internal successors, (265), 33 states have internal predecessors, (265), 0 states have call successors, (0), 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 19:11:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:11:40,754 INFO L93 Difference]: Finished difference Result 9814 states and 46037 transitions. [2022-03-15 19:11:40,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 19:11:40,755 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.030303030303031) internal successors, (265), 33 states have internal predecessors, (265), 0 states have call successors, (0), 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 30 [2022-03-15 19:11:40,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:11:40,781 INFO L225 Difference]: With dead ends: 9814 [2022-03-15 19:11:40,782 INFO L226 Difference]: Without dead ends: 9740 [2022-03-15 19:11:40,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 637 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=800, Invalid=3106, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 19:11:40,783 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 352 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 2749 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 2801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:11:40,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 551 Invalid, 2801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2749 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:11:40,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9740 states. [2022-03-15 19:11:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9740 to 7946. [2022-03-15 19:11:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7946 states, 7945 states have (on average 4.842794210195091) internal successors, (38476), 7945 states have internal predecessors, (38476), 0 states have call successors, (0), 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 19:11:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7946 states to 7946 states and 38476 transitions. [2022-03-15 19:11:40,976 INFO L78 Accepts]: Start accepts. Automaton has 7946 states and 38476 transitions. Word has length 30 [2022-03-15 19:11:40,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:11:40,977 INFO L470 AbstractCegarLoop]: Abstraction has 7946 states and 38476 transitions. [2022-03-15 19:11:40,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.030303030303031) internal successors, (265), 33 states have internal predecessors, (265), 0 states have call successors, (0), 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 19:11:40,977 INFO L276 IsEmpty]: Start isEmpty. Operand 7946 states and 38476 transitions. [2022-03-15 19:11:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:11:40,995 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:11:40,995 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:11:41,012 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 19:11:41,211 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,SelfDestructingSolverStorable13 [2022-03-15 19:11:41,211 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:11:41,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:11:41,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1328572659, now seen corresponding path program 5 times [2022-03-15 19:11:41,212 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:11:41,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009064857] [2022-03-15 19:11:41,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:11:41,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:11:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:41,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:11:41,267 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:11:41,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009064857] [2022-03-15 19:11:41,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009064857] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:11:41,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497470170] [2022-03-15 19:11:41,268 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:11:41,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:41,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:11:41,269 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 19:11:41,271 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 19:11:41,351 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:11:41,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:11:41,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:11:41,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:11:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:11:41,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:11:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:11:41,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497470170] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:11:41,444 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:11:41,444 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 9 [2022-03-15 19:11:41,444 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1457452827] [2022-03-15 19:11:41,444 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:41,447 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:41,547 INFO L252 McrAutomatonBuilder]: Finished intersection with 640 states and 1950 transitions. [2022-03-15 19:11:41,547 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:11:49,149 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [142235#(or (<= ~N~0 1) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< 2 ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 142239#(and (or (<= ~N~0 1) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 142228#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 142225#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 142227#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0)), 142229#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 142231#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 142230#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 142224#(< |thread2Thread1of1ForFork3_~i~1#1| ~N~0), 142238#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 1)), 142233#(or (<= ~N~0 1) (< 2 ~N~0)), 142240#(or (<= ~N~0 1) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 142232#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 142226#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 142241#(or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (< 1 ~N~0)), 142234#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 1) (< 2 ~N~0)), 142236#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 142237#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 1)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)))] [2022-03-15 19:11:49,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:11:49,149 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:11:49,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:11:49,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:11:49,150 INFO L87 Difference]: Start difference. First operand 7946 states and 38476 transitions. Second operand has 25 states, 25 states have (on average 10.64) internal successors, (266), 25 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:11:50,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:11:50,121 INFO L93 Difference]: Finished difference Result 13774 states and 64770 transitions. [2022-03-15 19:11:50,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:11:50,121 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.64) internal successors, (266), 25 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:11:50,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:11:50,160 INFO L225 Difference]: With dead ends: 13774 [2022-03-15 19:11:50,160 INFO L226 Difference]: Without dead ends: 13436 [2022-03-15 19:11:50,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 714 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=414, Invalid=1748, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:11:50,161 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 418 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:11:50,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 232 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:11:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13436 states. [2022-03-15 19:11:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13436 to 7650. [2022-03-15 19:11:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7650 states, 7649 states have (on average 4.865472610798797) internal successors, (37216), 7649 states have internal predecessors, (37216), 0 states have call successors, (0), 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 19:11:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7650 states to 7650 states and 37216 transitions. [2022-03-15 19:11:50,377 INFO L78 Accepts]: Start accepts. Automaton has 7650 states and 37216 transitions. Word has length 30 [2022-03-15 19:11:50,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:11:50,377 INFO L470 AbstractCegarLoop]: Abstraction has 7650 states and 37216 transitions. [2022-03-15 19:11:50,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.64) internal successors, (266), 25 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:11:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 7650 states and 37216 transitions. [2022-03-15 19:11:50,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:11:50,396 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:11:50,396 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:11:50,416 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 19:11:50,609 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,SelfDestructingSolverStorable14 [2022-03-15 19:11:50,609 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:11:50,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:11:50,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1719393148, now seen corresponding path program 6 times [2022-03-15 19:11:50,610 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:11:50,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341671800] [2022-03-15 19:11:50,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:11:50,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:11:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:50,654 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 19:11:50,654 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:11:50,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341671800] [2022-03-15 19:11:50,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341671800] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:11:50,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319587055] [2022-03-15 19:11:50,654 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:11:50,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:50,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:11:50,660 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 19:11:50,691 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 19:11:50,764 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:11:50,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:11:50,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:11:50,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:11:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:11:50,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:11:50,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:11:50,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319587055] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:11:50,870 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:11:50,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-03-15 19:11:50,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2083131457] [2022-03-15 19:11:50,870 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:50,874 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:50,995 INFO L252 McrAutomatonBuilder]: Finished intersection with 498 states and 1450 transitions. [2022-03-15 19:11:50,995 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:11:56,442 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [171565#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 171570#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (<= ~N~0 1) (< 2 ~N~0)), 171571#(or (<= ~N~0 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< 1 ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 171574#(or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 171572#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 171566#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0)), 171573#(and (or (<= 0 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 171567#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 171568#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 171564#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 171569#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 171563#(< |thread2Thread1of1ForFork3_~i~1#1| ~N~0)] [2022-03-15 19:11:56,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:11:56,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:11:56,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:11:56,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:11:56,443 INFO L87 Difference]: Start difference. First operand 7650 states and 37216 transitions. Second operand has 19 states, 19 states have (on average 9.368421052631579) internal successors, (178), 19 states have internal predecessors, (178), 0 states have call successors, (0), 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 19:11:57,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:11:57,416 INFO L93 Difference]: Finished difference Result 15640 states and 73204 transitions. [2022-03-15 19:11:57,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:11:57,417 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 9.368421052631579) internal successors, (178), 19 states have internal predecessors, (178), 0 states have call successors, (0), 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 30 [2022-03-15 19:11:57,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:11:57,465 INFO L225 Difference]: With dead ends: 15640 [2022-03-15 19:11:57,466 INFO L226 Difference]: Without dead ends: 15454 [2022-03-15 19:11:57,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=462, Invalid=1700, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:11:57,467 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 231 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:11:57,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 226 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:11:57,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15454 states. [2022-03-15 19:11:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15454 to 9356. [2022-03-15 19:11:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9356 states, 9355 states have (on average 4.935221806520577) internal successors, (46169), 9355 states have internal predecessors, (46169), 0 states have call successors, (0), 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 19:11:57,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9356 states to 9356 states and 46169 transitions. [2022-03-15 19:11:57,738 INFO L78 Accepts]: Start accepts. Automaton has 9356 states and 46169 transitions. Word has length 30 [2022-03-15 19:11:57,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:11:57,738 INFO L470 AbstractCegarLoop]: Abstraction has 9356 states and 46169 transitions. [2022-03-15 19:11:57,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.368421052631579) internal successors, (178), 19 states have internal predecessors, (178), 0 states have call successors, (0), 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 19:11:57,738 INFO L276 IsEmpty]: Start isEmpty. Operand 9356 states and 46169 transitions. [2022-03-15 19:11:57,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:11:57,760 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:11:57,761 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:11:57,777 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 19:11:57,961 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,SelfDestructingSolverStorable15 [2022-03-15 19:11:57,961 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:11:57,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:11:57,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1702613621, now seen corresponding path program 7 times [2022-03-15 19:11:57,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:11:57,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684131790] [2022-03-15 19:11:57,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:11:57,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:11:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:58,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:11:58,018 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:11:58,018 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684131790] [2022-03-15 19:11:58,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684131790] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:11:58,018 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308715073] [2022-03-15 19:11:58,019 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:11:58,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:58,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:11:58,020 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 19:11:58,020 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 19:11:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:58,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:11:58,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:11:58,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:11:58,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:11:58,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:11:58,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308715073] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:11:58,206 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:11:58,206 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 19:11:58,206 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [563156562] [2022-03-15 19:11:58,206 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:58,209 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:58,406 INFO L252 McrAutomatonBuilder]: Finished intersection with 710 states and 2176 transitions. [2022-03-15 19:11:58,407 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:05,779 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [206190#(or (<= ~N~0 1) (< 2 ~N~0)), 206194#(or (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 206192#(or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 206186#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 206187#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 206196#(or (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 1) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (< 2 ~N~0)), 206188#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 206197#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 2 ~N~0))), 206199#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 206204#(or (<= 2 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 206203#(and (or (<= 2 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 206202#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 206205#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 2 ~N~0))), 206189#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 206193#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 206206#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 2 ~N~0)), 206191#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 1) (< 2 ~N~0)), 206195#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 206207#(or (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 0) (< 2 ~N~0)), 206185#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 206201#(or (<= ~N~0 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< 1 ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 206200#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 2 ~N~0)), 206184#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 206198#(or (<= ~N~0 0) (<= 2 ~N~0))] [2022-03-15 19:12:05,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 19:12:05,780 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:05,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 19:12:05,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:12:05,781 INFO L87 Difference]: Start difference. First operand 9356 states and 46169 transitions. Second operand has 31 states, 31 states have (on average 8.129032258064516) internal successors, (252), 31 states have internal predecessors, (252), 0 states have call successors, (0), 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 19:12:08,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:08,050 INFO L93 Difference]: Finished difference Result 28552 states and 145354 transitions. [2022-03-15 19:12:08,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 19:12:08,051 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 8.129032258064516) internal successors, (252), 31 states have internal predecessors, (252), 0 states have call successors, (0), 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 31 [2022-03-15 19:12:08,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:08,164 INFO L225 Difference]: With dead ends: 28552 [2022-03-15 19:12:08,164 INFO L226 Difference]: Without dead ends: 28538 [2022-03-15 19:12:08,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 734 SyntacticMatches, 29 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1467, Invalid=5843, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 19:12:08,167 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 671 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 2078 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:08,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [671 Valid, 488 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2078 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:12:08,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2022-03-15 19:12:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 20016. [2022-03-15 19:12:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20016 states, 20015 states have (on average 5.257057207094679) internal successors, (105220), 20015 states have internal predecessors, (105220), 0 states have call successors, (0), 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 19:12:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20016 states to 20016 states and 105220 transitions. [2022-03-15 19:12:08,969 INFO L78 Accepts]: Start accepts. Automaton has 20016 states and 105220 transitions. Word has length 31 [2022-03-15 19:12:08,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:08,969 INFO L470 AbstractCegarLoop]: Abstraction has 20016 states and 105220 transitions. [2022-03-15 19:12:08,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.129032258064516) internal successors, (252), 31 states have internal predecessors, (252), 0 states have call successors, (0), 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 19:12:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 20016 states and 105220 transitions. [2022-03-15 19:12:09,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:12:09,027 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:09,027 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:09,043 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 19:12:09,227 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,SelfDestructingSolverStorable16 [2022-03-15 19:12:09,228 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:12:09,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:09,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1560705194, now seen corresponding path program 8 times [2022-03-15 19:12:09,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:09,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464675751] [2022-03-15 19:12:09,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:09,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:09,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:12:09,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:09,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464675751] [2022-03-15 19:12:09,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464675751] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:09,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962236258] [2022-03-15 19:12:09,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:12:09,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:09,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:09,405 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 19:12:09,406 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 19:12:09,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:12:09,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:09,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:12:09,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:09,549 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:12:09,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:12:09,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962236258] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:09,596 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:09,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-03-15 19:12:09,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1781763782] [2022-03-15 19:12:09,596 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:09,599 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:09,779 INFO L252 McrAutomatonBuilder]: Finished intersection with 688 states and 2100 transitions. [2022-03-15 19:12:09,780 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:17,599 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [275146#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 275157#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 0) (< 1 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 275154#(<= 3 ~N~0), 275141#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 275152#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 275156#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 275148#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< 3 ~N~0) (<= ~N~0 2)), 275155#(<= 2 thread1Thread1of1ForFork1_~i~0), 275145#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 275143#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0)), 275150#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 275153#(or (<= ~N~0 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< 1 ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 275149#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 275151#(or (<= ~N~0 0) (< 1 ~N~0)), 275144#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 275140#(< |thread2Thread1of1ForFork3_~i~1#1| ~N~0), 274990#(<= 1 thread1Thread1of1ForFork1_~i~0), 275147#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 275142#(< thread1Thread1of1ForFork1_~i~0 ~N~0)] [2022-03-15 19:12:17,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:12:17,599 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:17,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:12:17,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=874, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:12:17,600 INFO L87 Difference]: Start difference. First operand 20016 states and 105220 transitions. Second operand has 27 states, 27 states have (on average 11.074074074074074) internal successors, (299), 27 states have internal predecessors, (299), 0 states have call successors, (0), 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 19:12:19,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:19,450 INFO L93 Difference]: Finished difference Result 41096 states and 204729 transitions. [2022-03-15 19:12:19,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 19:12:19,450 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 11.074074074074074) internal successors, (299), 27 states have internal predecessors, (299), 0 states have call successors, (0), 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 31 [2022-03-15 19:12:19,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:19,636 INFO L225 Difference]: With dead ends: 41096 [2022-03-15 19:12:19,637 INFO L226 Difference]: Without dead ends: 40900 [2022-03-15 19:12:19,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 722 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=842, Invalid=2940, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:12:19,638 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 357 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 2105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:19,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 347 Invalid, 2105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2030 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:12:19,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40900 states. [2022-03-15 19:12:20,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40900 to 17568. [2022-03-15 19:12:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17568 states, 17567 states have (on average 5.165993055160244) internal successors, (90751), 17567 states have internal predecessors, (90751), 0 states have call successors, (0), 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 19:12:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17568 states to 17568 states and 90751 transitions. [2022-03-15 19:12:20,599 INFO L78 Accepts]: Start accepts. Automaton has 17568 states and 90751 transitions. Word has length 31 [2022-03-15 19:12:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:20,599 INFO L470 AbstractCegarLoop]: Abstraction has 17568 states and 90751 transitions. [2022-03-15 19:12:20,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 11.074074074074074) internal successors, (299), 27 states have internal predecessors, (299), 0 states have call successors, (0), 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 19:12:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 17568 states and 90751 transitions. [2022-03-15 19:12:20,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:12:20,642 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:20,642 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:20,659 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 19:12:20,842 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,SelfDestructingSolverStorable17 [2022-03-15 19:12:20,843 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:12:20,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:20,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1154690475, now seen corresponding path program 9 times [2022-03-15 19:12:20,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:20,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781695922] [2022-03-15 19:12:20,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:20,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:12:20,893 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:20,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781695922] [2022-03-15 19:12:20,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781695922] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:20,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530405046] [2022-03-15 19:12:20,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:12:20,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:20,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:20,896 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 19:12:20,897 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 19:12:20,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:12:20,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:20,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:12:20,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:12:21,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:12:21,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530405046] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:21,081 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:21,081 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-03-15 19:12:21,081 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1675482433] [2022-03-15 19:12:21,081 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:21,084 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:21,271 INFO L252 McrAutomatonBuilder]: Finished intersection with 830 states and 2576 transitions. [2022-03-15 19:12:21,272 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:32,286 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [351679#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 2 ~N~0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= |thread4Thread1of1ForFork2_~i~3#1| 0))), 351696#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 1) (< 2 ~N~0)), 351677#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 351678#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 351697#(or (<= (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 1) (< 2 ~N~0)), 351676#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 351687#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 2 ~N~0)), 351682#(or (<= (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 351686#(or (<= ~N~0 0) (<= 2 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 351688#(or (<= 2 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 351675#(or (<= (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 351685#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (<= 2 ~N~0)), 351691#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 351680#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 351681#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 351690#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 351684#(or (<= ~N~0 0) (<= 2 ~N~0)), 351698#(or (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 1) (< 2 ~N~0)), 351692#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 0) (<= 2 ~N~0)), 351693#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 2 ~N~0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread4Thread1of1ForFork2_~i~3#1| 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0))), 351694#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 2 ~N~0)), 351689#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 351683#(and (or (= |thread4Thread1of1ForFork2_~i~3#1| 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 2 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 351695#(or (<= ~N~0 1) (< 2 ~N~0))] [2022-03-15 19:12:32,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 19:12:32,287 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:32,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 19:12:32,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:12:32,287 INFO L87 Difference]: Start difference. First operand 17568 states and 90751 transitions. Second operand has 31 states, 31 states have (on average 8.225806451612904) internal successors, (255), 31 states have internal predecessors, (255), 0 states have call successors, (0), 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 19:12:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:34,601 INFO L93 Difference]: Finished difference Result 50212 states and 257623 transitions. [2022-03-15 19:12:34,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 19:12:34,601 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 8.225806451612904) internal successors, (255), 31 states have internal predecessors, (255), 0 states have call successors, (0), 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 32 [2022-03-15 19:12:34,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:34,834 INFO L225 Difference]: With dead ends: 50212 [2022-03-15 19:12:34,834 INFO L226 Difference]: Without dead ends: 50120 [2022-03-15 19:12:34,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 968 GetRequests, 862 SyntacticMatches, 21 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2146 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1416, Invalid=6066, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 19:12:34,836 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 796 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 1981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:34,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [796 Valid, 409 Invalid, 1981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:12:34,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50120 states. [2022-03-15 19:12:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50120 to 33116. [2022-03-15 19:12:35,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33116 states, 33115 states have (on average 5.415884040465046) internal successors, (179347), 33115 states have internal predecessors, (179347), 0 states have call successors, (0), 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 19:12:36,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33116 states to 33116 states and 179347 transitions. [2022-03-15 19:12:36,114 INFO L78 Accepts]: Start accepts. Automaton has 33116 states and 179347 transitions. Word has length 32 [2022-03-15 19:12:36,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:36,115 INFO L470 AbstractCegarLoop]: Abstraction has 33116 states and 179347 transitions. [2022-03-15 19:12:36,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.225806451612904) internal successors, (255), 31 states have internal predecessors, (255), 0 states have call successors, (0), 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 19:12:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand 33116 states and 179347 transitions. [2022-03-15 19:12:36,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:12:36,427 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:36,427 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:36,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 19:12:36,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:36,636 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:12:36,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:36,637 INFO L85 PathProgramCache]: Analyzing trace with hash 89746821, now seen corresponding path program 10 times [2022-03-15 19:12:36,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:36,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170327247] [2022-03-15 19:12:36,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:36,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:36,681 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:12:36,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:36,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170327247] [2022-03-15 19:12:36,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170327247] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:36,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566013098] [2022-03-15 19:12:36,682 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:12:36,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:36,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:36,683 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 19:12:36,684 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 19:12:36,760 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:12:36,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:36,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:12:36,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:36,830 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:12:36,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:12:36,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566013098] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:36,887 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:36,887 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-03-15 19:12:36,887 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [724577731] [2022-03-15 19:12:36,887 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:36,890 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:37,165 INFO L252 McrAutomatonBuilder]: Finished intersection with 602 states and 1770 transitions. [2022-03-15 19:12:37,166 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:42,564 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [468502#(or (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 468508#(<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)), 468499#(< |thread2Thread1of1ForFork3_~i~1#1| ~N~0), 468515#(or (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 1) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 468504#(or (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 468512#(or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (< 1 ~N~0)), 468511#(and (or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)) (or (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 1) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))), 468513#(<= ~N~0 1), 468510#(and (or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 1))), 468501#(or (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 468505#(or (<= ~N~0 0) (< 1 ~N~0)), 468503#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 468514#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 1)), 468507#(or (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (<= ~N~0 0) (< 1 ~N~0)), 468516#(<= thread3Thread1of1ForFork0_~i~2 1), 468500#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 468509#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 468506#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 468498#(< thread3Thread1of1ForFork0_~i~2 ~N~0), 468517#(= thread3Thread1of1ForFork0_~i~2 0)] [2022-03-15 19:12:42,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:12:42,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:42,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:12:42,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1102, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:12:42,565 INFO L87 Difference]: Start difference. First operand 33116 states and 179347 transitions. Second operand has 27 states, 27 states have (on average 9.296296296296296) internal successors, (251), 27 states have internal predecessors, (251), 0 states have call successors, (0), 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 19:12:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:44,069 INFO L93 Difference]: Finished difference Result 48086 states and 248365 transitions. [2022-03-15 19:12:44,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 19:12:44,069 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 9.296296296296296) internal successors, (251), 27 states have internal predecessors, (251), 0 states have call successors, (0), 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 32 [2022-03-15 19:12:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:44,271 INFO L225 Difference]: With dead ends: 48086 [2022-03-15 19:12:44,271 INFO L226 Difference]: Without dead ends: 46136 [2022-03-15 19:12:44,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=491, Invalid=2701, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:12:44,273 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 375 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 2497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:44,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 335 Invalid, 2497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:12:44,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46136 states. [2022-03-15 19:12:45,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46136 to 32158. [2022-03-15 19:12:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32158 states, 32157 states have (on average 5.38461299250552) internal successors, (173153), 32157 states have internal predecessors, (173153), 0 states have call successors, (0), 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 19:12:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32158 states to 32158 states and 173153 transitions. [2022-03-15 19:12:45,608 INFO L78 Accepts]: Start accepts. Automaton has 32158 states and 173153 transitions. Word has length 32 [2022-03-15 19:12:45,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:45,608 INFO L470 AbstractCegarLoop]: Abstraction has 32158 states and 173153 transitions. [2022-03-15 19:12:45,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.296296296296296) internal successors, (251), 27 states have internal predecessors, (251), 0 states have call successors, (0), 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 19:12:45,608 INFO L276 IsEmpty]: Start isEmpty. Operand 32158 states and 173153 transitions. [2022-03-15 19:12:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:12:45,697 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:45,697 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:45,713 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 19:12:45,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:45,898 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:12:45,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:45,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1687332022, now seen corresponding path program 11 times [2022-03-15 19:12:45,899 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:45,899 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770342709] [2022-03-15 19:12:45,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:45,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:46,124 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:46,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770342709] [2022-03-15 19:12:46,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770342709] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:46,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437952375] [2022-03-15 19:12:46,125 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:12:46,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:46,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:46,126 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 19:12:46,126 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 19:12:46,208 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:12:46,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:46,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:12:46,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:46,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:46,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:46,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437952375] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:46,450 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:46,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-03-15 19:12:46,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1183367142] [2022-03-15 19:12:46,451 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:46,454 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:46,741 INFO L252 McrAutomatonBuilder]: Finished intersection with 920 states and 2872 transitions. [2022-03-15 19:12:46,741 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:05,494 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [581190#(and (or (<= ~counter1~0 1) (<= ~counter1~0 (+ 2 ~counter2~0))) (or (<= ~counter1~0 1) (< (+ ~counter2~0 1) ~counter1~0))), 581199#(and (or (<= (+ ~counter1~0 1) 0) (<= ~counter1~0 ~counter2~0)) (or (< ~counter2~0 (+ ~counter1~0 1)) (<= (+ ~counter1~0 1) 0))), 581198#(and (or (<= ~counter1~0 1) (< ~counter2~0 (+ ~counter1~0 1))) (or (<= ~counter1~0 1) (<= ~counter1~0 ~counter2~0))), 581202#(and (or (<= (+ 2 ~counter1~0) ~counter2~0) (<= ~counter2~0 1)) (or (< ~counter2~0 (+ 3 ~counter1~0)) (<= (+ ~counter1~0 1) 0))), 581191#(and (or (<= ~counter1~0 1) (< ~counter2~0 ~counter1~0)) (or (<= ~counter1~0 (+ ~counter2~0 1)) (<= ~counter2~0 0))), 581205#(and (or (<= ~counter1~0 0) (< ~counter2~0 ~counter1~0)) (or (<= ~counter1~0 (+ ~counter2~0 1)) (<= (+ ~counter2~0 1) 0))), 581197#(and (or (<= ~counter1~0 0) (< ~counter2~0 (+ 2 ~counter1~0))) (or (<= ~counter1~0 0) (<= (+ ~counter1~0 1) ~counter2~0))), 581200#(and (or (<= (+ ~counter1~0 1) ~counter2~0) (<= ~counter2~0 0)) (or (<= (+ ~counter1~0 1) 0) (< ~counter2~0 (+ 2 ~counter1~0)))), 581208#(and (or (<= ~counter1~0 (+ ~counter2~0 1)) (<= ~counter1~0 0)) (or (<= ~counter1~0 0) (= ~counter2~0 0))), 581195#(and (or (<= ~counter1~0 0) (<= ~counter1~0 ~counter2~0)) (or (<= ~counter1~0 0) (< ~counter2~0 (+ ~counter1~0 1)))), 581206#(and (or (<= ~counter1~0 1) (< (+ ~counter2~0 1) ~counter1~0)) (or (<= ~counter1~0 (+ 2 ~counter2~0)) (<= (+ ~counter2~0 1) 0))), 581192#(and (or (< ~counter2~0 (+ 3 ~counter1~0)) (<= ~counter2~0 1)) (or (<= (+ 2 ~counter1~0) ~counter2~0) (<= ~counter2~0 1))), 581193#(and (or (<= ~counter1~0 0) (< ~counter2~0 (+ 2 ~counter1~0))) (or (<= ~counter2~0 1) (<= (+ ~counter1~0 1) ~counter2~0))), 581209#(and (or (<= ~counter1~0 1) (<= ~counter1~0 (+ 2 ~counter2~0))) (or (<= ~counter1~0 1) (= ~counter2~0 0))), 581201#(and (or (<= (+ ~counter1~0 1) 0) (< ~counter2~0 (+ 2 ~counter1~0))) (or (<= (+ ~counter1~0 1) ~counter2~0) (<= (+ ~counter1~0 1) 0))), 581207#(and (or (< ~counter2~0 (+ ~counter1~0 1)) (<= (+ ~counter1~0 1) 0)) (or (<= (+ ~counter2~0 1) 0) (<= ~counter1~0 ~counter2~0))), 581188#(and (or (<= (+ ~counter1~0 1) ~counter2~0) (<= ~counter2~0 0)) (or (< ~counter2~0 (+ 2 ~counter1~0)) (<= ~counter2~0 0))), 581189#(and (or (<= ~counter1~0 ~counter2~0) (<= ~counter2~0 0)) (or (<= ~counter1~0 0) (< ~counter2~0 (+ ~counter1~0 1)))), 581204#(and (or (<= (+ ~counter2~0 1) 0) (< ~counter2~0 (+ ~counter1~0 1))) (or (<= (+ ~counter2~0 1) 0) (<= ~counter1~0 ~counter2~0))), 581187#(and (or (<= ~counter1~0 0) (< ~counter2~0 ~counter1~0)) (or (<= ~counter1~0 (+ ~counter2~0 1)) (<= ~counter1~0 0))), 581203#(and (or (<= (+ 2 ~counter1~0) ~counter2~0) (<= (+ ~counter1~0 1) 0)) (or (< ~counter2~0 (+ 3 ~counter1~0)) (<= (+ ~counter1~0 1) 0))), 581210#(and (or (<= (+ ~counter1~0 1) 0) (<= ~counter1~0 ~counter2~0)) (or (<= (+ ~counter1~0 1) 0) (= ~counter2~0 0))), 581194#(and (or (<= ~counter2~0 1) (<= ~counter1~0 ~counter2~0)) (or (<= ~counter1~0 1) (< ~counter2~0 (+ ~counter1~0 1)))), 581196#(and (or (<= ~counter1~0 1) (< ~counter2~0 ~counter1~0)) (or (<= ~counter1~0 1) (<= ~counter1~0 (+ ~counter2~0 1))))] [2022-03-15 19:13:05,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 19:13:05,495 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:05,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 19:13:05,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1017, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:13:05,495 INFO L87 Difference]: Start difference. First operand 32158 states and 173153 transitions. Second operand has 32 states, 31 states have (on average 9.225806451612904) internal successors, (286), 31 states have internal predecessors, (286), 0 states have call successors, (0), 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 19:13:08,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:08,450 INFO L93 Difference]: Finished difference Result 127561 states and 654104 transitions. [2022-03-15 19:13:08,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 19:13:08,451 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 9.225806451612904) internal successors, (286), 31 states have internal predecessors, (286), 0 states have call successors, (0), 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 33 [2022-03-15 19:13:08,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:09,763 INFO L225 Difference]: With dead ends: 127561 [2022-03-15 19:13:09,763 INFO L226 Difference]: Without dead ends: 124300 [2022-03-15 19:13:09,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 987 GetRequests, 903 SyntacticMatches, 22 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=888, Invalid=3144, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:13:09,764 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 1526 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 2091 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 2328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 2091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:09,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1526 Valid, 306 Invalid, 2328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 2091 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:13:10,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124300 states. [2022-03-15 19:13:12,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124300 to 71812. [2022-03-15 19:13:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71812 states, 71811 states have (on average 5.562128364735208) internal successors, (399422), 71811 states have internal predecessors, (399422), 0 states have call successors, (0), 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 19:13:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71812 states to 71812 states and 399422 transitions. [2022-03-15 19:13:13,717 INFO L78 Accepts]: Start accepts. Automaton has 71812 states and 399422 transitions. Word has length 33 [2022-03-15 19:13:13,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:13,717 INFO L470 AbstractCegarLoop]: Abstraction has 71812 states and 399422 transitions. [2022-03-15 19:13:13,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 9.225806451612904) internal successors, (286), 31 states have internal predecessors, (286), 0 states have call successors, (0), 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 19:13:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 71812 states and 399422 transitions. [2022-03-15 19:13:13,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:13:13,961 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:13,961 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:13,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 19:13:14,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:14,162 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:13:14,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:14,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1222501162, now seen corresponding path program 12 times [2022-03-15 19:13:14,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:14,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618929601] [2022-03-15 19:13:14,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:14,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:13:14,211 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:14,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618929601] [2022-03-15 19:13:14,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618929601] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:14,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716768400] [2022-03-15 19:13:14,212 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:13:14,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:14,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:14,216 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 19:13:14,217 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 19:13:14,447 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:13:14,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:14,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:13:14,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:13:14,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:13:14,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716768400] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:14,566 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:14,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-03-15 19:13:14,566 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1644463011] [2022-03-15 19:13:14,566 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:14,569 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:14,868 INFO L252 McrAutomatonBuilder]: Finished intersection with 1040 states and 3272 transitions. [2022-03-15 19:13:14,868 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:25,857 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [852682#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 852699#(or (<= ~N~0 1) (< 2 ~N~0)), 852676#(or (< 3 ~N~0) (<= ~N~0 2)), 852669#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 852705#(or (<= ~N~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< 2 ~N~0)), 852702#(or (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 1) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< 2 ~N~0)), 852686#(and (or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 852684#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 852678#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 2)), 852670#(or (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 852677#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< 3 ~N~0) (<= ~N~0 2)), 852666#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 852690#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 852701#(or (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 1) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (< 2 ~N~0)), 852672#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 852691#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 852706#(or (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 0) (< 2 ~N~0)), 852689#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 852667#(or (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 852695#(or (< (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 852696#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0))), 852671#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 852675#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)) (or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< thread1Thread1of1ForFork1_~i~0 ~N~0))), 852687#(or (< 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 852668#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 852688#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 852665#(< thread3Thread1of1ForFork0_~i~2 ~N~0), 852693#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 852680#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 852685#(or (< (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 852664#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 852679#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 852698#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 2)), 852674#(or (< (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 852697#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< 3 ~N~0) (<= ~N~0 2)), 852694#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 852704#(or (<= ~N~0 1) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (< 2 ~N~0)), 852681#(or (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 852683#(or (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 852703#(or (< (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 1) (< 2 ~N~0)), 852673#(or (< (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2))), 852692#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 852700#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 1) (< 2 ~N~0))] [2022-03-15 19:13:25,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 19:13:25,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:25,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 19:13:25,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=2817, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:13:25,858 INFO L87 Difference]: Start difference. First operand 71812 states and 399422 transitions. Second operand has 52 states, 52 states have (on average 7.1923076923076925) internal successors, (374), 52 states have internal predecessors, (374), 0 states have call successors, (0), 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 19:13:29,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:29,859 INFO L93 Difference]: Finished difference Result 90310 states and 487577 transitions. [2022-03-15 19:13:29,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 19:13:29,859 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 7.1923076923076925) internal successors, (374), 52 states have internal predecessors, (374), 0 states have call successors, (0), 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 34 [2022-03-15 19:13:29,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:30,587 INFO L225 Difference]: With dead ends: 90310 [2022-03-15 19:13:30,587 INFO L226 Difference]: Without dead ends: 89942 [2022-03-15 19:13:30,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1178 GetRequests, 1070 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3117 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2040, Invalid=9090, Unknown=0, NotChecked=0, Total=11130 [2022-03-15 19:13:30,589 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 1115 mSDsluCounter, 3558 mSDsCounter, 0 mSdLazyCounter, 5152 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 5337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 5152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:30,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1115 Valid, 1223 Invalid, 5337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 5152 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 19:13:30,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89942 states. [2022-03-15 19:13:32,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89942 to 72530. [2022-03-15 19:13:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72530 states, 72529 states have (on average 5.530863516662301) internal successors, (401148), 72529 states have internal predecessors, (401148), 0 states have call successors, (0), 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 19:13:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72530 states to 72530 states and 401148 transitions. [2022-03-15 19:13:33,692 INFO L78 Accepts]: Start accepts. Automaton has 72530 states and 401148 transitions. Word has length 34 [2022-03-15 19:13:33,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:33,692 INFO L470 AbstractCegarLoop]: Abstraction has 72530 states and 401148 transitions. [2022-03-15 19:13:33,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 7.1923076923076925) internal successors, (374), 52 states have internal predecessors, (374), 0 states have call successors, (0), 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 19:13:33,693 INFO L276 IsEmpty]: Start isEmpty. Operand 72530 states and 401148 transitions. [2022-03-15 19:13:34,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:13:34,177 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:34,178 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:34,194 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 19:13:34,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-03-15 19:13:34,378 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:13:34,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:34,379 INFO L85 PathProgramCache]: Analyzing trace with hash 523960973, now seen corresponding path program 13 times [2022-03-15 19:13:34,379 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:34,379 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647823146] [2022-03-15 19:13:34,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:34,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:34,435 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:13:34,436 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:34,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647823146] [2022-03-15 19:13:34,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647823146] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:34,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220667916] [2022-03-15 19:13:34,436 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:13:34,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:34,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:34,440 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 19:13:34,441 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 19:13:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:34,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:13:34,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:13:34,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:13:34,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220667916] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:34,670 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:34,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-03-15 19:13:34,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1866245066] [2022-03-15 19:13:34,670 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:34,674 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:35,036 INFO L252 McrAutomatonBuilder]: Finished intersection with 1010 states and 3168 transitions. [2022-03-15 19:13:35,037 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:49,818 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [1088448#(or (< 3 ~N~0) (<= ~N~0 2)), 1088457#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 3) ~N~0) (<= ~N~0 (+ |thread4Thread1of1ForFork2_~i~3#1| 2)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1088477#(or (<= ~N~0 1) (<= ~N~0 (+ |thread4Thread1of1ForFork2_~i~3#1| 1)) (< 2 ~N~0)), 1088474#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (<= ~N~0 1) (<= ~N~0 (+ |thread4Thread1of1ForFork2_~i~3#1| 1)) (< 2 ~N~0)), 1088436#(< |thread4Thread1of1ForFork2_~i~3#1| ~N~0), 1088470#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 2)), 1088452#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1088469#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< 3 ~N~0) (<= ~N~0 2)), 1088472#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 1) (< 2 ~N~0)), 1088478#(or (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 1) (< 2 ~N~0)), 1088462#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1088442#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (<= ~N~0 (+ |thread4Thread1of1ForFork2_~i~3#1| 1))), 1088467#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread4Thread1of1ForFork2_~i~3#1| 1))), 1088459#(or (< 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1088447#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 2)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= |thread4Thread1of1ForFork2_~i~3#1| 0))), 1088466#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 1088458#(and (or (= |thread4Thread1of1ForFork2_~i~3#1| 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1088453#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1088449#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< 3 ~N~0) (<= ~N~0 2)), 1088441#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (<= ~N~0 (+ |thread4Thread1of1ForFork2_~i~3#1| 1))), 1088450#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 2)), 1088446#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread4Thread1of1ForFork2_~i~3#1| 1))), 1088451#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1088444#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 3) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread4Thread1of1ForFork2_~i~3#1| 2))), 1088473#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 1) (< 2 ~N~0)), 1088468#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 2)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread4Thread1of1ForFork2_~i~3#1| 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0))), 1088456#(or (<= ~N~0 (+ |thread4Thread1of1ForFork2_~i~3#1| 1)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1088464#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread4Thread1of1ForFork2_~i~3#1| 1))), 1088438#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1088455#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (<= ~N~0 (+ |thread4Thread1of1ForFork2_~i~3#1| 1)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1088437#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 1088465#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 3) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread4Thread1of1ForFork2_~i~3#1| 2))), 1088454#(or (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1088476#(or (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 1) (< 2 ~N~0)), 1088475#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 3) ~N~0) (<= ~N~0 (+ |thread4Thread1of1ForFork2_~i~3#1| 2)) (<= ~N~0 1) (< 2 ~N~0)), 1088439#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1088443#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 3) ~N~0) (<= ~N~0 (+ |thread4Thread1of1ForFork2_~i~3#1| 2))), 1088460#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1088461#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1088463#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 1088440#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 1088445#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 1088471#(or (<= ~N~0 1) (< 2 ~N~0))] [2022-03-15 19:13:49,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 19:13:49,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:49,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 19:13:49,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=2817, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:13:49,819 INFO L87 Difference]: Start difference. First operand 72530 states and 401148 transitions. Second operand has 52 states, 52 states have (on average 7.230769230769231) internal successors, (376), 52 states have internal predecessors, (376), 0 states have call successors, (0), 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 19:13:53,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:53,578 INFO L93 Difference]: Finished difference Result 98894 states and 534743 transitions. [2022-03-15 19:13:53,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 19:13:53,578 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 7.230769230769231) internal successors, (376), 52 states have internal predecessors, (376), 0 states have call successors, (0), 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 34 [2022-03-15 19:13:53,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:54,105 INFO L225 Difference]: With dead ends: 98894 [2022-03-15 19:13:54,106 INFO L226 Difference]: Without dead ends: 98806 [2022-03-15 19:13:54,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1154 GetRequests, 1046 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2206, Invalid=9566, Unknown=0, NotChecked=0, Total=11772 [2022-03-15 19:13:54,107 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 1147 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 4063 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 4277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 4063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:54,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1147 Valid, 773 Invalid, 4277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 4063 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 19:13:54,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98806 states. [2022-03-15 19:13:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98806 to 72678. [2022-03-15 19:13:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72678 states, 72677 states have (on average 5.529452233856653) internal successors, (401864), 72677 states have internal predecessors, (401864), 0 states have call successors, (0), 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 19:13:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72678 states to 72678 states and 401864 transitions. [2022-03-15 19:13:57,458 INFO L78 Accepts]: Start accepts. Automaton has 72678 states and 401864 transitions. Word has length 34 [2022-03-15 19:13:57,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:57,458 INFO L470 AbstractCegarLoop]: Abstraction has 72678 states and 401864 transitions. [2022-03-15 19:13:57,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 7.230769230769231) internal successors, (376), 52 states have internal predecessors, (376), 0 states have call successors, (0), 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 19:13:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 72678 states and 401864 transitions. [2022-03-15 19:13:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:13:57,697 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:57,697 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:57,714 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 19:13:57,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:57,897 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:13:57,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:57,898 INFO L85 PathProgramCache]: Analyzing trace with hash 672426347, now seen corresponding path program 14 times [2022-03-15 19:13:57,898 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:57,898 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700829908] [2022-03-15 19:13:57,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:57,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:13:57,950 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:57,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700829908] [2022-03-15 19:13:57,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700829908] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:57,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166295382] [2022-03-15 19:13:57,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:13:57,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:57,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:57,951 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 19:13:57,952 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 19:13:58,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:13:58,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:58,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:13:58,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:13:58,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:13:58,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166295382] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:58,419 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:58,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-03-15 19:13:58,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [612877340] [2022-03-15 19:13:58,419 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:58,424 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:58,721 INFO L252 McrAutomatonBuilder]: Finished intersection with 1040 states and 3272 transitions. [2022-03-15 19:13:58,722 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:14:13,098 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [1333104#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1333107#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 1333106#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 1333115#(or (< 3 ~N~0) (<= ~N~0 2)), 1333118#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< 3 ~N~0) (<= ~N~0 2)), 1333110#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1333114#(or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 1) (< 2 ~N~0)), 1333100#(or (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 1333111#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 2)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))), 1333121#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 2)), 1333112#(and (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1333098#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 1333102#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0)), 1333117#(or (< 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1333099#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 1333103#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 1333097#(< |thread2Thread1of1ForFork3_~i~1#1| ~N~0), 1333116#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< 3 ~N~0) (<= ~N~0 2)), 1333105#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 1333101#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1333109#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 1333108#(or (<= ~N~0 1) (< 2 ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 1333119#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 2)), 1333120#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1333113#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 2)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)))] [2022-03-15 19:14:13,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:14:13,098 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:14:13,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:14:13,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1235, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:14:13,099 INFO L87 Difference]: Start difference. First operand 72678 states and 401864 transitions. Second operand has 34 states, 34 states have (on average 10.235294117647058) internal successors, (348), 34 states have internal predecessors, (348), 0 states have call successors, (0), 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 19:14:15,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:14:15,493 INFO L93 Difference]: Finished difference Result 87182 states and 461967 transitions. [2022-03-15 19:14:15,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 19:14:15,494 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 10.235294117647058) internal successors, (348), 34 states have internal predecessors, (348), 0 states have call successors, (0), 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 34 [2022-03-15 19:14:15,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:14:16,141 INFO L225 Difference]: With dead ends: 87182 [2022-03-15 19:14:16,141 INFO L226 Difference]: Without dead ends: 86776 [2022-03-15 19:14:16,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1140 GetRequests, 1072 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=850, Invalid=3842, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 19:14:16,142 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 645 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 2173 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 2173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:14:16,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [645 Valid, 339 Invalid, 2261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 2173 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:14:16,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86776 states. [2022-03-15 19:14:18,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86776 to 71990. [2022-03-15 19:14:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71990 states, 71989 states have (on average 5.522538165553071) internal successors, (397562), 71989 states have internal predecessors, (397562), 0 states have call successors, (0), 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 19:14:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71990 states to 71990 states and 397562 transitions. [2022-03-15 19:14:19,280 INFO L78 Accepts]: Start accepts. Automaton has 71990 states and 397562 transitions. Word has length 34 [2022-03-15 19:14:19,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:14:19,280 INFO L470 AbstractCegarLoop]: Abstraction has 71990 states and 397562 transitions. [2022-03-15 19:14:19,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 10.235294117647058) internal successors, (348), 34 states have internal predecessors, (348), 0 states have call successors, (0), 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 19:14:19,281 INFO L276 IsEmpty]: Start isEmpty. Operand 71990 states and 397562 transitions. [2022-03-15 19:14:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:14:19,604 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:14:19,605 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:14:19,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-03-15 19:14:19,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:14:19,819 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:14:19,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:14:19,820 INFO L85 PathProgramCache]: Analyzing trace with hash -107635768, now seen corresponding path program 15 times [2022-03-15 19:14:19,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:14:19,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238444266] [2022-03-15 19:14:19,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:14:19,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:14:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:14:19,899 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:14:19,899 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:14:19,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238444266] [2022-03-15 19:14:19,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238444266] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:14:19,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351085418] [2022-03-15 19:14:19,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:14:19,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:14:19,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:14:19,916 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 19:14:19,979 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 19:14:20,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:14:20,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:14:20,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:14:20,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:14:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:14:20,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:14:20,287 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:14:20,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351085418] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:14:20,287 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:14:20,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-03-15 19:14:20,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [178981073] [2022-03-15 19:14:20,287 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:14:20,291 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:14:20,784 INFO L252 McrAutomatonBuilder]: Finished intersection with 778 states and 2332 transitions. [2022-03-15 19:14:20,784 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:14:30,954 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [1564595#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1564590#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1564600#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 1) (< 2 ~N~0)), 1564601#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 1) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< 2 ~N~0)), 1564603#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork3_~i~1#1| 0))), 1564589#(< |thread2Thread1of1ForFork3_~i~1#1| ~N~0), 1564593#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1564599#(or (<= ~N~0 1) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< 2 ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1564598#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< 3 ~N~0) (<= ~N~0 2)), 1564594#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1564591#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0)), 1564602#(and (or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1564604#(or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 1)), 1564592#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1564596#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1564597#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0))] [2022-03-15 19:14:30,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:14:30,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:14:30,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:14:30,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=902, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:14:30,955 INFO L87 Difference]: Start difference. First operand 71990 states and 397562 transitions. Second operand has 25 states, 25 states have (on average 8.84) internal successors, (221), 25 states have internal predecessors, (221), 0 states have call successors, (0), 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 19:14:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:14:34,142 INFO L93 Difference]: Finished difference Result 160154 states and 855567 transitions. [2022-03-15 19:14:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 19:14:34,142 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.84) internal successors, (221), 25 states have internal predecessors, (221), 0 states have call successors, (0), 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 34 [2022-03-15 19:14:34,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:14:35,458 INFO L225 Difference]: With dead ends: 160154 [2022-03-15 19:14:35,459 INFO L226 Difference]: Without dead ends: 158866 [2022-03-15 19:14:35,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 818 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=824, Invalid=3208, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:14:35,487 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 307 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:14:35,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 341 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1876 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:14:35,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158866 states. [2022-03-15 19:14:39,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158866 to 85304. [2022-03-15 19:14:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85304 states, 85303 states have (on average 5.615992403549699) internal successors, (479061), 85303 states have internal predecessors, (479061), 0 states have call successors, (0), 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 19:14:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85304 states to 85304 states and 479061 transitions. [2022-03-15 19:14:40,183 INFO L78 Accepts]: Start accepts. Automaton has 85304 states and 479061 transitions. Word has length 34 [2022-03-15 19:14:40,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:14:40,183 INFO L470 AbstractCegarLoop]: Abstraction has 85304 states and 479061 transitions. [2022-03-15 19:14:40,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.84) internal successors, (221), 25 states have internal predecessors, (221), 0 states have call successors, (0), 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 19:14:40,184 INFO L276 IsEmpty]: Start isEmpty. Operand 85304 states and 479061 transitions. [2022-03-15 19:14:40,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:14:40,471 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:14:40,471 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:14:40,489 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 19:14:40,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:14:40,672 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:14:40,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:14:40,672 INFO L85 PathProgramCache]: Analyzing trace with hash 138241602, now seen corresponding path program 16 times [2022-03-15 19:14:40,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:14:40,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600310456] [2022-03-15 19:14:40,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:14:40,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:14:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:14:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-15 19:14:40,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:14:40,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600310456] [2022-03-15 19:14:40,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600310456] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:14:40,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743594415] [2022-03-15 19:14:40,714 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:14:40,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:14:40,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:14:40,715 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 19:14:40,716 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 19:14:40,806 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:14:40,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:14:40,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:14:40,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:14:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-15 19:14:40,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:14:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-15 19:14:40,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743594415] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:14:40,926 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:14:40,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 19:14:40,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [860512182] [2022-03-15 19:14:40,926 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:14:41,135 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:14:41,375 INFO L252 McrAutomatonBuilder]: Finished intersection with 1020 states and 3202 transitions. [2022-03-15 19:14:41,375 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:14:55,326 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [1895669#(or (<= (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 1895672#(or (<= (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 1895677#(or (<= (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 1895676#(or (<= ~N~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 1895681#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= 2 ~N~0)), 1895671#(< thread3Thread1of1ForFork0_~i~2 ~N~0), 1895673#(or (<= (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 1895683#(or (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 1895674#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 0) (<= 2 ~N~0)), 1895680#(and (or (= |thread4Thread1of1ForFork2_~i~3#1| 0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= 2 ~N~0))), 1895682#(and (or (= |thread4Thread1of1ForFork2_~i~3#1| 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)) (or (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))), 1895684#(and (or (= |thread4Thread1of1ForFork2_~i~3#1| 0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))) (or (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= 2 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)))), 1895679#(or (<= (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 1) (< 2 ~N~0)), 1895685#(or (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= 2 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 1895686#(or (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 1) (< 2 ~N~0)), 1895678#(or (<= ~N~0 0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= 2 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 1895670#(or (<= ~N~0 0) (<= 2 ~N~0)), 1895675#(or (<= (+ |thread4Thread1of1ForFork2_~i~3#1| 2) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))] [2022-03-15 19:14:55,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:14:55,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:14:55,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:14:55,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:14:55,327 INFO L87 Difference]: Start difference. First operand 85304 states and 479061 transitions. Second operand has 25 states, 25 states have (on average 10.72) internal successors, (268), 25 states have internal predecessors, (268), 0 states have call successors, (0), 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 19:14:58,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:14:58,717 INFO L93 Difference]: Finished difference Result 165292 states and 891275 transitions. [2022-03-15 19:14:58,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 19:14:58,717 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.72) internal successors, (268), 25 states have internal predecessors, (268), 0 states have call successors, (0), 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 34 [2022-03-15 19:14:58,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:15:00,019 INFO L225 Difference]: With dead ends: 165292 [2022-03-15 19:15:00,019 INFO L226 Difference]: Without dead ends: 165212 [2022-03-15 19:15:00,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1122 GetRequests, 1041 SyntacticMatches, 22 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=797, Invalid=2863, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:15:00,020 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 359 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:15:00,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 324 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:15:00,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165212 states. [2022-03-15 19:15:04,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165212 to 108014. [2022-03-15 19:15:04,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108014 states, 108013 states have (on average 5.705128086434041) internal successors, (616228), 108013 states have internal predecessors, (616228), 0 states have call successors, (0), 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 19:15:05,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108014 states to 108014 states and 616228 transitions. [2022-03-15 19:15:05,728 INFO L78 Accepts]: Start accepts. Automaton has 108014 states and 616228 transitions. Word has length 34 [2022-03-15 19:15:05,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:15:05,728 INFO L470 AbstractCegarLoop]: Abstraction has 108014 states and 616228 transitions. [2022-03-15 19:15:05,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.72) internal successors, (268), 25 states have internal predecessors, (268), 0 states have call successors, (0), 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 19:15:05,729 INFO L276 IsEmpty]: Start isEmpty. Operand 108014 states and 616228 transitions. [2022-03-15 19:15:06,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:15:06,140 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:15:06,140 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:15:06,161 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 19:15:06,341 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,SelfDestructingSolverStorable25 [2022-03-15 19:15:06,341 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:15:06,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:15:06,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1740380424, now seen corresponding path program 17 times [2022-03-15 19:15:06,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:15:06,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502963525] [2022-03-15 19:15:06,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:15:06,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:15:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:15:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-15 19:15:06,377 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:15:06,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502963525] [2022-03-15 19:15:06,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502963525] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:15:06,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432437504] [2022-03-15 19:15:06,378 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:15:06,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:15:06,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:15:06,379 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 19:15:06,380 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 19:15:06,478 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:15:06,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:15:06,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 19:15:06,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:15:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:15:06,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:15:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:15:06,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432437504] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:15:06,643 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:15:06,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2022-03-15 19:15:06,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [653783224] [2022-03-15 19:15:06,644 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:15:06,647 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:15:07,088 INFO L252 McrAutomatonBuilder]: Finished intersection with 828 states and 2506 transitions. [2022-03-15 19:15:07,088 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:15:15,608 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [2277333#(or (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 2277336#(and (or (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)) (or (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= 0 thread3Thread1of1ForFork0_~i~2))), 2277335#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 1)), 2277327#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 2277323#(or (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 2277332#(or (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 2277320#(< |thread4Thread1of1ForFork2_~i~3#1| ~N~0), 2277328#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 2277330#(or (<= ~N~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 2277322#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 2277326#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 2277337#(or (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 2277321#(< thread3Thread1of1ForFork0_~i~2 ~N~0), 2277331#(or (<= ~N~0 0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 2277329#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 2277334#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 1) (< 2 ~N~0)), 2277324#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 2277325#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 2277338#(or (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= 0 thread3Thread1of1ForFork0_~i~2))] [2022-03-15 19:15:15,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:15:15,609 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:15:15,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:15:15,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1224, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:15:15,609 INFO L87 Difference]: Start difference. First operand 108014 states and 616228 transitions. Second operand has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 26 states have internal predecessors, (232), 0 states have call successors, (0), 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 19:15:18,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:15:18,812 INFO L93 Difference]: Finished difference Result 165544 states and 900034 transitions. [2022-03-15 19:15:18,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 19:15:18,812 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 26 states have internal predecessors, (232), 0 states have call successors, (0), 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 34 [2022-03-15 19:15:18,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:15:20,678 INFO L225 Difference]: With dead ends: 165544 [2022-03-15 19:15:20,678 INFO L226 Difference]: Without dead ends: 162286 [2022-03-15 19:15:20,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 916 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=667, Invalid=3239, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 19:15:20,679 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 328 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 2346 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:15:20,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 340 Invalid, 2414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2346 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:15:20,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162286 states. [2022-03-15 19:15:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162286 to 105392. [2022-03-15 19:15:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105392 states, 105391 states have (on average 5.6112381512652885) internal successors, (591374), 105391 states have internal predecessors, (591374), 0 states have call successors, (0), 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 19:15:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105392 states to 105392 states and 591374 transitions. [2022-03-15 19:15:26,081 INFO L78 Accepts]: Start accepts. Automaton has 105392 states and 591374 transitions. Word has length 34 [2022-03-15 19:15:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:15:26,081 INFO L470 AbstractCegarLoop]: Abstraction has 105392 states and 591374 transitions. [2022-03-15 19:15:26,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 26 states have internal predecessors, (232), 0 states have call successors, (0), 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 19:15:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 105392 states and 591374 transitions. [2022-03-15 19:15:26,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:15:26,723 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:15:26,723 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:15:26,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 19:15:26,927 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,SelfDestructingSolverStorable26 [2022-03-15 19:15:26,927 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:15:26,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:15:26,928 INFO L85 PathProgramCache]: Analyzing trace with hash 159735944, now seen corresponding path program 18 times [2022-03-15 19:15:26,929 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:15:26,929 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983927747] [2022-03-15 19:15:26,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:15:26,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:15:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:15:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-15 19:15:26,969 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:15:26,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983927747] [2022-03-15 19:15:26,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983927747] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:15:26,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35365776] [2022-03-15 19:15:26,970 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:15:26,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:15:26,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:15:26,971 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 19:15:26,972 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 19:15:27,074 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:15:27,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:15:27,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 19:15:27,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:15:27,180 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 19:15:27,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:15:27,257 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 19:15:27,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35365776] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:15:27,257 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:15:27,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2022-03-15 19:15:27,257 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1527913773] [2022-03-15 19:15:27,257 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:15:27,261 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:15:27,682 INFO L252 McrAutomatonBuilder]: Finished intersection with 896 states and 2786 transitions. [2022-03-15 19:15:27,682 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:15:34,273 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [2653972#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 1) (< 2 ~N~0)), 2653962#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 2653966#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 2653971#(<= |thread4Thread1of1ForFork2_~i~3#1| 1), 2653967#(or (<= ~N~0 0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 2653969#(<= ~N~0 1), 2653887#(< |thread4Thread1of1ForFork2_~i~3#1| ~N~0), 2653964#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 2653968#(or (<= ~N~0 1) (< 2 ~N~0)), 2653960#(or (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 2653961#(or (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 2653973#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 2653965#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 2653959#(< thread3Thread1of1ForFork0_~i~2 ~N~0), 2653963#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 2653970#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 1) (< 2 ~N~0))] [2022-03-15 19:15:34,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:15:34,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:15:34,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:15:34,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:15:34,274 INFO L87 Difference]: Start difference. First operand 105392 states and 591374 transitions. Second operand has 23 states, 23 states have (on average 9.695652173913043) internal successors, (223), 23 states have internal predecessors, (223), 0 states have call successors, (0), 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 19:15:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:15:37,108 INFO L93 Difference]: Finished difference Result 145300 states and 787328 transitions. [2022-03-15 19:15:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 19:15:37,108 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.695652173913043) internal successors, (223), 23 states have internal predecessors, (223), 0 states have call successors, (0), 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 34 [2022-03-15 19:15:37,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:15:38,194 INFO L225 Difference]: With dead ends: 145300 [2022-03-15 19:15:38,194 INFO L226 Difference]: Without dead ends: 143018 [2022-03-15 19:15:38,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 886 SyntacticMatches, 47 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1496 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=632, Invalid=3528, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 19:15:38,195 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 362 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:15:38,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 275 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:15:38,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143018 states. [2022-03-15 19:15:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143018 to 106650. [2022-03-15 19:15:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106650 states, 106649 states have (on average 5.592607525621431) internal successors, (596446), 106649 states have internal predecessors, (596446), 0 states have call successors, (0), 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 19:15:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106650 states to 106650 states and 596446 transitions. [2022-03-15 19:15:43,022 INFO L78 Accepts]: Start accepts. Automaton has 106650 states and 596446 transitions. Word has length 34 [2022-03-15 19:15:43,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:15:43,023 INFO L470 AbstractCegarLoop]: Abstraction has 106650 states and 596446 transitions. [2022-03-15 19:15:43,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.695652173913043) internal successors, (223), 23 states have internal predecessors, (223), 0 states have call successors, (0), 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 19:15:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 106650 states and 596446 transitions. [2022-03-15 19:15:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:15:43,678 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:15:43,679 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:15:43,695 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 19:15:43,879 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,SelfDestructingSolverStorable27 [2022-03-15 19:15:43,879 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:15:43,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:15:43,880 INFO L85 PathProgramCache]: Analyzing trace with hash -737180583, now seen corresponding path program 19 times [2022-03-15 19:15:43,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:15:43,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840843249] [2022-03-15 19:15:43,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:15:43,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:15:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:15:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:15:43,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:15:43,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840843249] [2022-03-15 19:15:43,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840843249] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:15:43,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832350673] [2022-03-15 19:15:43,929 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:15:43,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:15:43,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:15:43,930 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 19:15:43,931 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 19:15:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:15:44,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:15:44,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:15:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:15:44,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:15:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:15:44,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832350673] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:15:44,154 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:15:44,154 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-03-15 19:15:44,154 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1313836424] [2022-03-15 19:15:44,154 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:15:44,157 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:15:44,431 INFO L252 McrAutomatonBuilder]: Finished intersection with 1130 states and 3568 transitions. [2022-03-15 19:15:44,431 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:15:57,314 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [3012886#(or (<= (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3012924#(or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 3 ~N~0) (<= ~N~0 2)), 3012925#(or (< 3 ~N~0) (<= ~N~0 2) (= thread3Thread1of1ForFork0_~i~2 0)), 3012898#(or (<= (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3012900#(or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 3012910#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3012901#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 3 ~N~0))), 3012885#(or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3012887#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 3012895#(or (< 3 ~N~0) (<= ~N~0 2)), 3012913#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 3 ~N~0))), 3012911#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 3012919#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0))), 3012902#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 3 ~N~0)), 3012905#(or (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3012908#(or (<= ~N~0 1) (<= 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3012915#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 3 ~N~0)), 3012917#(or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 3012891#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 3012922#(or (< 3 ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= ~N~0 2)), 3012896#(or (<= ~N~0 1) (<= 3 ~N~0)), 3012918#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3012893#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 3012907#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (< 3 ~N~0) (<= ~N~0 2)), 3012904#(or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3012906#(and (or (<= 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 3012920#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 1) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< 2 ~N~0)), 3012889#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 3012921#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 3012912#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3012890#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 3012897#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3012909#(or (<= 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3012923#(or (< 3 ~N~0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 2) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3012892#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3012903#(or (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3012916#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 3012914#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 1) (<= 3 ~N~0)), 3012894#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< thread3Thread1of1ForFork0_~i~2 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 3012888#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3012899#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 1) (<= 3 ~N~0))] [2022-03-15 19:15:57,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 19:15:57,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:15:57,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 19:15:57,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=2574, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:15:57,315 INFO L87 Difference]: Start difference. First operand 106650 states and 596446 transitions. Second operand has 50 states, 50 states have (on average 7.32) internal successors, (366), 50 states have internal predecessors, (366), 0 states have call successors, (0), 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 19:16:06,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:16:06,968 INFO L93 Difference]: Finished difference Result 348154 states and 1909727 transitions. [2022-03-15 19:16:06,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-03-15 19:16:06,968 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 7.32) internal successors, (366), 50 states have internal predecessors, (366), 0 states have call successors, (0), 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 35 [2022-03-15 19:16:06,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:16:12,102 INFO L225 Difference]: With dead ends: 348154 [2022-03-15 19:16:12,102 INFO L226 Difference]: Without dead ends: 347216 [2022-03-15 19:16:12,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1377 GetRequests, 1175 SyntacticMatches, 46 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8009 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4471, Invalid=20335, Unknown=0, NotChecked=0, Total=24806 [2022-03-15 19:16:12,104 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 1767 mSDsluCounter, 3263 mSDsCounter, 0 mSdLazyCounter, 4748 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 5156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 4748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:16:12,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1767 Valid, 1161 Invalid, 5156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 4748 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 19:16:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347216 states. [2022-03-15 19:16:23,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347216 to 219214. [2022-03-15 19:16:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219214 states, 219213 states have (on average 5.759777020523418) internal successors, (1262618), 219213 states have internal predecessors, (1262618), 0 states have call successors, (0), 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 19:16:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219214 states to 219214 states and 1262618 transitions. [2022-03-15 19:16:26,255 INFO L78 Accepts]: Start accepts. Automaton has 219214 states and 1262618 transitions. Word has length 35 [2022-03-15 19:16:26,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:16:26,255 INFO L470 AbstractCegarLoop]: Abstraction has 219214 states and 1262618 transitions. [2022-03-15 19:16:26,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 7.32) internal successors, (366), 50 states have internal predecessors, (366), 0 states have call successors, (0), 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 19:16:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 219214 states and 1262618 transitions. [2022-03-15 19:16:27,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:16:27,584 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:16:27,584 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:16:27,600 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 19:16:27,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:16:27,785 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:16:27,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:16:27,785 INFO L85 PathProgramCache]: Analyzing trace with hash -239017424, now seen corresponding path program 20 times [2022-03-15 19:16:27,786 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:16:27,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005237884] [2022-03-15 19:16:27,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:16:27,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:16:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:16:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:16:27,935 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:16:27,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005237884] [2022-03-15 19:16:27,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005237884] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:16:27,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333028809] [2022-03-15 19:16:27,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:16:27,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:16:27,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:16:27,937 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 19:16:27,937 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 19:16:28,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:16:28,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:16:28,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 19:16:28,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:16:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-15 19:16:28,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:16:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-15 19:16:28,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333028809] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:16:28,230 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:16:28,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 28 [2022-03-15 19:16:28,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1718140222] [2022-03-15 19:16:28,231 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:16:28,234 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:16:28,750 INFO L252 McrAutomatonBuilder]: Finished intersection with 1168 states and 3700 transitions. [2022-03-15 19:16:28,750 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:07,323 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 331 new interpolants: [3800049#(< |thread2Thread1of1ForFork3_~i~1#1| ~N~0), 3800250#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800368#(<= ~N~0 0), 3800281#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 3 ~N~0)), 3800157#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800245#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 0) (< 1 ~N~0)), 3800353#(and (<= 1 thread3Thread1of1ForFork0_~i~2) (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 3800139#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< 3 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800374#(<= 3 ~N~0), 3800063#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800176#(and (or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= (+ 3 ~N~0) 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 3800254#(or (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3800074#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (<= ~N~0 0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800105#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (< 3 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)), 3800294#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< 3 ~N~0) (<= ~N~0 2)), 3800088#(or (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0)), 3800159#(or (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800270#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800349#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3800201#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0))), 3800158#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800204#(and (or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)) (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2))), 3800147#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 3800087#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800372#(and (<= 1 thread3Thread1of1ForFork0_~i~2) (= |thread4Thread1of1ForFork2_~i~3#1| 0)), 3800207#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800332#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)), 3800077#(or (< (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 0) (< 1 ~N~0)), 3800347#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800189#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800220#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= ~N~0 2)), 3800348#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0)), 3800079#(or (< (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800236#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800308#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< 3 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3800336#(or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800275#(and (or (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 0) (< 1 ~N~0)) (or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (< 1 ~N~0))), 3800377#(= thread3Thread1of1ForFork0_~i~2 0), 3800115#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800094#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800137#(and (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))) (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)))), 3800055#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800235#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 3800200#(and (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))) (or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)))), 3800099#(or (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (<= ~N~0 0) (< 1 ~N~0)), 3800135#(and (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0)) (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|))), 3800214#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)), 3800175#(and (or (<= (+ 3 ~N~0) 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 3800217#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< 3 ~N~0) (<= ~N~0 2) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800355#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 3800343#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ 3 ~N~0) 0)), 3800306#(or (< 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3800231#(or (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800329#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800124#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800215#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 3800050#(< thread3Thread1of1ForFork0_~i~2 ~N~0), 3800110#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 3800069#(or (<= ~N~0 0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800352#(and (<= 2 thread3Thread1of1ForFork0_~i~2) (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 3800354#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 3800121#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800154#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800335#(or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800116#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800373#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 3800187#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3800184#(and (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)) (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))), 3800255#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800164#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800291#(or (< 3 ~N~0) (<= ~N~0 2)), 3800359#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 0) (< 1 ~N~0)), 3800080#(or (< (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 3800288#(and (or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 0) (< 1 ~N~0)) (or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (< 1 ~N~0))), 3800072#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 3800295#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0) (< 3 ~N~0) (<= ~N~0 2)), 3800356#(or (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 0) (< 1 ~N~0)), 3800162#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800198#(and (or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)) (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|))), 3800119#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800237#(or (<= ~N~0 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< 1 ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800206#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800142#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 3800127#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800271#(or (< (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800314#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< 3 ~N~0) (<= ~N~0 2)), 3800311#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3800052#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 3800112#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 3800167#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800186#(and (or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)) (or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|))), 3800190#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800315#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ 3 ~N~0) 0)), 3800287#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 3800342#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ 3 ~N~0) 0)), 3800149#(or (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 3800266#(or (< (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 0) (< 1 ~N~0)), 3800340#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< 3 ~N~0) (<= ~N~0 2) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 3800225#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 3 ~N~0)), 3800219#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 2)), 3800145#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 3800229#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), 3800097#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (<= ~N~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800283#(and (<= 1 thread3Thread1of1ForFork0_~i~2) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 3800322#(or (< (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< 3 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)), 3800140#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 3800096#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 3800327#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0)), 3800247#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 0) (< 1 ~N~0)), 3800279#(and (or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)) (or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))), 3800321#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800076#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800152#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800265#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800179#(and (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= (+ 3 ~N~0) 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 3800118#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800209#(and (or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork3_~i~1#1| 0)) (or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ 3 ~N~0) 0))), 3800341#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< 3 ~N~0) (<= ~N~0 2) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 3800170#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)), 3800309#(or (<= (+ 3 ~N~0) 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3800202#(and (or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)) (or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|))), 3800194#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0))), 3800092#(or (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800284#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 3 ~N~0)), 3800290#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 3800234#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (<= ~N~0 0) (< 1 ~N~0)), 3800259#(or (<= ~N~0 0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800146#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 3800282#(and (<= 2 thread3Thread1of1ForFork0_~i~2) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 3800133#(or (< (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800180#(and (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 3800325#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0)), 3800108#(or (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)), 3800111#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0)), 3800064#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800297#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0) (< 3 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)), 3800252#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800098#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (<= ~N~0 0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800160#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800122#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800238#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800360#(or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 0) (< 1 ~N~0)), 3800161#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800228#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 3800338#(or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800197#(and (or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0)) (or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))), 3800367#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 3800089#(or (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800370#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= 3 ~N~0)), 3800203#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)), 3800205#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800150#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800241#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800221#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800153#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800060#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800233#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 3800131#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800192#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork3_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ 3 ~N~0) 0))), 3800239#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 3800070#(or (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800106#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< 3 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)), 3800210#(and (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)) (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0))), 3800103#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (<= ~N~0 0) (< 1 ~N~0)), 3800339#(or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)), 3800144#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 3800274#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 0) (< 1 ~N~0)), 3800299#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< 3 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= ~N~0 2)), 3800298#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0)), 3800278#(and (or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (< 1 ~N~0)) (or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 0) (< 1 ~N~0))), 3800199#(and (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)) (or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))), 3800365#(and (<= 2 thread3Thread1of1ForFork0_~i~2) (= thread1Thread1of1ForFork1_~i~0 0)), 3800113#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800276#(and (or (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)) (or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))), 3800326#(<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0), 3800148#(or (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 3800132#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800313#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3800075#(or (< (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800165#(or (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800318#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< 3 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)), 3800362#(or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800262#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800300#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= (+ 3 ~N~0) 0)), 3800171#(or (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)), 3800062#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800358#(or (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800071#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 3800312#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= (+ 3 ~N~0) 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3800310#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= (+ 3 ~N~0) 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3800173#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800212#(and (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))) (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)))), 3800257#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (<= ~N~0 0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800337#(or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800136#(and (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)) (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= (+ 3 ~N~0) 0))), 3800344#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< 3 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 3800334#(or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0)), 3800191#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800286#(and (<= 1 thread3Thread1of1ForFork0_~i~2) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), 3800104#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< 3 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)), 3800177#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800129#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800375#(<= 2 thread3Thread1of1ForFork0_~i~2), 3800058#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800143#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0)), 3800102#(or (< (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (<= ~N~0 0) (< 1 ~N~0)), 3800317#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= (+ 3 ~N~0) 0)), 3800213#(and (or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)) (or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0))), 3800263#(or (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3800232#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 3800126#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800364#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 3 ~N~0)), 3800051#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 3800134#(and (or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)) (or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= (+ 3 ~N~0) 0))), 3800261#(or (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800216#(or (< 3 ~N~0) (<= ~N~0 2) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800324#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3800319#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0)), 3800114#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800100#(or (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800253#(or (<= ~N~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800243#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800357#(or (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800223#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 3800316#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< 3 ~N~0) (<= ~N~0 2)), 3800328#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800057#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800240#(or (<= ~N~0 0) (< 1 ~N~0) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800130#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800369#(<= (* |thread4Thread1of1ForFork2_~i~3#1| 3) ~N~0), 3800264#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800195#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= (+ 3 ~N~0) 0))), 3800086#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800065#(or (<= ~N~0 0) (< 1 ~N~0)), 3800272#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3800073#(or (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (<= ~N~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800138#(and (or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)) (or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0))), 3800095#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (<= ~N~0 0) (< 1 ~N~0)), 3800174#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800268#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 3800169#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800320#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= (+ 3 ~N~0) 0)), 3800181#(and (or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 3800302#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800226#(and (<= 2 thread3Thread1of1ForFork0_~i~2) (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), 3800156#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800155#(or (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800366#(and (<= 1 thread3Thread1of1ForFork0_~i~2) (= thread1Thread1of1ForFork1_~i~0 0)), 3800351#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 3 ~N~0)), 3800244#(or (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3800128#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800090#(or (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800280#(and (or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))) (or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)))), 3800178#(and (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 3800196#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)))), 3800346#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= (+ 3 ~N~0) 0)), 3800222#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)), 3800292#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (< 3 ~N~0) (<= ~N~0 2)), 3800166#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800141#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0)), 3800163#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800267#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 0) (< 1 ~N~0) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800376#(<= 1 thread3Thread1of1ForFork0_~i~2), 3800249#(or (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800117#(or (< (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800307#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3800258#(or (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800350#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (* |thread4Thread1of1ForFork2_~i~3#1| 3) ~N~0)), 3800331#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800273#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 0) (< 1 ~N~0)), 3800218#(<= ~N~0 2), 3800256#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800304#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< 3 ~N~0) (<= ~N~0 2)), 3800067#(or (<= ~N~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800251#(or (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800248#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (<= ~N~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800303#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< 3 ~N~0) (<= ~N~0 2)), 3800109#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800345#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0)), 3800211#(and (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)) (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= (+ 3 ~N~0) 0))), 3800183#(and (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)) (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|))), 3800056#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800293#(<= (+ 3 ~N~0) 0), 3800371#(and (<= 2 thread3Thread1of1ForFork0_~i~2) (= |thread4Thread1of1ForFork2_~i~3#1| 0)), 3800151#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800188#(and (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)) (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2))), 3800269#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 3800378#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 3800082#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 3800285#(and (<= 2 thread3Thread1of1ForFork0_~i~2) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), 3799998#(< |thread4Thread1of1ForFork2_~i~3#1| ~N~0), 3800120#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800260#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800125#(or (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800242#(or (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 3800305#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< 3 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)), 3800323#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= (+ 3 ~N~0) 0)), 3800227#(and (<= 1 thread3Thread1of1ForFork0_~i~2) (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), 3800296#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= (+ 3 ~N~0) 0)), 3800289#(and (or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (< 1 ~N~0)) (or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 0) (< 1 ~N~0))), 3800101#(or (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800182#(and (or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)) (or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0))), 3800246#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 0) (< 1 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork3_~i~1#1|)) (< (+ 3 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0)), 3800172#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2) (<= (+ ~N~0 4) |thread2Thread1of1ForFork3_~i~1#1|)), 3800091#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800224#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= (* |thread4Thread1of1ForFork2_~i~3#1| 3) ~N~0)), 3800107#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)), 3800301#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< 3 ~N~0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800078#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 0) (< 1 ~N~0)), 3800185#(and (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))) (or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)))), 3800330#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 3800093#(or (< (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800230#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 3800208#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork3_~i~1#1| 0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ 3 ~N~0) 0))), 3800084#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 3800068#(or (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800083#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 3800333#(<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0), 3800277#(and (or (<= (+ (* 2 ~N~0) 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))) (or (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)))), 3800054#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 3800193#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (<= (+ 3 ~N~0) 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))), 3800066#(or (< thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~N~0 0) (< 1 ~N~0)), 3800061#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800363#(or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 0) (< 1 ~N~0)), 3800168#(or (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= (+ 5 ~N~0) |thread2Thread1of1ForFork3_~i~1#1|) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800081#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|)), 3800053#(or (< |thread4Thread1of1ForFork2_~i~3#1| ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0)), 3800123#(or (<= ~N~0 (+ |thread2Thread1of1ForFork3_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork3_~i~1#1|) ~N~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (< 3 ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (<= ~N~0 2)), 3800361#(or (<= (+ (* 2 ~N~0) 1) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 0) (< 1 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 3800085#(or (< (+ |thread2Thread1of1ForFork3_~i~1#1| 1) ~N~0) (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork3_~i~1#1|) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|)), 3800059#(or (< (+ |thread4Thread1of1ForFork2_~i~3#1| 1) ~N~0) (<= ~N~0 |thread4Thread1of1ForFork2_~i~3#1|) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))] [2022-03-15 19:17:07,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 347 states [2022-03-15 19:17:07,324 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:07,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 347 interpolants. [2022-03-15 19:17:07,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12587, Invalid=115219, Unknown=0, NotChecked=0, Total=127806 [2022-03-15 19:17:07,330 INFO L87 Difference]: Start difference. First operand 219214 states and 1262618 transitions. Second operand has 347 states, 347 states have (on average 4.962536023054755) internal successors, (1722), 347 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)