/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-figure1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:17:11,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:17:11,384 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:17:11,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:17:11,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:17:11,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:17:11,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:17:11,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:17:11,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:17:11,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:17:11,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:17:11,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:17:11,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:17:11,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:17:11,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:17:11,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:17:11,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:17:11,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:17:11,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:17:11,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:17:11,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:17:11,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:17:11,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:17:11,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:17:11,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:17:11,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:17:11,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:17:11,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:17:11,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:17:11,479 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:17:11,479 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:17:11,480 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:17:11,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:17:11,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:17:11,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:17:11,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:17:11,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:17:11,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:17:11,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:17:11,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:17:11,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:17:11,485 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:17:11,509 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:17:11,509 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:17:11,510 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:17:11,510 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:17:11,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:17:11,511 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:17:11,511 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:17:11,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:17:11,511 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:17:11,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:17:11,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:17:11,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:17:11,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:17:11,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:17:11,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:17:11,512 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:17:11,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:17:11,512 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:17:11,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:17:11,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:17:11,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:17:11,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:17:11,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:17:11,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:17:11,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:17:11,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:17:11,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:17:11,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:17:11,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:17:11,514 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:17:11,514 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:17:11,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:17:11,514 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:17:11,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:17:11,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:17:11,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:17:11,734 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:17:11,735 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:17:11,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-figure1.wvr.c [2022-03-15 19:17:11,792 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79645c2ea/46c57029f2fd4dbc8b5cda6d13c1d5f0/FLAGa51041ab1 [2022-03-15 19:17:12,180 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:17:12,181 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1.wvr.c [2022-03-15 19:17:12,191 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79645c2ea/46c57029f2fd4dbc8b5cda6d13c1d5f0/FLAGa51041ab1 [2022-03-15 19:17:12,202 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79645c2ea/46c57029f2fd4dbc8b5cda6d13c1d5f0 [2022-03-15 19:17:12,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:17:12,206 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:17:12,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:17:12,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:17:12,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:17:12,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:17:12" (1/1) ... [2022-03-15 19:17:12,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2f3e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:17:12, skipping insertion in model container [2022-03-15 19:17:12,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:17:12" (1/1) ... [2022-03-15 19:17:12,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:17:12,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:17:12,404 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-figure1.wvr.c[1991,2004] [2022-03-15 19:17:12,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:17:12,411 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:17:12,424 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-figure1.wvr.c[1991,2004] [2022-03-15 19:17:12,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:17:12,433 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:17:12,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:17:12 WrapperNode [2022-03-15 19:17:12,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:17:12,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:17:12,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:17:12,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:17:12,440 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:17:12" (1/1) ... [2022-03-15 19:17:12,447 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:17:12" (1/1) ... [2022-03-15 19:17:12,469 INFO L137 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2022-03-15 19:17:12,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:17:12,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:17:12,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:17:12,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:17:12,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:17:12" (1/1) ... [2022-03-15 19:17:12,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:17:12" (1/1) ... [2022-03-15 19:17:12,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:17:12" (1/1) ... [2022-03-15 19:17:12,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:17:12" (1/1) ... [2022-03-15 19:17:12,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:17:12" (1/1) ... [2022-03-15 19:17:12,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:17:12" (1/1) ... [2022-03-15 19:17:12,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:17:12" (1/1) ... [2022-03-15 19:17:12,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:17:12,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:17:12,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:17:12,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:17:12,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:17:12" (1/1) ... [2022-03-15 19:17:12,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:17:12,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:12,532 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:17:12,540 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:17:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:17:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:17:12,564 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:17:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:17:12,564 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:17:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:17:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:17:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:17:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:17:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:17:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:17:12,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:17:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:17:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:17:12,566 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:17:12,625 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:17:12,626 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:17:12,838 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:17:12,867 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:17:12,868 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 19:17:12,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:17:12 BoogieIcfgContainer [2022-03-15 19:17:12,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:17:12,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:17:12,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:17:12,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:17:12,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:17:12" (1/3) ... [2022-03-15 19:17:12,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a4ba07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:17:12, skipping insertion in model container [2022-03-15 19:17:12,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:17:12" (2/3) ... [2022-03-15 19:17:12,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a4ba07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:17:12, skipping insertion in model container [2022-03-15 19:17:12,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:17:12" (3/3) ... [2022-03-15 19:17:12,875 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-figure1.wvr.c [2022-03-15 19:17:12,879 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:17:12,879 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:17:12,879 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:17:12,880 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:17:12,930 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,930 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,931 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,931 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,931 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,932 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,933 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,933 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,933 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,933 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,933 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,934 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,934 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,934 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,934 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,934 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,934 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,935 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,935 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,935 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,941 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,941 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,941 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,944 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,944 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,944 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,944 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,951 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,951 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,951 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,951 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,951 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:17:12,956 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 19:17:13,019 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:17:13,026 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:17:13,026 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 19:17:13,045 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:17:13,053 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 77 transitions, 170 flow [2022-03-15 19:17:13,056 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 77 transitions, 170 flow [2022-03-15 19:17:13,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 77 transitions, 170 flow [2022-03-15 19:17:13,107 INFO L129 PetriNetUnfolder]: 5/75 cut-off events. [2022-03-15 19:17:13,107 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 19:17:13,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 75 events. 5/75 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2022-03-15 19:17:13,111 INFO L116 LiptonReduction]: Number of co-enabled transitions 500 [2022-03-15 19:17:14,879 INFO L131 LiptonReduction]: Checked pairs total: 540 [2022-03-15 19:17:14,879 INFO L133 LiptonReduction]: Total number of compositions: 66 [2022-03-15 19:17:14,886 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 18 transitions, 52 flow [2022-03-15 19:17:14,907 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 33 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:14,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 33 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:14,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 19:17:14,915 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:14,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:14,916 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:14,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:14,920 INFO L85 PathProgramCache]: Analyzing trace with hash -391445650, now seen corresponding path program 1 times [2022-03-15 19:17:14,935 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:14,935 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969241845] [2022-03-15 19:17:14,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:14,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:15,178 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:17:15,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:15,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969241845] [2022-03-15 19:17:15,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969241845] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:17:15,191 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:17:15,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 19:17:15,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1958396233] [2022-03-15 19:17:15,194 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:15,199 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:15,220 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 57 transitions. [2022-03-15 19:17:15,220 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:15,445 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:17:15,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:17:15,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:15,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:17:15,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:17:15,468 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 33 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:17:15,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:15,498 INFO L93 Difference]: Finished difference Result 57 states and 116 transitions. [2022-03-15 19:17:15,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:17:15,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 19:17:15,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:15,506 INFO L225 Difference]: With dead ends: 57 [2022-03-15 19:17:15,506 INFO L226 Difference]: Without dead ends: 42 [2022-03-15 19:17:15,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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:17:15,510 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:15,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:17:15,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-03-15 19:17:15,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-03-15 19:17:15,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.1463414634146343) internal successors, (88), 41 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have 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:17:15,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 88 transitions. [2022-03-15 19:17:15,538 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 88 transitions. Word has length 13 [2022-03-15 19:17:15,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:15,538 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 88 transitions. [2022-03-15 19:17:15,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:17:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 88 transitions. [2022-03-15 19:17:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 19:17:15,539 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:15,539 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:15,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:17:15,540 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:15,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:15,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1493061661, now seen corresponding path program 1 times [2022-03-15 19:17:15,542 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:15,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335683241] [2022-03-15 19:17:15,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:15,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:15,625 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:17:15,625 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:15,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335683241] [2022-03-15 19:17:15,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335683241] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:15,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981170588] [2022-03-15 19:17:15,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:15,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:15,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:15,628 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:17:15,639 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:17:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:15,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 19:17:15,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:15,798 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:17:15,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:15,844 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:17:15,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981170588] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:15,844 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:15,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-03-15 19:17:15,845 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1213187310] [2022-03-15 19:17:15,845 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:15,847 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:15,850 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 74 transitions. [2022-03-15 19:17:15,850 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:16,300 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [385#(and (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 387#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (< 1 ~N~0)), 383#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0))), 386#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< 0 ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 381#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 382#(or (<= ~N~0 0) (< 1 ~N~0)), 380#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 384#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< 0 ~N~0))] [2022-03-15 19:17:16,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:17:16,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:16,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:17:16,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:17:16,303 INFO L87 Difference]: Start difference. First operand 42 states and 88 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:16,746 INFO L93 Difference]: Finished difference Result 66 states and 144 transitions. [2022-03-15 19:17:16,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:17:16,746 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 19:17:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:16,747 INFO L225 Difference]: With dead ends: 66 [2022-03-15 19:17:16,747 INFO L226 Difference]: Without dead ends: 66 [2022-03-15 19:17:16,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:17:16,749 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 52 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:16,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 31 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:17:16,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-03-15 19:17:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2022-03-15 19:17:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.235294117647059) internal successors, (114), 51 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have 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:17:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 114 transitions. [2022-03-15 19:17:16,755 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 114 transitions. Word has length 14 [2022-03-15 19:17:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:16,755 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 114 transitions. [2022-03-15 19:17:16,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 114 transitions. [2022-03-15 19:17:16,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 19:17:16,757 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:16,757 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:16,786 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:17:16,977 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:17:16,977 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:16,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:16,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1860331411, now seen corresponding path program 1 times [2022-03-15 19:17:16,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:16,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39554345] [2022-03-15 19:17:16,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:16,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:17,048 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:17,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39554345] [2022-03-15 19:17:17,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39554345] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:17,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462433160] [2022-03-15 19:17:17,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:17,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:17,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:17,050 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:17:17,071 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:17:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:17,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 19:17:17,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:17,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:17,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:17,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462433160] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:17,190 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:17,190 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2022-03-15 19:17:17,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1301039008] [2022-03-15 19:17:17,190 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:17,192 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:17,197 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 76 transitions. [2022-03-15 19:17:17,197 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:17,543 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [677#(or (= ~counter~0 0) (<= (+ ~counter~0 1) 0)), 676#(or (<= ~counter~0 0) (= ~counter~0 1))] [2022-03-15 19:17:17,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:17:17,544 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:17,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:17:17,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:17:17,544 INFO L87 Difference]: Start difference. First operand 52 states and 114 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:17,587 INFO L93 Difference]: Finished difference Result 95 states and 203 transitions. [2022-03-15 19:17:17,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:17:17,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 19:17:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:17,588 INFO L225 Difference]: With dead ends: 95 [2022-03-15 19:17:17,588 INFO L226 Difference]: Without dead ends: 76 [2022-03-15 19:17:17,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:17:17,589 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 18 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:17,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 7 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:17:17,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-03-15 19:17:17,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-03-15 19:17:17,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.2615384615384615) internal successors, (147), 65 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have 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:17:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 147 transitions. [2022-03-15 19:17:17,595 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 147 transitions. Word has length 15 [2022-03-15 19:17:17,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:17,595 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 147 transitions. [2022-03-15 19:17:17,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:17,596 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 147 transitions. [2022-03-15 19:17:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 19:17:17,596 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:17,596 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:17,621 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:17:17,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-03-15 19:17:17,819 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:17,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1600441788, now seen corresponding path program 2 times [2022-03-15 19:17:17,822 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:17,822 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961274213] [2022-03-15 19:17:17,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:17,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:17:17,865 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:17,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961274213] [2022-03-15 19:17:17,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961274213] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:17,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062466294] [2022-03-15 19:17:17,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:17:17,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:17,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:17,866 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:17:17,871 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:17:17,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:17:17,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:17,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 19:17:17,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:17:17,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:17:18,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062466294] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:18,033 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:18,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 19:17:18,033 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1599088784] [2022-03-15 19:17:18,033 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:18,035 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:18,042 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 91 transitions. [2022-03-15 19:17:18,042 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:18,503 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [1011#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 1006#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 999#(<= 1 ~N~0), 1005#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< 0 ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1008#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< 0 ~N~0)), 1003#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1009#(or (<= ~N~0 1) (< 2 ~N~0)), 1002#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< 0 ~N~0)), 1007#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0))), 1004#(and (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1001#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0))), 1010#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1) (< 2 ~N~0)), 1000#(< thread1Thread1of1ForFork1_~i~0 ~N~0)] [2022-03-15 19:17:18,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:17:18,503 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:18,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:17:18,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:17:18,504 INFO L87 Difference]: Start difference. First operand 66 states and 147 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:18,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:18,889 INFO L93 Difference]: Finished difference Result 88 states and 181 transitions. [2022-03-15 19:17:18,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:17:18,890 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 19:17:18,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:18,891 INFO L225 Difference]: With dead ends: 88 [2022-03-15 19:17:18,891 INFO L226 Difference]: Without dead ends: 88 [2022-03-15 19:17:18,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:17:18,892 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 71 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:18,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 36 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:17:18,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-03-15 19:17:18,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2022-03-15 19:17:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.2) internal successors, (143), 65 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have 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:17:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 143 transitions. [2022-03-15 19:17:18,898 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 143 transitions. Word has length 15 [2022-03-15 19:17:18,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:18,898 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 143 transitions. [2022-03-15 19:17:18,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:18,899 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 143 transitions. [2022-03-15 19:17:18,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:17:18,899 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:18,900 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:18,931 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:17:19,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:19,116 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:19,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:19,116 INFO L85 PathProgramCache]: Analyzing trace with hash 343604130, now seen corresponding path program 2 times [2022-03-15 19:17:19,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:19,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779903458] [2022-03-15 19:17:19,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:19,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:19,166 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:17:19,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:19,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779903458] [2022-03-15 19:17:19,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779903458] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:19,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679617553] [2022-03-15 19:17:19,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:17:19,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:19,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:19,168 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:17:19,199 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:17:19,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:17:19,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:19,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:17:19,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:19,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:19,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679617553] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:19,360 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:19,360 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 19:17:19,360 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [891722379] [2022-03-15 19:17:19,360 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:19,362 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:19,368 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 88 transitions. [2022-03-15 19:17:19,368 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:20,144 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [1375#(and (or (= |thread2Thread1of1ForFork0_~i~1#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))), 1373#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= ~N~0 1) (< 2 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1379#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1) (< 2 ~N~0)), 1363#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1367#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1374#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 2 ~N~0))), 1376#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 2 ~N~0))), 1380#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 2 ~N~0)), 1365#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1372#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 0) (<= 2 ~N~0)), 1378#(or (<= 2 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1364#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1368#(or (<= ~N~0 0) (<= 2 ~N~0)), 1369#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (<= 2 ~N~0)), 1366#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1370#(or (<= ~N~0 0) (<= 2 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1371#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1377#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 2 ~N~0))] [2022-03-15 19:17:20,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:17:20,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:20,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:17:20,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:17:20,146 INFO L87 Difference]: Start difference. First operand 66 states and 143 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:21,569 INFO L93 Difference]: Finished difference Result 156 states and 358 transitions. [2022-03-15 19:17:21,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 19:17:21,570 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 19:17:21,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:21,571 INFO L225 Difference]: With dead ends: 156 [2022-03-15 19:17:21,571 INFO L226 Difference]: Without dead ends: 156 [2022-03-15 19:17:21,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=908, Invalid=3124, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:17:21,573 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 185 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:21,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 34 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:17:21,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-03-15 19:17:21,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 94. [2022-03-15 19:17:21,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.5053763440860215) internal successors, (233), 93 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have 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:17:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 233 transitions. [2022-03-15 19:17:21,582 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 233 transitions. Word has length 16 [2022-03-15 19:17:21,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:21,582 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 233 transitions. [2022-03-15 19:17:21,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:21,582 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 233 transitions. [2022-03-15 19:17:21,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:17:21,583 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:21,583 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:21,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 19:17:21,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:21,799 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:21,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:21,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1884019080, now seen corresponding path program 3 times [2022-03-15 19:17:21,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:21,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946150547] [2022-03-15 19:17:21,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:21,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:21,848 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:17:21,849 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:21,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946150547] [2022-03-15 19:17:21,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946150547] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:21,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231411478] [2022-03-15 19:17:21,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:17:21,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:21,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:21,850 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:17:21,882 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:17:21,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:17:21,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:21,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:17:21,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:21,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:22,022 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:17:22,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231411478] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:22,022 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:22,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-03-15 19:17:22,022 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1905407218] [2022-03-15 19:17:22,022 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:22,024 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:22,027 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 62 transitions. [2022-03-15 19:17:22,027 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:22,395 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [1934#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1933#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1938#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1936#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1932#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1941#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 0 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1939#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 0) (<= 2 ~N~0)), 1940#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= ~N~0 1) (< 2 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1942#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0)), 1943#(or (<= 0 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1935#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1937#(or (<= ~N~0 0) (<= 2 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))] [2022-03-15 19:17:22,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:17:22,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:22,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:17:22,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:17:22,396 INFO L87 Difference]: Start difference. First operand 94 states and 233 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:23,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:23,304 INFO L93 Difference]: Finished difference Result 224 states and 500 transitions. [2022-03-15 19:17:23,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 19:17:23,305 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 19:17:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:23,307 INFO L225 Difference]: With dead ends: 224 [2022-03-15 19:17:23,307 INFO L226 Difference]: Without dead ends: 220 [2022-03-15 19:17:23,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=2022, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:17:23,310 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 138 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:23,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 21 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:17:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-03-15 19:17:23,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 110. [2022-03-15 19:17:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 2.623853211009174) internal successors, (286), 109 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:17:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 286 transitions. [2022-03-15 19:17:23,330 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 286 transitions. Word has length 16 [2022-03-15 19:17:23,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:23,330 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 286 transitions. [2022-03-15 19:17:23,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 286 transitions. [2022-03-15 19:17:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:17:23,331 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:23,332 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:23,359 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:17:23,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:23,556 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:23,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:23,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1043461531, now seen corresponding path program 3 times [2022-03-15 19:17:23,558 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:23,558 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696393830] [2022-03-15 19:17:23,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:23,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:17:23,605 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:23,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696393830] [2022-03-15 19:17:23,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696393830] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:17:23,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:17:23,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:17:23,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1858580122] [2022-03-15 19:17:23,605 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:23,608 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:23,614 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 108 transitions. [2022-03-15 19:17:23,614 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:23,813 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [2480#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 2478#(< 0 ~N~0), 2479#(<= ~N~0 0), 2477#(< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)] [2022-03-15 19:17:23,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:17:23,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:23,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:17:23,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:17:23,814 INFO L87 Difference]: Start difference. First operand 110 states and 286 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:17:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:23,909 INFO L93 Difference]: Finished difference Result 118 states and 298 transitions. [2022-03-15 19:17:23,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:17:23,909 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 19:17:23,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:23,910 INFO L225 Difference]: With dead ends: 118 [2022-03-15 19:17:23,910 INFO L226 Difference]: Without dead ends: 114 [2022-03-15 19:17:23,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:17:23,911 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 15 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:23,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 23 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:17:23,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-03-15 19:17:23,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2022-03-15 19:17:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 2.6285714285714286) internal successors, (276), 105 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have 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:17:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 276 transitions. [2022-03-15 19:17:23,916 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 276 transitions. Word has length 16 [2022-03-15 19:17:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:23,916 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 276 transitions. [2022-03-15 19:17:23,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:17:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 276 transitions. [2022-03-15 19:17:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:17:23,917 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:23,917 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:23,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 19:17:23,918 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:23,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:23,918 INFO L85 PathProgramCache]: Analyzing trace with hash -758266738, now seen corresponding path program 4 times [2022-03-15 19:17:23,926 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:23,926 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558284532] [2022-03-15 19:17:23,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:23,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:23,992 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:23,993 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558284532] [2022-03-15 19:17:23,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558284532] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:23,993 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801187336] [2022-03-15 19:17:23,993 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:17:23,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:23,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:23,994 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:17:24,027 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:17:24,064 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:17:24,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:24,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:17:24,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:24,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:24,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801187336] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:24,171 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:24,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 6 [2022-03-15 19:17:24,171 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1636543880] [2022-03-15 19:17:24,171 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:24,173 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:24,178 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 100 transitions. [2022-03-15 19:17:24,178 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:24,502 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [2845#(<= ~counter~0 2), 2841#(<= ~counter~0 1), 2828#(<= ~counter~0 0)] [2022-03-15 19:17:24,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:17:24,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:24,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:17:24,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:17:24,503 INFO L87 Difference]: Start difference. First operand 106 states and 276 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:24,565 INFO L93 Difference]: Finished difference Result 201 states and 500 transitions. [2022-03-15 19:17:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:17:24,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 19:17:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:24,567 INFO L225 Difference]: With dead ends: 201 [2022-03-15 19:17:24,567 INFO L226 Difference]: Without dead ends: 178 [2022-03-15 19:17:24,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:17:24,568 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 47 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:24,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 13 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:17:24,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-03-15 19:17:24,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 140. [2022-03-15 19:17:24,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.7050359712230216) internal successors, (376), 139 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:17:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 376 transitions. [2022-03-15 19:17:24,582 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 376 transitions. Word has length 17 [2022-03-15 19:17:24,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:24,583 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 376 transitions. [2022-03-15 19:17:24,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 376 transitions. [2022-03-15 19:17:24,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:17:24,588 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:24,588 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:24,614 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:17:24,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:24,812 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:24,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:24,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1784562985, now seen corresponding path program 5 times [2022-03-15 19:17:24,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:24,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118655801] [2022-03-15 19:17:24,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:24,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:24,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:24,858 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:24,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118655801] [2022-03-15 19:17:24,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118655801] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:24,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305304348] [2022-03-15 19:17:24,858 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:17:24,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:24,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:24,860 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:17:24,889 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:17:24,926 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:17:24,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:24,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:17:24,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:17:24,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:17:25,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305304348] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:25,024 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:25,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-03-15 19:17:25,027 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [72785619] [2022-03-15 19:17:25,027 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:25,029 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:25,032 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 70 transitions. [2022-03-15 19:17:25,032 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:25,330 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [3516#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 0)), 3519#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 3514#(< |thread2Thread1of1ForFork0_~i~1#1| ~N~0), 3520#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0)), 3523#(or (<= 0 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 3521#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0) (<= (+ ~N~0 1) thread1Thread1of1ForFork1_~i~0)), 3515#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) thread1Thread1of1ForFork1_~i~0)), 3518#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 0 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 3517#(or (<= |thread2Thread1of1ForFork0_~i~1#1| thread1Thread1of1ForFork1_~i~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|)), 3522#(or (<= ~N~0 0) (<= 0 thread1Thread1of1ForFork1_~i~0))] [2022-03-15 19:17:25,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:17:25,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:25,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:17:25,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:17:25,331 INFO L87 Difference]: Start difference. First operand 140 states and 376 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:25,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:25,673 INFO L93 Difference]: Finished difference Result 202 states and 492 transitions. [2022-03-15 19:17:25,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:17:25,673 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 19:17:25,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:25,674 INFO L225 Difference]: With dead ends: 202 [2022-03-15 19:17:25,674 INFO L226 Difference]: Without dead ends: 194 [2022-03-15 19:17:25,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=339, Invalid=921, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:17:25,675 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 66 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:25,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 20 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:17:25,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-03-15 19:17:25,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 114. [2022-03-15 19:17:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 2.4867256637168142) internal successors, (281), 113 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have 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:17:25,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 281 transitions. [2022-03-15 19:17:25,679 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 281 transitions. Word has length 17 [2022-03-15 19:17:25,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:25,680 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 281 transitions. [2022-03-15 19:17:25,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:25,680 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 281 transitions. [2022-03-15 19:17:25,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:17:25,680 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:25,680 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:25,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 19:17:25,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:25,887 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:25,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:25,888 INFO L85 PathProgramCache]: Analyzing trace with hash 697476813, now seen corresponding path program 6 times [2022-03-15 19:17:25,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:25,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903566772] [2022-03-15 19:17:25,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:25,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:25,966 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:25,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903566772] [2022-03-15 19:17:25,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903566772] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:25,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777435943] [2022-03-15 19:17:25,966 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:17:25,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:25,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:25,972 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:17:25,973 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:17:26,027 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:17:26,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:26,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 19:17:26,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:26,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:26,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777435943] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:26,182 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:26,182 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-03-15 19:17:26,183 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [476384644] [2022-03-15 19:17:26,183 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:26,184 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:26,189 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 100 transitions. [2022-03-15 19:17:26,189 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:26,834 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [4118#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 0) (<= 3 ~N~0)), 4111#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 4115#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< 3 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (<= ~N~0 2)), 4123#(<= 2 thread1Thread1of1ForFork1_~i~0), 4109#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 4108#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 4117#(or (<= ~N~0 0) (<= 3 ~N~0)), 4120#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 0) (<= 3 ~N~0)), 4116#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 4110#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 4119#(or (<= ~N~0 0) (<= 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 4114#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 4121#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 0) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 4122#(<= 3 ~N~0), 4112#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 4124#(<= 1 thread1Thread1of1ForFork1_~i~0), 4113#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0))] [2022-03-15 19:17:26,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:17:26,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:26,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:17:26,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:17:26,835 INFO L87 Difference]: Start difference. First operand 114 states and 281 transitions. Second operand has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:17:27,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:27,830 INFO L93 Difference]: Finished difference Result 228 states and 542 transitions. [2022-03-15 19:17:27,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 19:17:27,831 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 19:17:27,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:27,832 INFO L225 Difference]: With dead ends: 228 [2022-03-15 19:17:27,832 INFO L226 Difference]: Without dead ends: 226 [2022-03-15 19:17:27,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=830, Invalid=2952, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:17:27,833 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 142 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:27,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 26 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:17:27,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-03-15 19:17:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 124. [2022-03-15 19:17:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 2.4878048780487805) internal successors, (306), 123 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have 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:17:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 306 transitions. [2022-03-15 19:17:27,838 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 306 transitions. Word has length 17 [2022-03-15 19:17:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:27,838 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 306 transitions. [2022-03-15 19:17:27,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:17:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 306 transitions. [2022-03-15 19:17:27,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:17:27,839 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:27,839 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:27,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 19:17:28,063 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,SelfDestructingSolverStorable9 [2022-03-15 19:17:28,063 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:28,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:28,064 INFO L85 PathProgramCache]: Analyzing trace with hash -195088765, now seen corresponding path program 7 times [2022-03-15 19:17:28,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:28,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652340896] [2022-03-15 19:17:28,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:28,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:28,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:28,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652340896] [2022-03-15 19:17:28,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652340896] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:28,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655449951] [2022-03-15 19:17:28,130 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:17:28,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:28,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:28,132 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:17:28,132 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:17:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:28,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:17:28,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:28,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:28,297 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:28,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655449951] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:28,297 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:28,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-03-15 19:17:28,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1155086498] [2022-03-15 19:17:28,298 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:28,299 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:28,305 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 112 transitions. [2022-03-15 19:17:28,305 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:29,341 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [4815#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 3 ~N~0)), 4802#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 4804#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< 3 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (<= ~N~0 2)), 4801#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 4796#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 4812#(or (<= ~N~0 1) (<= 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 4800#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 4811#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 1) (<= 3 ~N~0)), 4807#(and (or (<= 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 4813#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 1) (<= 3 ~N~0)), 4817#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 3 ~N~0)), 4797#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 4818#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 4803#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 4814#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 1) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 4809#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0))), 4810#(or (<= ~N~0 1) (<= 3 ~N~0)), 4816#(or (<= 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 4798#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 4806#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 3 ~N~0))), 4819#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< 3 ~N~0) (<= ~N~0 2)), 4808#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 3 ~N~0))), 4805#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 4795#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 4799#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0))] [2022-03-15 19:17:29,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:17:29,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:29,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:17:29,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1236, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:17:29,342 INFO L87 Difference]: Start difference. First operand 124 states and 306 transitions. Second operand has 34 states, 34 states have (on average 2.764705882352941) internal successors, (94), 34 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have 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:17:31,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:31,440 INFO L93 Difference]: Finished difference Result 282 states and 681 transitions. [2022-03-15 19:17:31,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 19:17:31,441 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.764705882352941) internal successors, (94), 34 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 19:17:31,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:31,442 INFO L225 Difference]: With dead ends: 282 [2022-03-15 19:17:31,442 INFO L226 Difference]: Without dead ends: 282 [2022-03-15 19:17:31,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2101 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1677, Invalid=6333, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 19:17:31,445 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 306 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:31,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 30 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:17:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-03-15 19:17:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 176. [2022-03-15 19:17:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 2.7142857142857144) internal successors, (475), 175 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have 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:17:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 475 transitions. [2022-03-15 19:17:31,450 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 475 transitions. Word has length 18 [2022-03-15 19:17:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:31,450 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 475 transitions. [2022-03-15 19:17:31,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.764705882352941) internal successors, (94), 34 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have 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:17:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 475 transitions. [2022-03-15 19:17:31,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:17:31,451 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:31,451 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:31,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-15 19:17:31,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:31,671 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:31,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:31,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2144592579, now seen corresponding path program 8 times [2022-03-15 19:17:31,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:31,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466349350] [2022-03-15 19:17:31,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:31,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:31,724 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:31,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:31,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466349350] [2022-03-15 19:17:31,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466349350] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:31,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411327030] [2022-03-15 19:17:31,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:17:31,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:31,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:31,725 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:17:31,726 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:17:31,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:17:31,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:31,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:17:31,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:31,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:31,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411327030] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:31,896 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:31,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-03-15 19:17:31,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [491464827] [2022-03-15 19:17:31,897 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:31,898 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:31,902 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 77 transitions. [2022-03-15 19:17:31,902 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:32,428 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [5734#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 1) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 5738#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1)), 5726#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 5725#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 5728#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 5735#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< 3 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (<= ~N~0 2)), 5730#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 5727#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 5724#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 5740#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 5737#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 5729#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 5731#(or (<= ~N~0 1) (<= 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 5736#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 5732#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 1) (<= 3 ~N~0)), 5733#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 5739#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))] [2022-03-15 19:17:32,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:17:32,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:32,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:17:32,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:17:32,429 INFO L87 Difference]: Start difference. First operand 176 states and 475 transitions. Second operand has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:33,634 INFO L93 Difference]: Finished difference Result 378 states and 935 transitions. [2022-03-15 19:17:33,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 19:17:33,634 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 19:17:33,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:33,636 INFO L225 Difference]: With dead ends: 378 [2022-03-15 19:17:33,636 INFO L226 Difference]: Without dead ends: 374 [2022-03-15 19:17:33,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1102, Invalid=3454, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 19:17:33,638 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 184 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:33,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 33 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:17:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-03-15 19:17:33,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 218. [2022-03-15 19:17:33,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.8940092165898617) internal successors, (628), 217 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have 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:17:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 628 transitions. [2022-03-15 19:17:33,646 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 628 transitions. Word has length 18 [2022-03-15 19:17:33,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:33,646 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 628 transitions. [2022-03-15 19:17:33,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 628 transitions. [2022-03-15 19:17:33,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:17:33,647 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:33,647 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:33,664 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:17:33,851 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,SelfDestructingSolverStorable11 [2022-03-15 19:17:33,851 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:33,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:33,852 INFO L85 PathProgramCache]: Analyzing trace with hash -531931539, now seen corresponding path program 9 times [2022-03-15 19:17:33,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:33,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830133162] [2022-03-15 19:17:33,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:33,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:33,903 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:33,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830133162] [2022-03-15 19:17:33,903 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830133162] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:33,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806293229] [2022-03-15 19:17:33,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:17:33,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:33,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:33,905 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:17:33,913 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:17:33,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:17:33,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:33,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:17:33,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:34,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:34,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806293229] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:34,084 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:34,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-03-15 19:17:34,085 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1757404886] [2022-03-15 19:17:34,085 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:34,086 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:34,090 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 81 transitions. [2022-03-15 19:17:34,090 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:34,621 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [6785#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 6782#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 6796#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1)), 6788#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 1) (<= 3 ~N~0)), 6781#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 6786#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 6784#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 6787#(or (<= ~N~0 1) (<= 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 6791#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 1) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 6795#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 6780#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 6793#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 6783#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 6789#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 6794#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 6790#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< 3 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (<= ~N~0 2)), 6792#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)))] [2022-03-15 19:17:34,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:17:34,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:34,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:17:34,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=816, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:17:34,623 INFO L87 Difference]: Start difference. First operand 218 states and 628 transitions. Second operand has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:35,905 INFO L93 Difference]: Finished difference Result 436 states and 1138 transitions. [2022-03-15 19:17:35,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 19:17:35,906 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 19:17:35,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:35,908 INFO L225 Difference]: With dead ends: 436 [2022-03-15 19:17:35,908 INFO L226 Difference]: Without dead ends: 418 [2022-03-15 19:17:35,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1023, Invalid=3533, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 19:17:35,910 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 164 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:35,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 23 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:17:35,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-03-15 19:17:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 258. [2022-03-15 19:17:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 2.9571984435797667) internal successors, (760), 257 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have 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:17:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 760 transitions. [2022-03-15 19:17:35,918 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 760 transitions. Word has length 18 [2022-03-15 19:17:35,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:35,919 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 760 transitions. [2022-03-15 19:17:35,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:35,919 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 760 transitions. [2022-03-15 19:17:35,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:17:35,920 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:35,920 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:35,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 19:17:36,135 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,SelfDestructingSolverStorable12 [2022-03-15 19:17:36,135 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:36,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:36,136 INFO L85 PathProgramCache]: Analyzing trace with hash 295191435, now seen corresponding path program 10 times [2022-03-15 19:17:36,138 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:36,138 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548907709] [2022-03-15 19:17:36,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:36,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:36,219 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:36,219 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:36,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548907709] [2022-03-15 19:17:36,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548907709] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:36,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377204478] [2022-03-15 19:17:36,219 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:17:36,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:36,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:36,224 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:17:36,243 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:17:36,275 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:17:36,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:36,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:17:36,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:36,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:36,410 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:17:36,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377204478] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:36,410 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:36,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 16 [2022-03-15 19:17:36,411 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1012519372] [2022-03-15 19:17:36,411 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:36,412 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:36,416 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 72 transitions. [2022-03-15 19:17:36,416 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:36,797 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [7977#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 7984#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 7975#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 7986#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 7982#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 1) (<= 3 ~N~0)), 7985#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< 3 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (<= ~N~0 2)), 7983#(<= 1 thread1Thread1of1ForFork1_~i~0), 7981#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 7978#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 7976#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 7980#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 7979#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 7987#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 1) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0))] [2022-03-15 19:17:36,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:17:36,798 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:36,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:17:36,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:17:36,799 INFO L87 Difference]: Start difference. First operand 258 states and 760 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:37,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:37,253 INFO L93 Difference]: Finished difference Result 394 states and 1009 transitions. [2022-03-15 19:17:37,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:17:37,253 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 19:17:37,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:37,255 INFO L225 Difference]: With dead ends: 394 [2022-03-15 19:17:37,255 INFO L226 Difference]: Without dead ends: 382 [2022-03-15 19:17:37,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=393, Invalid=1329, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:17:37,256 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 111 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:37,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 16 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:17:37,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-03-15 19:17:37,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 252. [2022-03-15 19:17:37,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 2.8884462151394423) internal successors, (725), 251 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have 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:17:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 725 transitions. [2022-03-15 19:17:37,264 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 725 transitions. Word has length 18 [2022-03-15 19:17:37,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:37,265 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 725 transitions. [2022-03-15 19:17:37,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:37,265 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 725 transitions. [2022-03-15 19:17:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:17:37,266 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:37,266 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:37,285 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:17:37,479 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,SelfDestructingSolverStorable13 [2022-03-15 19:17:37,479 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:37,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash -277877299, now seen corresponding path program 11 times [2022-03-15 19:17:37,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:37,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203464579] [2022-03-15 19:17:37,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:37,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:37,555 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:17:37,556 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:37,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203464579] [2022-03-15 19:17:37,556 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203464579] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:37,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074824073] [2022-03-15 19:17:37,556 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:17:37,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:37,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:37,560 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:17:37,575 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:17:37,624 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:17:37,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:37,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 19:17:37,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:37,672 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:17:37,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:37,715 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:17:37,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074824073] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:37,716 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:37,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-03-15 19:17:37,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [802555004] [2022-03-15 19:17:37,716 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:37,717 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:37,722 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 124 transitions. [2022-03-15 19:17:37,722 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:38,355 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [9040#(or (<= ~counter~0 1) (= ~counter~0 2)), 9042#(or (= ~counter~0 0) (<= (+ ~counter~0 1) 0)), 9041#(or (= ~counter~0 3) (<= ~counter~0 2)), 9039#(or (<= ~counter~0 0) (= ~counter~0 1))] [2022-03-15 19:17:38,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:17:38,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:38,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:17:38,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:17:38,356 INFO L87 Difference]: Start difference. First operand 252 states and 725 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:38,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:38,453 INFO L93 Difference]: Finished difference Result 435 states and 1211 transitions. [2022-03-15 19:17:38,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:17:38,453 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:17:38,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:38,455 INFO L225 Difference]: With dead ends: 435 [2022-03-15 19:17:38,455 INFO L226 Difference]: Without dead ends: 408 [2022-03-15 19:17:38,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 13 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:17:38,456 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 54 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:38,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 19 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:17:38,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-03-15 19:17:38,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 338. [2022-03-15 19:17:38,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 2.949554896142433) internal successors, (994), 337 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have 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:17:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 994 transitions. [2022-03-15 19:17:38,466 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 994 transitions. Word has length 19 [2022-03-15 19:17:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:38,466 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 994 transitions. [2022-03-15 19:17:38,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:38,467 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 994 transitions. [2022-03-15 19:17:38,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:17:38,469 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:38,470 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:38,489 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:17:38,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 19:17:38,683 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:38,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:38,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1451653140, now seen corresponding path program 12 times [2022-03-15 19:17:38,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:38,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712830970] [2022-03-15 19:17:38,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:38,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:38,759 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:38,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712830970] [2022-03-15 19:17:38,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712830970] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:38,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585344646] [2022-03-15 19:17:38,759 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:17:38,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:38,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:38,764 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:17:38,789 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:17:38,829 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:17:38,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:38,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:17:38,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:17:38,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:17:38,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585344646] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:38,933 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:38,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 16 [2022-03-15 19:17:38,933 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1962163493] [2022-03-15 19:17:38,933 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:38,934 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:38,938 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 85 transitions. [2022-03-15 19:17:38,938 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:39,288 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [10286#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 10283#(or (<= ~N~0 1) (<= 2 thread1Thread1of1ForFork1_~i~0)), 10285#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 10282#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 10289#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0) (<= (+ ~N~0 1) thread1Thread1of1ForFork1_~i~0)), 10280#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) thread1Thread1of1ForFork1_~i~0)), 10290#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 10278#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) thread1Thread1of1ForFork1_~i~0)), 10288#(< |thread2Thread1of1ForFork0_~i~1#1| ~N~0), 10281#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= |thread2Thread1of1ForFork0_~i~1#1| thread1Thread1of1ForFork1_~i~0)), 10291#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1)), 10284#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), 10292#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 10279#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) thread1Thread1of1ForFork1_~i~0)), 10287#(or (<= ~N~0 1) (<= 0 thread1Thread1of1ForFork1_~i~0))] [2022-03-15 19:17:39,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:17:39,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:39,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:17:39,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=709, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:17:39,290 INFO L87 Difference]: Start difference. First operand 338 states and 994 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:39,787 INFO L93 Difference]: Finished difference Result 446 states and 1241 transitions. [2022-03-15 19:17:39,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:17:39,788 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:17:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:39,790 INFO L225 Difference]: With dead ends: 446 [2022-03-15 19:17:39,790 INFO L226 Difference]: Without dead ends: 438 [2022-03-15 19:17:39,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:17:39,792 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 94 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:39,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 26 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:17:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-03-15 19:17:39,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 296. [2022-03-15 19:17:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 2.830508474576271) internal successors, (835), 295 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have 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:17:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 835 transitions. [2022-03-15 19:17:39,801 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 835 transitions. Word has length 19 [2022-03-15 19:17:39,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:39,801 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 835 transitions. [2022-03-15 19:17:39,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:39,801 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 835 transitions. [2022-03-15 19:17:39,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:17:39,802 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:39,802 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:39,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-03-15 19:17:40,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:40,040 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:40,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:40,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2129977564, now seen corresponding path program 13 times [2022-03-15 19:17:40,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:40,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496206782] [2022-03-15 19:17:40,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:40,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:40,131 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:40,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496206782] [2022-03-15 19:17:40,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496206782] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:40,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360542967] [2022-03-15 19:17:40,132 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:17:40,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:40,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:40,133 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:17:40,134 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:17:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:40,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:17:40,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:40,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:40,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360542967] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:40,416 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:40,416 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-03-15 19:17:40,416 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1082362134] [2022-03-15 19:17:40,416 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:40,417 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:40,423 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 124 transitions. [2022-03-15 19:17:40,423 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:41,240 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [11533#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 11527#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 11540#(<= 2 thread1Thread1of1ForFork1_~i~0), 11545#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 4 ~N~0) (<= ~N~0 1)), 11539#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 1)), 11537#(<= 3 thread1Thread1of1ForFork1_~i~0), 11529#(<= 4 ~N~0), 11528#(or (<= 4 ~N~0) (<= ~N~0 1)), 11526#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 11534#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 4 ~N~0) (<= ~N~0 1)), 11543#(<= 1 thread1Thread1of1ForFork1_~i~0), 11530#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 11542#(or (<= 4 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 1) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 11535#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 11546#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< 4 ~N~0) (<= ~N~0 3)), 11547#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 11544#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 11548#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 11538#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 11536#(or (<= 4 ~N~0) (<= ~N~0 1) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 11531#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 11541#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 11532#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0))] [2022-03-15 19:17:41,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:17:41,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:41,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:17:41,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=1796, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:17:41,242 INFO L87 Difference]: Start difference. First operand 296 states and 835 transitions. Second operand has 33 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 33 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:17:43,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:43,299 INFO L93 Difference]: Finished difference Result 490 states and 1286 transitions. [2022-03-15 19:17:43,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 19:17:43,300 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 33 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:17:43,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:43,303 INFO L225 Difference]: With dead ends: 490 [2022-03-15 19:17:43,303 INFO L226 Difference]: Without dead ends: 488 [2022-03-15 19:17:43,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2531 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1884, Invalid=7428, Unknown=0, NotChecked=0, Total=9312 [2022-03-15 19:17:43,306 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 168 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:43,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 46 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:17:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-03-15 19:17:43,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 272. [2022-03-15 19:17:43,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 2.830258302583026) internal successors, (767), 271 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have 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:17:43,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 767 transitions. [2022-03-15 19:17:43,315 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 767 transitions. Word has length 19 [2022-03-15 19:17:43,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:43,315 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 767 transitions. [2022-03-15 19:17:43,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 33 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:17:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 767 transitions. [2022-03-15 19:17:43,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:17:43,316 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:43,316 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:43,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-15 19:17:43,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 19:17:43,531 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:43,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:43,532 INFO L85 PathProgramCache]: Analyzing trace with hash -229724542, now seen corresponding path program 14 times [2022-03-15 19:17:43,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:43,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127709980] [2022-03-15 19:17:43,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:43,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:43,605 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:43,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127709980] [2022-03-15 19:17:43,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127709980] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:43,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371167895] [2022-03-15 19:17:43,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:17:43,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:43,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:43,606 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:17:43,607 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:17:43,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:17:43,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:43,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:17:43,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:43,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:43,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371167895] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:43,781 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:43,781 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-03-15 19:17:43,781 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1358900904] [2022-03-15 19:17:43,782 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:43,783 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:43,790 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 136 transitions. [2022-03-15 19:17:43,790 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:45,016 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [12865#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 12872#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 12894#(or (<= 4 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 12882#(and (or (<= 4 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0))), 12893#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 12864#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 12884#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< 4 ~N~0) (<= ~N~0 3)), 12889#(or (<= 4 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 2) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 12888#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 2)), 12876#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< 4 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 3)), 12867#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 12879#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 4 ~N~0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 12881#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0))), 12874#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 12890#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 4 ~N~0) (<= ~N~0 2)), 12880#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 4 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 12875#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 12871#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 12868#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 12866#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 12869#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 12878#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 12892#(or (<= 4 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 12870#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 12891#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 4 ~N~0)), 12895#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 4 ~N~0)), 12886#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 4 ~N~0) (<= ~N~0 2)), 12887#(or (<= 4 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 12877#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 12873#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 12885#(or (<= 4 ~N~0) (<= ~N~0 2)), 12883#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 4 ~N~0)))] [2022-03-15 19:17:45,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 19:17:45,016 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:45,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 19:17:45,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1998, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:17:45,018 INFO L87 Difference]: Start difference. First operand 272 states and 767 transitions. Second operand has 43 states, 43 states have (on average 2.6744186046511627) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have 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:17:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:48,682 INFO L93 Difference]: Finished difference Result 572 states and 1515 transitions. [2022-03-15 19:17:48,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-03-15 19:17:48,682 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.6744186046511627) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:17:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:48,685 INFO L225 Difference]: With dead ends: 572 [2022-03-15 19:17:48,685 INFO L226 Difference]: Without dead ends: 572 [2022-03-15 19:17:48,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4449 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3049, Invalid=12701, Unknown=0, NotChecked=0, Total=15750 [2022-03-15 19:17:48,689 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 367 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:48,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 52 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:17:48,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-03-15 19:17:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 370. [2022-03-15 19:17:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 2.940379403794038) internal successors, (1085), 369 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have 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:17:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1085 transitions. [2022-03-15 19:17:48,699 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1085 transitions. Word has length 20 [2022-03-15 19:17:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:48,700 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 1085 transitions. [2022-03-15 19:17:48,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.6744186046511627) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have 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:17:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1085 transitions. [2022-03-15 19:17:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:17:48,701 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:48,701 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:48,727 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:17:48,914 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,SelfDestructingSolverStorable17 [2022-03-15 19:17:48,914 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:48,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:48,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1962477208, now seen corresponding path program 15 times [2022-03-15 19:17:48,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:48,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536794677] [2022-03-15 19:17:48,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:48,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:48,990 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:48,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536794677] [2022-03-15 19:17:48,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536794677] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:48,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577970146] [2022-03-15 19:17:48,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:17:48,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:48,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:48,992 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:17:49,012 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:17:49,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:17:49,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:49,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:17:49,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:49,159 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:49,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:49,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577970146] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:49,208 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:49,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2022-03-15 19:17:49,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1858515383] [2022-03-15 19:17:49,209 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:49,210 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:49,216 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 92 transitions. [2022-03-15 19:17:49,216 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:49,931 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [14591#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 14574#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 14587#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 4 ~N~0) (<= ~N~0 2)), 14582#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 14592#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 2)), 14577#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 14581#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 14578#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 14590#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 14589#(or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 14579#(or (<= 4 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 14580#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 2)), 14585#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 14571#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 14575#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 14588#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< 4 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 3)), 14576#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 14573#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 14583#(and (or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 14572#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 14586#(or (<= 4 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 2) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 14584#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0)))] [2022-03-15 19:17:49,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:17:49,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:49,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:17:49,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1268, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:17:49,932 INFO L87 Difference]: Start difference. First operand 370 states and 1085 transitions. Second operand has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:51,875 INFO L93 Difference]: Finished difference Result 876 states and 2354 transitions. [2022-03-15 19:17:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 19:17:51,876 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:17:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:51,880 INFO L225 Difference]: With dead ends: 876 [2022-03-15 19:17:51,880 INFO L226 Difference]: Without dead ends: 872 [2022-03-15 19:17:51,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2788 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2445, Invalid=7655, Unknown=0, NotChecked=0, Total=10100 [2022-03-15 19:17:51,882 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 342 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:51,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 35 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:17:51,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2022-03-15 19:17:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 558. [2022-03-15 19:17:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 3.118491921005386) internal successors, (1737), 557 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have 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:17:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1737 transitions. [2022-03-15 19:17:51,907 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1737 transitions. Word has length 20 [2022-03-15 19:17:51,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:51,907 INFO L470 AbstractCegarLoop]: Abstraction has 558 states and 1737 transitions. [2022-03-15 19:17:51,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1737 transitions. [2022-03-15 19:17:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:17:51,909 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:51,909 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:51,928 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:17:52,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:52,119 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:52,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:52,120 INFO L85 PathProgramCache]: Analyzing trace with hash -714046910, now seen corresponding path program 16 times [2022-03-15 19:17:52,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:52,121 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799338648] [2022-03-15 19:17:52,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:52,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:52,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:52,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799338648] [2022-03-15 19:17:52,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799338648] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:52,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788374071] [2022-03-15 19:17:52,190 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:17:52,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:52,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:52,191 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:17:52,193 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:17:52,240 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:17:52,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:52,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:17:52,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:52,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:52,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788374071] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:52,366 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:52,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2022-03-15 19:17:52,366 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1498931677] [2022-03-15 19:17:52,366 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:52,368 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:52,373 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 96 transitions. [2022-03-15 19:17:52,373 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:53,073 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [16903#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 16902#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 16919#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 2)), 16904#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 16920#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 4 ~N~0) (<= ~N~0 2)), 16918#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 16911#(or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 16917#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< 4 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 3)), 16908#(and (or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 16909#(or (<= 4 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 16921#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 16910#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 2)), 16915#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 16901#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 16905#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 16916#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 16913#(or (<= 4 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 2) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 16907#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 16900#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 16906#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 16914#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 16912#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0))] [2022-03-15 19:17:53,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:17:53,074 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:53,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:17:53,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1291, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:17:53,075 INFO L87 Difference]: Start difference. First operand 558 states and 1737 transitions. Second operand has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 33 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:54,971 INFO L93 Difference]: Finished difference Result 1032 states and 2922 transitions. [2022-03-15 19:17:54,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 19:17:54,972 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 33 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:17:54,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:54,975 INFO L225 Difference]: With dead ends: 1032 [2022-03-15 19:17:54,975 INFO L226 Difference]: Without dead ends: 1014 [2022-03-15 19:17:54,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2634 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2124, Invalid=7382, Unknown=0, NotChecked=0, Total=9506 [2022-03-15 19:17:54,976 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 232 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:54,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 27 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:17:54,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2022-03-15 19:17:54,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 652. [2022-03-15 19:17:54,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 651 states have (on average 3.1490015360983103) internal successors, (2050), 651 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have 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:17:54,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 2050 transitions. [2022-03-15 19:17:54,993 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 2050 transitions. Word has length 20 [2022-03-15 19:17:54,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:54,993 INFO L470 AbstractCegarLoop]: Abstraction has 652 states and 2050 transitions. [2022-03-15 19:17:54,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 33 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:54,993 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 2050 transitions. [2022-03-15 19:17:54,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:17:54,995 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:54,995 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:55,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 19:17:55,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:55,212 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:55,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:55,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2081915944, now seen corresponding path program 17 times [2022-03-15 19:17:55,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:55,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023775860] [2022-03-15 19:17:55,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:55,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:55,290 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:55,290 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023775860] [2022-03-15 19:17:55,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023775860] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:55,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843502687] [2022-03-15 19:17:55,291 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:17:55,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:55,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:55,292 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:17:55,295 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:17:55,345 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:17:55,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:55,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:17:55,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:55,434 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:55,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:55,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843502687] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:55,473 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:55,473 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2022-03-15 19:17:55,473 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1734339054] [2022-03-15 19:17:55,474 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:55,475 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:55,479 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 105 transitions. [2022-03-15 19:17:55,479 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:56,267 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [19587#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 19573#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 19581#(or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 19578#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 4 ~N~0) (<= ~N~0 2)), 19566#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 19572#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 19569#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 19571#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 19583#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 19586#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 2)), 19575#(or (<= 4 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 19564#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 19580#(and (or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 19570#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 19579#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< 4 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 3)), 19582#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 19576#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 2)), 19568#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 19584#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 19565#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 19577#(or (<= 4 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 2) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 19574#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 19585#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 19567#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0))] [2022-03-15 19:17:56,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 19:17:56,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:56,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 19:17:56,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1451, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:17:56,268 INFO L87 Difference]: Start difference. First operand 652 states and 2050 transitions. Second operand has 35 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:58,706 INFO L93 Difference]: Finished difference Result 1064 states and 3024 transitions. [2022-03-15 19:17:58,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-15 19:17:58,706 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:17:58,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:58,710 INFO L225 Difference]: With dead ends: 1064 [2022-03-15 19:17:58,710 INFO L226 Difference]: Without dead ends: 1022 [2022-03-15 19:17:58,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3336 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2387, Invalid=9385, Unknown=0, NotChecked=0, Total=11772 [2022-03-15 19:17:58,711 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 206 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1707 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:58,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 34 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1707 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:17:58,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2022-03-15 19:17:58,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 696. [2022-03-15 19:17:58,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 3.139568345323741) internal successors, (2182), 695 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states have 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:17:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 2182 transitions. [2022-03-15 19:17:58,730 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 2182 transitions. Word has length 20 [2022-03-15 19:17:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:58,731 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 2182 transitions. [2022-03-15 19:17:58,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 2182 transitions. [2022-03-15 19:17:58,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:17:58,734 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:58,734 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:58,759 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:17:58,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:58,947 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:58,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:58,948 INFO L85 PathProgramCache]: Analyzing trace with hash 492909452, now seen corresponding path program 18 times [2022-03-15 19:17:58,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:58,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200783209] [2022-03-15 19:17:58,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:58,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:59,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:59,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200783209] [2022-03-15 19:17:59,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200783209] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:59,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511764828] [2022-03-15 19:17:59,017 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:17:59,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:59,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:59,018 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:17:59,019 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:17:59,075 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:17:59,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:59,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:17:59,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:59,169 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:59,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:59,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511764828] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:59,208 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:59,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 18 [2022-03-15 19:17:59,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1462196801] [2022-03-15 19:17:59,208 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:59,209 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:59,213 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 87 transitions. [2022-03-15 19:17:59,213 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:59,793 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [22386#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 22392#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 22394#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 4 ~N~0) (<= ~N~0 2)), 22393#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1)), 22380#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 22381#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 22387#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 2)), 22379#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 22382#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 22395#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 22390#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 22377#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 22383#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 22384#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 22388#(or (<= 4 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 2) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 22378#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 22385#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 22391#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< 4 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 3)), 22389#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))] [2022-03-15 19:17:59,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:17:59,793 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:59,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:17:59,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1093, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:17:59,794 INFO L87 Difference]: Start difference. First operand 696 states and 2182 transitions. Second operand has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:00,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:00,817 INFO L93 Difference]: Finished difference Result 1068 states and 3088 transitions. [2022-03-15 19:18:00,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 19:18:00,817 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:18:00,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:00,821 INFO L225 Difference]: With dead ends: 1068 [2022-03-15 19:18:00,821 INFO L226 Difference]: Without dead ends: 1050 [2022-03-15 19:18:00,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=965, Invalid=3457, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 19:18:00,822 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 210 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:00,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 22 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:18:00,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2022-03-15 19:18:00,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 760. [2022-03-15 19:18:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 759 states have (on average 3.130434782608696) internal successors, (2376), 759 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have 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:18:00,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 2376 transitions. [2022-03-15 19:18:00,841 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 2376 transitions. Word has length 20 [2022-03-15 19:18:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:00,841 INFO L470 AbstractCegarLoop]: Abstraction has 760 states and 2376 transitions. [2022-03-15 19:18:00,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 2376 transitions. [2022-03-15 19:18:00,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:18:00,843 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:00,843 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:00,866 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:18:01,066 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,SelfDestructingSolverStorable21 [2022-03-15 19:18:01,066 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:18:01,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:01,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2115798114, now seen corresponding path program 19 times [2022-03-15 19:18:01,067 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:01,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443421198] [2022-03-15 19:18:01,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:01,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:01,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:01,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443421198] [2022-03-15 19:18:01,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443421198] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:01,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864182892] [2022-03-15 19:18:01,140 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:18:01,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:01,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:01,141 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:18:01,143 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:18:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:01,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:18:01,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:01,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:18:01,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864182892] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:01,356 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:01,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 20 [2022-03-15 19:18:01,357 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1917516756] [2022-03-15 19:18:01,357 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:01,358 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:01,363 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 87 transitions. [2022-03-15 19:18:01,363 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:01,897 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [25208#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 25210#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 25214#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 25224#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 25216#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 25209#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 25212#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 25217#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 25220#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 4 ~N~0) (<= ~N~0 2)), 25218#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 25222#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< 4 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 3)), 25215#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 25211#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 25219#(or (<= 4 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 2) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 25221#(<= 1 thread1Thread1of1ForFork1_~i~0), 25213#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 25223#(= |thread2Thread1of1ForFork0_~i~1#1| 0)] [2022-03-15 19:18:01,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 19:18:01,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:01,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 19:18:01,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1105, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:18:01,899 INFO L87 Difference]: Start difference. First operand 760 states and 2376 transitions. Second operand has 28 states, 28 states have (on average 2.607142857142857) internal successors, (73), 28 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:02,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:02,611 INFO L93 Difference]: Finished difference Result 1344 states and 3823 transitions. [2022-03-15 19:18:02,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:18:02,611 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.607142857142857) internal successors, (73), 28 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:18:02,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:02,615 INFO L225 Difference]: With dead ends: 1344 [2022-03-15 19:18:02,615 INFO L226 Difference]: Without dead ends: 1308 [2022-03-15 19:18:02,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=642, Invalid=2438, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 19:18:02,616 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 181 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:02,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 22 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:18:02,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2022-03-15 19:18:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 790. [2022-03-15 19:18:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 3.091254752851711) internal successors, (2439), 789 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have 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:18:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 2439 transitions. [2022-03-15 19:18:02,635 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 2439 transitions. Word has length 20 [2022-03-15 19:18:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:02,635 INFO L470 AbstractCegarLoop]: Abstraction has 790 states and 2439 transitions. [2022-03-15 19:18:02,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.607142857142857) internal successors, (73), 28 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 2439 transitions. [2022-03-15 19:18:02,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:18:02,637 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:02,637 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:02,662 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:18:02,850 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,SelfDestructingSolverStorable22 [2022-03-15 19:18:02,850 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:18:02,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:02,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1351586386, now seen corresponding path program 20 times [2022-03-15 19:18:02,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:02,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047248564] [2022-03-15 19:18:02,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:02,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:02,924 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:02,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047248564] [2022-03-15 19:18:02,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047248564] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:02,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400630658] [2022-03-15 19:18:02,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:18:02,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:02,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:02,926 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:18:02,951 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:18:03,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:18:03,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:18:03,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:18:03,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:03,063 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:03,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:03,112 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:03,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400630658] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:03,112 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:03,112 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-03-15 19:18:03,112 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [493418494] [2022-03-15 19:18:03,112 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:03,124 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:03,131 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 148 transitions. [2022-03-15 19:18:03,131 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:03,819 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [28333#(or (<= ~counter~0 0) (= ~counter~0 1)), 28334#(or (<= ~counter~0 1) (= ~counter~0 2)), 28337#(or (= ~counter~0 0) (<= (+ ~counter~0 1) 0)), 28335#(or (= ~counter~0 3) (<= ~counter~0 2)), 28336#(or (= ~counter~0 4) (<= ~counter~0 3))] [2022-03-15 19:18:03,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:18:03,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:03,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:18:03,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:18:03,820 INFO L87 Difference]: Start difference. First operand 790 states and 2439 transitions. Second operand has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:18:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:03,928 INFO L93 Difference]: Finished difference Result 1191 states and 3667 transitions. [2022-03-15 19:18:03,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:18:03,928 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:18:03,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:03,932 INFO L225 Difference]: With dead ends: 1191 [2022-03-15 19:18:03,932 INFO L226 Difference]: Without dead ends: 1160 [2022-03-15 19:18:03,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 81 SyntacticMatches, 16 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:18:03,933 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 63 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:03,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 27 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:18:03,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2022-03-15 19:18:03,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1058. [2022-03-15 19:18:03,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 1057 states have (on average 3.1712393566698203) internal successors, (3352), 1057 states have internal predecessors, (3352), 0 states have call successors, (0), 0 states have 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:18:03,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 3352 transitions. [2022-03-15 19:18:03,955 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 3352 transitions. Word has length 21 [2022-03-15 19:18:03,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:03,955 INFO L470 AbstractCegarLoop]: Abstraction has 1058 states and 3352 transitions. [2022-03-15 19:18:03,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:18:03,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 3352 transitions. [2022-03-15 19:18:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:18:03,958 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:03,958 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:03,985 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:18:04,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:04,181 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:18:04,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:04,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1492704951, now seen corresponding path program 21 times [2022-03-15 19:18:04,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:04,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798148650] [2022-03-15 19:18:04,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:04,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:04,248 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:04,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798148650] [2022-03-15 19:18:04,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798148650] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:04,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020398916] [2022-03-15 19:18:04,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:18:04,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:04,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:04,250 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:18:04,250 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:18:04,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:18:04,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:18:04,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 19:18:04,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:04,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:04,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020398916] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:04,455 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:04,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2022-03-15 19:18:04,456 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1748718691] [2022-03-15 19:18:04,456 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:04,457 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:04,462 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 100 transitions. [2022-03-15 19:18:04,462 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:05,048 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [31805#(< |thread2Thread1of1ForFork0_~i~1#1| ~N~0), 31789#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 31799#(or (<= |thread2Thread1of1ForFork0_~i~1#1| thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 31804#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 2)), 31787#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) thread1Thread1of1ForFork1_~i~0)), 31794#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 31792#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) thread1Thread1of1ForFork1_~i~0)), 31797#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 31800#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 31796#(or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 31803#(or (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 31793#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 31790#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 31802#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 31801#(or (<= 0 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 31806#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0) (<= (+ ~N~0 1) thread1Thread1of1ForFork1_~i~0)), 31788#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) thread1Thread1of1ForFork1_~i~0)), 31798#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 31791#(and (or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 31795#(or (<= ~N~0 2) (<= 2 thread1Thread1of1ForFork1_~i~0))] [2022-03-15 19:18:05,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 19:18:05,048 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:05,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 19:18:05,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1325, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:18:05,049 INFO L87 Difference]: Start difference. First operand 1058 states and 3352 transitions. Second operand has 32 states, 32 states have (on average 2.53125) internal successors, (81), 32 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:18:06,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:06,124 INFO L93 Difference]: Finished difference Result 1436 states and 4346 transitions. [2022-03-15 19:18:06,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 19:18:06,124 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.53125) internal successors, (81), 32 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:18:06,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:06,129 INFO L225 Difference]: With dead ends: 1436 [2022-03-15 19:18:06,129 INFO L226 Difference]: Without dead ends: 1426 [2022-03-15 19:18:06,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2180 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2110, Invalid=5722, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 19:18:06,130 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 188 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:06,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 32 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:18:06,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2022-03-15 19:18:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 840. [2022-03-15 19:18:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 839 states have (on average 3.0905840286054826) internal successors, (2593), 839 states have internal predecessors, (2593), 0 states have call successors, (0), 0 states have 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:18:06,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 2593 transitions. [2022-03-15 19:18:06,155 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 2593 transitions. Word has length 21 [2022-03-15 19:18:06,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:06,155 INFO L470 AbstractCegarLoop]: Abstraction has 840 states and 2593 transitions. [2022-03-15 19:18:06,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.53125) internal successors, (81), 32 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:18:06,155 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 2593 transitions. [2022-03-15 19:18:06,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:18:06,158 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:06,158 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:06,182 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:18:06,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:06,371 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:18:06,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:06,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2134580589, now seen corresponding path program 22 times [2022-03-15 19:18:06,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:06,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688151148] [2022-03-15 19:18:06,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:06,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:06,464 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:06,464 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688151148] [2022-03-15 19:18:06,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688151148] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:06,464 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131738468] [2022-03-15 19:18:06,464 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:18:06,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:06,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:06,465 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:18:06,497 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:18:06,536 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:18:06,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:18:06,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 19:18:06,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:06,696 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:06,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:06,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131738468] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:06,785 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:06,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 29 [2022-03-15 19:18:06,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1811931783] [2022-03-15 19:18:06,785 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:06,787 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:06,795 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 148 transitions. [2022-03-15 19:18:06,795 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:07,900 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [35227#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 35230#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 2)), 35229#(or (<= 5 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 2) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 35237#(<= 2 thread1Thread1of1ForFork1_~i~0), 35215#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 35223#(or (<= 5 ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 2)), 35234#(<= 4 thread1Thread1of1ForFork1_~i~0), 35238#(<= 1 thread1Thread1of1ForFork1_~i~0), 35236#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< 5 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 35241#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 35231#(or (<= 5 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 2) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 35220#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 35225#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 35219#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 35232#(or (<= 5 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 2)), 35214#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 35239#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 35217#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 35222#(<= 5 ~N~0), 35235#(<= 3 thread1Thread1of1ForFork1_~i~0), 35224#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 35213#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 35240#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 35221#(or (<= 5 ~N~0) (<= ~N~0 2)), 35228#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 35233#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 2)), 35216#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 35218#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 35226#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0))] [2022-03-15 19:18:07,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:18:07,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:07,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:18:07,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=2780, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 19:18:07,902 INFO L87 Difference]: Start difference. First operand 840 states and 2593 transitions. Second operand has 41 states, 41 states have (on average 2.8536585365853657) internal successors, (117), 41 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:11,458 INFO L93 Difference]: Finished difference Result 1294 states and 3736 transitions. [2022-03-15 19:18:11,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-15 19:18:11,459 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.8536585365853657) internal successors, (117), 41 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:18:11,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:11,463 INFO L225 Difference]: With dead ends: 1294 [2022-03-15 19:18:11,463 INFO L226 Difference]: Without dead ends: 1292 [2022-03-15 19:18:11,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5578 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3583, Invalid=15599, Unknown=0, NotChecked=0, Total=19182 [2022-03-15 19:18:11,464 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 289 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:11,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 41 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:18:11,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2022-03-15 19:18:11,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 810. [2022-03-15 19:18:11,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 809 states have (on average 3.1050679851668725) internal successors, (2512), 809 states have internal predecessors, (2512), 0 states have call successors, (0), 0 states have 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:18:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 2512 transitions. [2022-03-15 19:18:11,482 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 2512 transitions. Word has length 21 [2022-03-15 19:18:11,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:11,483 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 2512 transitions. [2022-03-15 19:18:11,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.8536585365853657) internal successors, (117), 41 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:11,483 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 2512 transitions. [2022-03-15 19:18:11,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:18:11,485 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:11,485 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:11,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 19:18:11,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 19:18:11,699 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:18:11,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:11,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1973540131, now seen corresponding path program 23 times [2022-03-15 19:18:11,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:11,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580301445] [2022-03-15 19:18:11,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:11,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:11,782 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:11,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580301445] [2022-03-15 19:18:11,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580301445] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:11,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139627947] [2022-03-15 19:18:11,782 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:18:11,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:11,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:11,787 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:18:11,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 19:18:11,846 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:18:11,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:18:11,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:18:11,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:11,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:11,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139627947] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:11,982 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:11,982 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-03-15 19:18:11,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1153117681] [2022-03-15 19:18:11,982 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:11,984 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:11,991 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 160 transitions. [2022-03-15 19:18:11,991 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:13,625 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 39 new interpolants: [38561#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 38555#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 38556#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 38570#(and (or (<= 5 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0))), 38567#(or (<= 5 ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 38546#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 38547#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 38552#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 38571#(and (or (<= 5 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 38576#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 38581#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 38554#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 38557#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 38579#(or (<= 5 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 38545#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 38582#(or (<= 5 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 38563#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 38569#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0))), 38564#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 5 ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0))), 38575#(or (<= 5 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 38551#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 38568#(and (or (<= 5 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 38553#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 38549#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 38550#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 38548#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 38562#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 38578#(or (<= 5 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 38565#(or (<= 5 ~N~0) (<= ~N~0 3)), 38583#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 38560#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< 5 ~N~0) (<= ~N~0 4)), 38559#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 38566#(or (<= 5 ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 3)), 38574#(or (<= 5 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 3) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 38580#(or (<= 5 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 3)), 38572#(and (or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0))), 38558#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 38573#(or (< 5 ~N~0) (<= ~N~0 4) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 38577#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0))] [2022-03-15 19:18:13,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 19:18:13,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:13,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 19:18:13,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=2942, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:18:13,626 INFO L87 Difference]: Start difference. First operand 810 states and 2512 transitions. Second operand has 52 states, 52 states have (on average 2.6153846153846154) internal successors, (136), 52 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have 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:18:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:19,467 INFO L93 Difference]: Finished difference Result 1422 states and 4145 transitions. [2022-03-15 19:18:19,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-03-15 19:18:19,467 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.6153846153846154) internal successors, (136), 52 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:18:19,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:19,473 INFO L225 Difference]: With dead ends: 1422 [2022-03-15 19:18:19,473 INFO L226 Difference]: Without dead ends: 1422 [2022-03-15 19:18:19,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8157 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4949, Invalid=22441, Unknown=0, NotChecked=0, Total=27390 [2022-03-15 19:18:19,475 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 557 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 2454 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 2792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 2454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:19,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [557 Valid, 66 Invalid, 2792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 2454 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:18:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2022-03-15 19:18:19,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 966. [2022-03-15 19:18:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 3.1367875647668395) internal successors, (3027), 965 states have internal predecessors, (3027), 0 states have call successors, (0), 0 states have 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:18:19,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 3027 transitions. [2022-03-15 19:18:19,497 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 3027 transitions. Word has length 22 [2022-03-15 19:18:19,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:19,497 INFO L470 AbstractCegarLoop]: Abstraction has 966 states and 3027 transitions. [2022-03-15 19:18:19,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.6153846153846154) internal successors, (136), 52 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have 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:18:19,497 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 3027 transitions. [2022-03-15 19:18:19,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:18:19,499 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:19,500 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:19,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 19:18:19,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 19:18:19,723 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:18:19,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:19,724 INFO L85 PathProgramCache]: Analyzing trace with hash -406125533, now seen corresponding path program 24 times [2022-03-15 19:18:19,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:19,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18599807] [2022-03-15 19:18:19,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:19,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:19,808 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:19,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18599807] [2022-03-15 19:18:19,808 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18599807] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:19,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477694297] [2022-03-15 19:18:19,808 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:18:19,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:19,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:19,810 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:18:19,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 19:18:19,894 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:18:19,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:18:19,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:18:19,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:20,003 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:20,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:20,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477694297] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:20,047 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:20,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2022-03-15 19:18:20,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1418965849] [2022-03-15 19:18:20,047 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:20,050 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:20,055 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 107 transitions. [2022-03-15 19:18:20,056 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:20,877 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [42408#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 42409#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 42427#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 42431#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 42413#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 42428#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 42407#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 42422#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 42421#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 42425#(or (<= 5 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 3)), 42429#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< 5 ~N~0) (<= ~N~0 4)), 42416#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 42417#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0))), 42410#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 42414#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 42432#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 42420#(or (<= 5 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 42418#(or (<= 5 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 3) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 42430#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 3)), 42412#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 42415#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 42406#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 42424#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 42411#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 42426#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 42419#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 42423#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0))] [2022-03-15 19:18:20,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 19:18:20,878 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:20,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 19:18:20,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=1841, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:18:20,878 INFO L87 Difference]: Start difference. First operand 966 states and 3027 transitions. Second operand has 40 states, 40 states have (on average 2.425) internal successors, (97), 40 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:18:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:24,080 INFO L93 Difference]: Finished difference Result 2022 states and 5793 transitions. [2022-03-15 19:18:24,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-03-15 19:18:24,080 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.425) internal successors, (97), 40 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:18:24,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:24,089 INFO L225 Difference]: With dead ends: 2022 [2022-03-15 19:18:24,089 INFO L226 Difference]: Without dead ends: 2018 [2022-03-15 19:18:24,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5508 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4460, Invalid=14446, Unknown=0, NotChecked=0, Total=18906 [2022-03-15 19:18:24,091 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 406 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:24,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 35 Invalid, 1875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:18:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2022-03-15 19:18:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1400. [2022-03-15 19:18:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1399 states have (on average 3.246604717655468) internal successors, (4542), 1399 states have internal predecessors, (4542), 0 states have call successors, (0), 0 states have 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:18:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 4542 transitions. [2022-03-15 19:18:24,120 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 4542 transitions. Word has length 22 [2022-03-15 19:18:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:24,120 INFO L470 AbstractCegarLoop]: Abstraction has 1400 states and 4542 transitions. [2022-03-15 19:18:24,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.425) internal successors, (97), 40 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:18:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 4542 transitions. [2022-03-15 19:18:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:18:24,123 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:24,123 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:24,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 19:18:24,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 19:18:24,327 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:18:24,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:24,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1212317645, now seen corresponding path program 25 times [2022-03-15 19:18:24,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:24,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230310525] [2022-03-15 19:18:24,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:24,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:24,414 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:24,415 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230310525] [2022-03-15 19:18:24,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230310525] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:24,415 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456444520] [2022-03-15 19:18:24,415 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:18:24,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:24,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:24,416 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:18:24,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 19:18:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:24,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:18:24,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:24,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:24,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456444520] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:24,621 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:24,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2022-03-15 19:18:24,622 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [638216202] [2022-03-15 19:18:24,622 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:24,623 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:24,629 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 111 transitions. [2022-03-15 19:18:24,629 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:25,572 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [47692#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 47685#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 47684#(or (<= 5 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 3) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 47673#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 47698#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 47677#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 47690#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 47694#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 47682#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 47687#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0))), 47688#(or (<= 5 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 47697#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 47693#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< 5 ~N~0) (<= ~N~0 4)), 47676#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 47675#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 47678#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 47691#(or (<= 5 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 3)), 47679#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 47686#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 47672#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 47680#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 47689#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 47696#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 47683#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 47695#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 3)), 47674#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 47681#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0))] [2022-03-15 19:18:25,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 19:18:25,573 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:25,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 19:18:25,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=1872, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:18:25,574 INFO L87 Difference]: Start difference. First operand 1400 states and 4542 transitions. Second operand has 40 states, 40 states have (on average 2.45) internal successors, (98), 40 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:29,061 INFO L93 Difference]: Finished difference Result 2384 states and 7050 transitions. [2022-03-15 19:18:29,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-03-15 19:18:29,062 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.45) internal successors, (98), 40 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:18:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:29,068 INFO L225 Difference]: With dead ends: 2384 [2022-03-15 19:18:29,068 INFO L226 Difference]: Without dead ends: 2366 [2022-03-15 19:18:29,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6035 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4375, Invalid=15647, Unknown=0, NotChecked=0, Total=20022 [2022-03-15 19:18:29,070 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 360 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 2084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:29,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 40 Invalid, 2084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:18:29,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2022-03-15 19:18:29,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 1546. [2022-03-15 19:18:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1545 states have (on average 3.2601941747572813) internal successors, (5037), 1545 states have internal predecessors, (5037), 0 states have call successors, (0), 0 states have 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:18:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 5037 transitions. [2022-03-15 19:18:29,102 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 5037 transitions. Word has length 22 [2022-03-15 19:18:29,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:29,102 INFO L470 AbstractCegarLoop]: Abstraction has 1546 states and 5037 transitions. [2022-03-15 19:18:29,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.45) internal successors, (98), 40 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:29,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 5037 transitions. [2022-03-15 19:18:29,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:18:29,105 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:29,105 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:29,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 19:18:29,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 19:18:29,321 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:18:29,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:29,321 INFO L85 PathProgramCache]: Analyzing trace with hash -155551389, now seen corresponding path program 26 times [2022-03-15 19:18:29,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:29,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500228176] [2022-03-15 19:18:29,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:29,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:29,402 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:29,402 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500228176] [2022-03-15 19:18:29,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500228176] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:29,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12770094] [2022-03-15 19:18:29,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:18:29,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:29,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:29,408 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:18:29,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 19:18:29,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:18:29,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:18:29,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:18:29,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:29,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:29,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12770094] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:29,628 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:29,628 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2022-03-15 19:18:29,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1163843866] [2022-03-15 19:18:29,629 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:29,630 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:29,636 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 120 transitions. [2022-03-15 19:18:29,636 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:30,603 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [53614#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 53626#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 53606#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 53609#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 53608#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 53621#(or (<= 5 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 3) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 53625#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 53632#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 53627#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 53623#(or (<= 5 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 53617#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0))), 53630#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< 5 ~N~0) (<= ~N~0 4)), 53613#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 53629#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 53624#(or (<= 5 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 3)), 53605#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 53616#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 53622#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 53620#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 53611#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 53628#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 53607#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 53610#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 53615#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 53618#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 53619#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 53604#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 53612#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 53631#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 3))] [2022-03-15 19:18:30,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 19:18:30,604 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:30,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 19:18:30,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=2071, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 19:18:30,604 INFO L87 Difference]: Start difference. First operand 1546 states and 5037 transitions. Second operand has 42 states, 42 states have (on average 2.5) internal successors, (105), 42 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have 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:18:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:34,225 INFO L93 Difference]: Finished difference Result 2386 states and 7099 transitions. [2022-03-15 19:18:34,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-03-15 19:18:34,225 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.5) internal successors, (105), 42 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:18:34,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:34,231 INFO L225 Difference]: With dead ends: 2386 [2022-03-15 19:18:34,231 INFO L226 Difference]: Without dead ends: 2340 [2022-03-15 19:18:34,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5998 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4132, Invalid=16174, Unknown=0, NotChecked=0, Total=20306 [2022-03-15 19:18:34,233 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 316 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 2064 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 2064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:34,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 47 Invalid, 2242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 2064 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:18:34,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2022-03-15 19:18:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 1708. [2022-03-15 19:18:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1707 states have (on average 3.2501464557703574) internal successors, (5548), 1707 states have internal predecessors, (5548), 0 states have call successors, (0), 0 states have 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:18:34,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 5548 transitions. [2022-03-15 19:18:34,264 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 5548 transitions. Word has length 22 [2022-03-15 19:18:34,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:34,264 INFO L470 AbstractCegarLoop]: Abstraction has 1708 states and 5548 transitions. [2022-03-15 19:18:34,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.5) internal successors, (105), 42 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have 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:18:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 5548 transitions. [2022-03-15 19:18:34,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:18:34,267 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:34,267 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:34,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 19:18:34,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:34,468 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:18:34,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:34,468 INFO L85 PathProgramCache]: Analyzing trace with hash 390181517, now seen corresponding path program 27 times [2022-03-15 19:18:34,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:34,469 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879371937] [2022-03-15 19:18:34,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:34,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:34,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:34,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879371937] [2022-03-15 19:18:34,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879371937] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:34,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369682827] [2022-03-15 19:18:34,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:18:34,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:34,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:34,553 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:18:34,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 19:18:34,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:18:34,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:18:34,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:18:34,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:34,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:34,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369682827] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:34,785 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:34,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2022-03-15 19:18:34,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [191253568] [2022-03-15 19:18:34,785 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:34,787 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:34,795 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 129 transitions. [2022-03-15 19:18:34,795 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:35,888 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [59870#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 59866#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 59886#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 59873#(or (<= 5 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 3) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 59890#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 59868#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 59871#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 59878#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 59879#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 59869#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 59885#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 59880#(or (<= 5 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 3)), 59883#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 59874#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 59887#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 59861#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 59864#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 59865#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 59881#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 59882#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 59872#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 59877#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0))), 59875#(or (<= 5 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 59867#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 59889#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 3)), 59884#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 59888#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< 5 ~N~0) (<= ~N~0 4)), 59862#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 59891#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 59863#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 59876#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)))] [2022-03-15 19:18:35,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 19:18:35,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:35,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 19:18:35,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=2264, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:18:35,889 INFO L87 Difference]: Start difference. First operand 1708 states and 5548 transitions. Second operand has 44 states, 44 states have (on average 2.5454545454545454) internal successors, (112), 44 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have 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:18:39,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:39,738 INFO L93 Difference]: Finished difference Result 2600 states and 7859 transitions. [2022-03-15 19:18:39,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-03-15 19:18:39,739 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.5454545454545454) internal successors, (112), 44 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:18:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:39,744 INFO L225 Difference]: With dead ends: 2600 [2022-03-15 19:18:39,744 INFO L226 Difference]: Without dead ends: 2534 [2022-03-15 19:18:39,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6551 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4332, Invalid=17720, Unknown=0, NotChecked=0, Total=22052 [2022-03-15 19:18:39,746 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 381 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 1926 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:39,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 30 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1926 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:18:39,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2022-03-15 19:18:39,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 1812. [2022-03-15 19:18:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1811 states have (on average 3.2274986195472115) internal successors, (5845), 1811 states have internal predecessors, (5845), 0 states have call successors, (0), 0 states have 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:18:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 5845 transitions. [2022-03-15 19:18:39,775 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 5845 transitions. Word has length 22 [2022-03-15 19:18:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:39,775 INFO L470 AbstractCegarLoop]: Abstraction has 1812 states and 5845 transitions. [2022-03-15 19:18:39,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.5454545454545454) internal successors, (112), 44 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have 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:18:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 5845 transitions. [2022-03-15 19:18:39,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:18:39,778 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:39,778 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:39,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 19:18:39,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:39,979 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:18:39,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:39,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1573697057, now seen corresponding path program 28 times [2022-03-15 19:18:39,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:39,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261524465] [2022-03-15 19:18:39,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:39,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:40,056 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:40,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261524465] [2022-03-15 19:18:40,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261524465] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:40,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671817717] [2022-03-15 19:18:40,056 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:18:40,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:40,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:40,058 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:18:40,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 19:18:40,131 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:18:40,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:18:40,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:18:40,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:40,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:40,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671817717] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:40,287 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:40,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 21 [2022-03-15 19:18:40,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [668124749] [2022-03-15 19:18:40,287 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:40,288 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:40,293 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 102 transitions. [2022-03-15 19:18:40,294 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:41,067 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [66559#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 66573#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 66558#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 66556#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 66572#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 66561#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 66554#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 66577#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 2)), 66570#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 66557#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 66567#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 66563#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 66555#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 66569#(or (<= 5 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 3)), 66576#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 66571#(and (or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 66564#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 66562#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 66574#(or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 66566#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< 5 ~N~0) (<= ~N~0 4)), 66568#(or (<= 5 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 66565#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 66560#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 66575#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0))] [2022-03-15 19:18:41,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 19:18:41,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:41,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 19:18:41,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:18:41,069 INFO L87 Difference]: Start difference. First operand 1812 states and 5845 transitions. Second operand has 36 states, 36 states have (on average 2.5) internal successors, (90), 36 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:43,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:43,011 INFO L93 Difference]: Finished difference Result 2500 states and 7551 transitions. [2022-03-15 19:18:43,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-15 19:18:43,011 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.5) internal successors, (90), 36 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:18:43,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:43,018 INFO L225 Difference]: With dead ends: 2500 [2022-03-15 19:18:43,018 INFO L226 Difference]: Without dead ends: 2482 [2022-03-15 19:18:43,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2909 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2270, Invalid=8032, Unknown=0, NotChecked=0, Total=10302 [2022-03-15 19:18:43,019 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 317 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:43,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 26 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:18:43,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2022-03-15 19:18:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 1968. [2022-03-15 19:18:43,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1967 states have (on average 3.2399593289273003) internal successors, (6373), 1967 states have internal predecessors, (6373), 0 states have call successors, (0), 0 states have 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:18:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 6373 transitions. [2022-03-15 19:18:43,060 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 6373 transitions. Word has length 22 [2022-03-15 19:18:43,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:43,061 INFO L470 AbstractCegarLoop]: Abstraction has 1968 states and 6373 transitions. [2022-03-15 19:18:43,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.5) internal successors, (90), 36 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 6373 transitions. [2022-03-15 19:18:43,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:18:43,067 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:43,067 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:43,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 19:18:43,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-03-15 19:18:43,290 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:18:43,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:43,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1394609831, now seen corresponding path program 29 times [2022-03-15 19:18:43,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:43,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303535632] [2022-03-15 19:18:43,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:43,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:43,379 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:43,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:43,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303535632] [2022-03-15 19:18:43,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303535632] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:43,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948774042] [2022-03-15 19:18:43,379 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:18:43,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:43,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:43,380 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:18:43,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 19:18:43,445 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:18:43,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:18:43,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:18:43,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:43,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:43,602 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:43,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948774042] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:43,602 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:43,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 21 [2022-03-15 19:18:43,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1564319578] [2022-03-15 19:18:43,602 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:43,604 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:43,609 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 111 transitions. [2022-03-15 19:18:43,609 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:44,528 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [73347#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 73346#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 73354#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 73332#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 73345#(and (or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 73355#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 2)), 73333#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 73341#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 73338#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 73340#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 73335#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 73343#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 73342#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 73353#(or (<= 5 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 3)), 73348#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 73357#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 73344#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 73350#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 73356#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 73349#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< 5 ~N~0) (<= ~N~0 4)), 73352#(or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 73336#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 73339#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 73334#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 73337#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 73351#(or (<= 5 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3))] [2022-03-15 19:18:44,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 19:18:44,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:44,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 19:18:44,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1819, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:18:44,530 INFO L87 Difference]: Start difference. First operand 1968 states and 6373 transitions. Second operand has 38 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 38 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:18:46,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:46,850 INFO L93 Difference]: Finished difference Result 2822 states and 8553 transitions. [2022-03-15 19:18:46,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-15 19:18:46,851 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 38 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:18:46,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:46,860 INFO L225 Difference]: With dead ends: 2822 [2022-03-15 19:18:46,861 INFO L226 Difference]: Without dead ends: 2776 [2022-03-15 19:18:46,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3563 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2406, Invalid=9804, Unknown=0, NotChecked=0, Total=12210 [2022-03-15 19:18:46,862 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 288 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:46,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 32 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:18:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2022-03-15 19:18:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2234. [2022-03-15 19:18:46,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 2233 states have (on average 3.2360053739364085) internal successors, (7226), 2233 states have internal predecessors, (7226), 0 states have call successors, (0), 0 states have 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:18:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 7226 transitions. [2022-03-15 19:18:46,907 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 7226 transitions. Word has length 22 [2022-03-15 19:18:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:46,907 INFO L470 AbstractCegarLoop]: Abstraction has 2234 states and 7226 transitions. [2022-03-15 19:18:46,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 38 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:18:46,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 7226 transitions. [2022-03-15 19:18:46,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:18:46,912 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:46,912 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:46,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 19:18:47,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:47,138 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:18:47,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:47,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1150715869, now seen corresponding path program 30 times [2022-03-15 19:18:47,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:47,139 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152292681] [2022-03-15 19:18:47,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:47,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:47,225 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:47,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:47,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152292681] [2022-03-15 19:18:47,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152292681] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:47,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969367317] [2022-03-15 19:18:47,225 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:18:47,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:47,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:47,228 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:18:47,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 19:18:47,313 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:18:47,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:18:47,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:18:47,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:47,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:47,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969367317] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:47,495 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:47,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 21 [2022-03-15 19:18:47,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [396142255] [2022-03-15 19:18:47,495 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:47,497 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:47,503 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 102 transitions. [2022-03-15 19:18:47,503 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:48,336 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [80988#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 80995#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 80994#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 81007#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 80991#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 80992#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 81002#(or (<= 5 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 81006#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 81004#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 80989#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 80998#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 80993#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 81003#(or (<= 5 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 3)), 81005#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 81001#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 81009#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1)), 80997#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 80990#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 81000#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 80996#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 80999#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 80987#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 81008#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< 5 ~N~0) (<= ~N~0 4))] [2022-03-15 19:18:48,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 19:18:48,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:48,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 19:18:48,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1584, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:18:48,337 INFO L87 Difference]: Start difference. First operand 2234 states and 7226 transitions. Second operand has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:49,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:49,414 INFO L93 Difference]: Finished difference Result 2800 states and 8526 transitions. [2022-03-15 19:18:49,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 19:18:49,414 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:18:49,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:49,420 INFO L225 Difference]: With dead ends: 2800 [2022-03-15 19:18:49,420 INFO L226 Difference]: Without dead ends: 2776 [2022-03-15 19:18:49,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1139, Invalid=4263, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 19:18:49,421 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 252 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:49,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 23 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:18:49,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2022-03-15 19:18:49,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 1980. [2022-03-15 19:18:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1980 states, 1979 states have (on average 3.2344618494188984) internal successors, (6401), 1979 states have internal predecessors, (6401), 0 states have call successors, (0), 0 states have 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:18:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1980 states and 6401 transitions. [2022-03-15 19:18:49,462 INFO L78 Accepts]: Start accepts. Automaton has 1980 states and 6401 transitions. Word has length 22 [2022-03-15 19:18:49,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:49,462 INFO L470 AbstractCegarLoop]: Abstraction has 1980 states and 6401 transitions. [2022-03-15 19:18:49,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 6401 transitions. [2022-03-15 19:18:49,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:18:49,466 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:49,466 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:49,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 19:18:49,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:49,679 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:18:49,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:49,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2106075947, now seen corresponding path program 31 times [2022-03-15 19:18:49,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:49,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454559638] [2022-03-15 19:18:49,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:49,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:49,759 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:49,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454559638] [2022-03-15 19:18:49,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454559638] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:49,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564842991] [2022-03-15 19:18:49,760 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:18:49,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:49,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:49,761 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:18:49,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 19:18:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:49,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:18:49,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:50,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:50,049 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:18:50,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564842991] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:50,049 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:50,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 24 [2022-03-15 19:18:50,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1860252475] [2022-03-15 19:18:50,050 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:50,051 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:50,056 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 102 transitions. [2022-03-15 19:18:50,056 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:50,782 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [88015#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 88011#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 88018#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 88020#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 88026#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< 5 ~N~0) (<= ~N~0 4)), 88014#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 88023#(or (<= 5 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 3)), 88019#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 88016#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 88025#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 88010#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 88013#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 88017#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 88022#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 88024#(<= 1 thread1Thread1of1ForFork1_~i~0), 88029#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 88028#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 88021#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 88012#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 88027#(or (<= 5 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 88030#(= |thread2Thread1of1ForFork0_~i~1#1| 0)] [2022-03-15 19:18:50,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:18:50,783 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:50,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:18:50,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1667, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:18:50,784 INFO L87 Difference]: Start difference. First operand 1980 states and 6401 transitions. Second operand has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:51,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:51,803 INFO L93 Difference]: Finished difference Result 3490 states and 10485 transitions. [2022-03-15 19:18:51,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 19:18:51,803 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:18:51,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:51,810 INFO L225 Difference]: With dead ends: 3490 [2022-03-15 19:18:51,810 INFO L226 Difference]: Without dead ends: 3418 [2022-03-15 19:18:51,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1546 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=4077, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 19:18:51,812 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 215 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:51,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 18 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:18:51,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2022-03-15 19:18:51,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 1780. [2022-03-15 19:18:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1779 states have (on average 3.1815626756604836) internal successors, (5660), 1779 states have internal predecessors, (5660), 0 states have call successors, (0), 0 states have 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:18:51,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 5660 transitions. [2022-03-15 19:18:51,843 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 5660 transitions. Word has length 22 [2022-03-15 19:18:51,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:51,843 INFO L470 AbstractCegarLoop]: Abstraction has 1780 states and 5660 transitions. [2022-03-15 19:18:51,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 5660 transitions. [2022-03-15 19:18:51,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:18:51,846 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:51,846 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:51,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 19:18:52,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-03-15 19:18:52,047 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:18:52,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:52,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1769858259, now seen corresponding path program 32 times [2022-03-15 19:18:52,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:52,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63888035] [2022-03-15 19:18:52,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:52,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:52,135 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:52,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:52,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63888035] [2022-03-15 19:18:52,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63888035] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:52,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376946660] [2022-03-15 19:18:52,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:18:52,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:52,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:52,137 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:18:52,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 19:18:52,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:18:52,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:18:52,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:18:52,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:52,285 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:52,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:52,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376946660] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:52,344 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:52,344 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2022-03-15 19:18:52,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [497646115] [2022-03-15 19:18:52,345 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:52,347 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:52,357 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 172 transitions. [2022-03-15 19:18:52,357 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:53,188 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [95305#(or (= ~counter~0 4) (<= ~counter~0 3)), 95306#(or (= ~counter~0 5) (<= ~counter~0 4)), 95303#(or (<= ~counter~0 1) (= ~counter~0 2)), 95304#(or (= ~counter~0 3) (<= ~counter~0 2)), 95302#(or (<= ~counter~0 0) (= ~counter~0 1)), 95307#(or (= ~counter~0 0) (<= (+ ~counter~0 1) 0))] [2022-03-15 19:18:53,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:18:53,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:53,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:18:53,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:18:53,189 INFO L87 Difference]: Start difference. First operand 1780 states and 5660 transitions. Second operand has 14 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:18:53,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:53,341 INFO L93 Difference]: Finished difference Result 2561 states and 8190 transitions. [2022-03-15 19:18:53,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:18:53,342 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:18:53,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:53,345 INFO L225 Difference]: With dead ends: 2561 [2022-03-15 19:18:53,345 INFO L226 Difference]: Without dead ends: 2526 [2022-03-15 19:18:53,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 19 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:18:53,346 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 78 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:53,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 37 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:18:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2022-03-15 19:18:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2388. [2022-03-15 19:18:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2388 states, 2387 states have (on average 3.2492668621700878) internal successors, (7756), 2387 states have internal predecessors, (7756), 0 states have call successors, (0), 0 states have 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:18:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 7756 transitions. [2022-03-15 19:18:53,380 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 7756 transitions. Word has length 23 [2022-03-15 19:18:53,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:53,380 INFO L470 AbstractCegarLoop]: Abstraction has 2388 states and 7756 transitions. [2022-03-15 19:18:53,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:18:53,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 7756 transitions. [2022-03-15 19:18:53,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:18:53,385 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:53,385 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:53,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 19:18:53,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 19:18:53,599 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:18:53,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:53,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1080464012, now seen corresponding path program 33 times [2022-03-15 19:18:53,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:53,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783816057] [2022-03-15 19:18:53,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:53,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:53,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:53,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783816057] [2022-03-15 19:18:53,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783816057] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:53,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455147192] [2022-03-15 19:18:53,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:18:53,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:53,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:53,683 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:18:53,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 19:18:53,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:18:53,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:18:53,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:18:53,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:53,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:53,955 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:53,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455147192] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:53,955 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:53,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 25 [2022-03-15 19:18:53,955 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [291820471] [2022-03-15 19:18:53,955 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:53,957 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:53,963 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 115 transitions. [2022-03-15 19:18:53,963 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:54,620 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [102824#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 102814#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 102826#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 102810#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) thread1Thread1of1ForFork1_~i~0)), 102804#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 102825#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 102821#(or (<= ~N~0 3) (<= 2 thread1Thread1of1ForFork1_~i~0)), 102802#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) thread1Thread1of1ForFork1_~i~0)), 102808#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) thread1Thread1of1ForFork1_~i~0)), 102820#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0) (<= (+ ~N~0 1) thread1Thread1of1ForFork1_~i~0)), 102815#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= |thread2Thread1of1ForFork0_~i~1#1| thread1Thread1of1ForFork1_~i~0)), 102805#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) thread1Thread1of1ForFork1_~i~0)), 102819#(< |thread2Thread1of1ForFork0_~i~1#1| ~N~0), 102809#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0))), 102811#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 102823#(or (<= 0 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 3)), 102812#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 3)), 102807#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 102813#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 3)), 102822#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 3)), 102806#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) thread1Thread1of1ForFork1_~i~0)), 102816#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 102803#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) thread1Thread1of1ForFork1_~i~0)), 102817#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 102818#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 3))] [2022-03-15 19:18:54,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 19:18:54,621 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:54,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 19:18:54,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1894, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 19:18:54,622 INFO L87 Difference]: Start difference. First operand 2388 states and 7756 transitions. Second operand has 39 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 39 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:56,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:56,234 INFO L93 Difference]: Finished difference Result 3188 states and 9989 transitions. [2022-03-15 19:18:56,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-03-15 19:18:56,234 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 39 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:18:56,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:56,239 INFO L225 Difference]: With dead ends: 3188 [2022-03-15 19:18:56,239 INFO L226 Difference]: Without dead ends: 3178 [2022-03-15 19:18:56,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4221 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3848, Invalid=10672, Unknown=0, NotChecked=0, Total=14520 [2022-03-15 19:18:56,241 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 193 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:56,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 34 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:18:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2022-03-15 19:18:56,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 2048. [2022-03-15 19:18:56,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 2047 states have (on average 3.215437225207621) internal successors, (6582), 2047 states have internal predecessors, (6582), 0 states have call successors, (0), 0 states have 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:18:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 6582 transitions. [2022-03-15 19:18:56,285 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 6582 transitions. Word has length 23 [2022-03-15 19:18:56,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:56,286 INFO L470 AbstractCegarLoop]: Abstraction has 2048 states and 6582 transitions. [2022-03-15 19:18:56,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 39 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:56,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 6582 transitions. [2022-03-15 19:18:56,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:18:56,289 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:56,290 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:56,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 19:18:56,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 19:18:56,503 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:18:56,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:56,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1828217860, now seen corresponding path program 34 times [2022-03-15 19:18:56,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:56,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720727613] [2022-03-15 19:18:56,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:56,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:56,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:56,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720727613] [2022-03-15 19:18:56,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720727613] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:56,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143334622] [2022-03-15 19:18:56,601 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:18:56,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:56,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:56,602 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:18:56,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 19:18:56,673 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:18:56,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:18:56,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:18:56,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:56,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:56,946 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:56,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143334622] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:56,946 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:56,946 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 34 [2022-03-15 19:18:56,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [310318565] [2022-03-15 19:18:56,946 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:56,948 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:56,957 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 172 transitions. [2022-03-15 19:18:56,957 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:58,413 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [110504#(or (<= 6 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 3) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 110506#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 110517#(or (<= 6 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 110492#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 110495#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 110497#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 110515#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 6 ~N~0) (<= ~N~0 3)), 110503#(<= 6 ~N~0), 110505#(<= 5 thread1Thread1of1ForFork1_~i~0), 110491#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 110501#(or (<= 6 ~N~0) (<= ~N~0 3)), 110520#(<= 2 thread1Thread1of1ForFork1_~i~0), 110499#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 110511#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 5) (< 6 ~N~0)), 110513#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 6 ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 110490#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 110494#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 110510#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 110523#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 110518#(<= 4 thread1Thread1of1ForFork1_~i~0), 110496#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 110516#(or (<= 6 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 110519#(<= 3 thread1Thread1of1ForFork1_~i~0), 110514#(or (<= 6 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 3)), 110509#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 110522#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 110498#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 110521#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 110508#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 110524#(<= 1 thread1Thread1of1ForFork1_~i~0), 110493#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0)), 110512#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 110507#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 110502#(or (<= 6 ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 3)), 110500#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))] [2022-03-15 19:18:58,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-15 19:18:58,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:58,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-15 19:18:58,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=714, Invalid=3978, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 19:18:58,415 INFO L87 Difference]: Start difference. First operand 2048 states and 6582 transitions. Second operand has 49 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have 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:19:04,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:04,058 INFO L93 Difference]: Finished difference Result 3188 states and 9708 transitions. [2022-03-15 19:19:04,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-03-15 19:19:04,058 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:19:04,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:04,063 INFO L225 Difference]: With dead ends: 3188 [2022-03-15 19:19:04,063 INFO L226 Difference]: Without dead ends: 3186 [2022-03-15 19:19:04,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10649 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6182, Invalid=28600, Unknown=0, NotChecked=0, Total=34782 [2022-03-15 19:19:04,064 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 454 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:04,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 43 Invalid, 2651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:19:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3186 states. [2022-03-15 19:19:04,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 2016. [2022-03-15 19:19:04,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2016 states, 2015 states have (on average 3.2238213399503723) internal successors, (6496), 2015 states have internal predecessors, (6496), 0 states have call successors, (0), 0 states have 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:19:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 6496 transitions. [2022-03-15 19:19:04,104 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 6496 transitions. Word has length 23 [2022-03-15 19:19:04,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:04,104 INFO L470 AbstractCegarLoop]: Abstraction has 2016 states and 6496 transitions. [2022-03-15 19:19:04,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have 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:19:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 6496 transitions. [2022-03-15 19:19:04,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:19:04,108 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:04,108 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:19:04,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 19:19:04,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:04,330 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:19:04,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:04,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1778943646, now seen corresponding path program 35 times [2022-03-15 19:19:04,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:04,331 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195381292] [2022-03-15 19:19:04,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:04,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:04,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:04,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195381292] [2022-03-15 19:19:04,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195381292] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:04,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184166169] [2022-03-15 19:19:04,427 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:19:04,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:04,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:04,428 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:19:04,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 19:19:04,515 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:19:04,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:19:04,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:19:04,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:19:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:04,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:19:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:04,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184166169] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:19:04,678 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:19:04,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2022-03-15 19:19:04,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [250648247] [2022-03-15 19:19:04,679 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:04,681 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:04,693 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 184 transitions. [2022-03-15 19:19:04,693 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:06,653 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 46 new interpolants: [118263#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 118299#(or (<= 6 ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 118294#(and (or (<= 6 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0))), 118290#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 118301#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 6 ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 118305#(or (<= 6 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 118271#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 118278#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 5) (< 6 ~N~0)), 118273#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 118292#(and (or (<= 6 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 118298#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 5) (< 6 ~N~0)), 118281#(or (<= 6 ~N~0) (<= ~N~0 4) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 118260#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 118270#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 118289#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 118274#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 118264#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 118295#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 6 ~N~0))), 118304#(or (<= 6 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 118269#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 118282#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 6 ~N~0) (<= ~N~0 4) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 118302#(or (<= 6 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 118266#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 118303#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 6 ~N~0)), 118283#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 118276#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 118291#(and (or (<= 6 ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 118261#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 118272#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 118280#(or (<= 6 ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 4)), 118262#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 118300#(or (<= 6 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 118277#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 118296#(and (or (<= 6 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0))), 118267#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 118286#(or (<= 6 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 4) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 118268#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 118275#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 118265#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 118287#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 118288#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 118279#(or (<= 6 ~N~0) (<= ~N~0 4)), 118293#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 6 ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0))), 118285#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 118297#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (<= 6 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0))), 118284#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 6 ~N~0) (<= ~N~0 4))] [2022-03-15 19:19:06,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 19:19:06,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:06,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 19:19:06,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=4068, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 19:19:06,654 INFO L87 Difference]: Start difference. First operand 2016 states and 6496 transitions. Second operand has 61 states, 61 states have (on average 2.5737704918032787) internal successors, (157), 61 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have 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:19:15,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:15,312 INFO L93 Difference]: Finished difference Result 3392 states and 10453 transitions. [2022-03-15 19:19:15,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-03-15 19:19:15,312 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.5737704918032787) internal successors, (157), 61 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:19:15,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:15,317 INFO L225 Difference]: With dead ends: 3392 [2022-03-15 19:19:15,318 INFO L226 Difference]: Without dead ends: 3392 [2022-03-15 19:19:15,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 206 SyntacticMatches, 2 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13505 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=7450, Invalid=36440, Unknown=0, NotChecked=0, Total=43890 [2022-03-15 19:19:15,320 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 662 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 3570 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 3955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 3570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:15,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [662 Valid, 84 Invalid, 3955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 3570 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 19:19:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3392 states. [2022-03-15 19:19:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3392 to 2276. [2022-03-15 19:19:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2276 states, 2275 states have (on average 3.240879120879121) internal successors, (7373), 2275 states have internal predecessors, (7373), 0 states have call successors, (0), 0 states have 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:19:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 7373 transitions. [2022-03-15 19:19:15,395 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 7373 transitions. Word has length 24 [2022-03-15 19:19:15,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:15,395 INFO L470 AbstractCegarLoop]: Abstraction has 2276 states and 7373 transitions. [2022-03-15 19:19:15,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.5737704918032787) internal successors, (157), 61 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have 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:19:15,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 7373 transitions. [2022-03-15 19:19:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:19:15,399 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:15,400 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:19:15,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 19:19:15,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 19:19:15,600 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:19:15,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:15,601 INFO L85 PathProgramCache]: Analyzing trace with hash 142388920, now seen corresponding path program 36 times [2022-03-15 19:19:15,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:15,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356560232] [2022-03-15 19:19:15,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:15,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:15,696 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:15,696 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:15,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356560232] [2022-03-15 19:19:15,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356560232] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:15,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337517169] [2022-03-15 19:19:15,697 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:19:15,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:15,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:15,698 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:19:15,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 19:19:15,792 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:19:15,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:19:15,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:19:15,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:19:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:15,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:19:15,972 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:15,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337517169] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:19:15,972 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:19:15,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2022-03-15 19:19:15,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [474780663] [2022-03-15 19:19:15,972 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:15,975 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:15,984 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 122 transitions. [2022-03-15 19:19:15,984 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:16,997 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [126838#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 126850#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 126852#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 6 ~N~0) (<= ~N~0 4)), 126865#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 5) (< 6 ~N~0)), 126841#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 126835#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 126839#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 126836#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 126846#(or (<= 6 ~N~0) (<= ~N~0 4) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 126853#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 126840#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 126866#(or (<= ~N~0 4) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 126856#(or (<= 6 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 4) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 126851#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 126862#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 126864#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 126854#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 126861#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 126857#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)))), 126847#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 6 ~N~0) (<= ~N~0 4) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 126843#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 126855#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 126863#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 126848#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 126860#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 126837#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 126844#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 126849#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 126859#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 126858#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 126842#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 126845#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)))] [2022-03-15 19:19:16,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 19:19:16,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:16,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 19:19:16,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=2520, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 19:19:16,998 INFO L87 Difference]: Start difference. First operand 2276 states and 7373 transitions. Second operand has 47 states, 47 states have (on average 2.3617021276595747) internal successors, (111), 47 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:19:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:21,980 INFO L93 Difference]: Finished difference Result 4126 states and 12360 transitions. [2022-03-15 19:19:21,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-03-15 19:19:21,980 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.3617021276595747) internal successors, (111), 47 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:19:21,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:21,987 INFO L225 Difference]: With dead ends: 4126 [2022-03-15 19:19:21,987 INFO L226 Difference]: Without dead ends: 4122 [2022-03-15 19:19:21,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9968 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7486, Invalid=25094, Unknown=0, NotChecked=0, Total=32580 [2022-03-15 19:19:21,989 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 515 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:21,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [515 Valid, 43 Invalid, 2692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:19:21,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4122 states. [2022-03-15 19:19:22,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4122 to 3056. [2022-03-15 19:19:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3056 states, 3055 states have (on average 3.3031096563011455) internal successors, (10091), 3055 states have internal predecessors, (10091), 0 states have call successors, (0), 0 states have 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:19:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3056 states to 3056 states and 10091 transitions. [2022-03-15 19:19:22,057 INFO L78 Accepts]: Start accepts. Automaton has 3056 states and 10091 transitions. Word has length 24 [2022-03-15 19:19:22,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:22,057 INFO L470 AbstractCegarLoop]: Abstraction has 3056 states and 10091 transitions. [2022-03-15 19:19:22,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.3617021276595747) internal successors, (111), 47 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:19:22,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3056 states and 10091 transitions. [2022-03-15 19:19:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:19:22,062 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:22,062 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:19:22,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 19:19:22,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 19:19:22,263 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:19:22,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:22,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1760832098, now seen corresponding path program 37 times [2022-03-15 19:19:22,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:22,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413555935] [2022-03-15 19:19:22,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:22,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:22,358 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:22,358 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:22,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413555935] [2022-03-15 19:19:22,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413555935] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:22,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994357815] [2022-03-15 19:19:22,359 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:19:22,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:22,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:22,360 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:19:22,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 19:19:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:22,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:19:22,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:19:22,586 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:22,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:19:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:22,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994357815] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:19:22,643 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:19:22,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2022-03-15 19:19:22,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [874869424] [2022-03-15 19:19:22,643 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:22,645 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:22,652 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 126 transitions. [2022-03-15 19:19:22,652 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:23,772 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [137659#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 6 ~N~0) (<= ~N~0 4) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 137648#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 137658#(or (<= 6 ~N~0) (<= ~N~0 4) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 137646#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 137665#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 137661#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 6 ~N~0) (<= ~N~0 4)), 137670#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 137643#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 137644#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 137656#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 137645#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 137662#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 137671#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 137672#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 137652#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 137657#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 5) (< 6 ~N~0)), 137647#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 137650#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 137669#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 137642#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 137663#(or (<= 6 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 4) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 137673#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 137666#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 137655#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 137654#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 137651#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 137664#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)))), 137649#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 137660#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 137653#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 137667#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 137668#(or (<= ~N~0 4) (= |thread2Thread1of1ForFork0_~i~1#1| 0))] [2022-03-15 19:19:23,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 19:19:23,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:23,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 19:19:23,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=2559, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 19:19:23,773 INFO L87 Difference]: Start difference. First operand 3056 states and 10091 transitions. Second operand has 47 states, 47 states have (on average 2.382978723404255) internal successors, (112), 47 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have 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:19:29,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:29,579 INFO L93 Difference]: Finished difference Result 4836 states and 14641 transitions. [2022-03-15 19:19:29,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2022-03-15 19:19:29,579 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.382978723404255) internal successors, (112), 47 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:19:29,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:29,588 INFO L225 Difference]: With dead ends: 4836 [2022-03-15 19:19:29,588 INFO L226 Difference]: Without dead ends: 4818 [2022-03-15 19:19:29,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12045 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7854, Invalid=29588, Unknown=0, NotChecked=0, Total=37442 [2022-03-15 19:19:29,590 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 467 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 2764 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 3113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 2764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:29,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 40 Invalid, 3113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 2764 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:19:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4818 states. [2022-03-15 19:19:29,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4818 to 3326. [2022-03-15 19:19:29,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3326 states, 3325 states have (on average 3.310075187969925) internal successors, (11006), 3325 states have internal predecessors, (11006), 0 states have call successors, (0), 0 states have 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:19:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 11006 transitions. [2022-03-15 19:19:29,645 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 11006 transitions. Word has length 24 [2022-03-15 19:19:29,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:29,645 INFO L470 AbstractCegarLoop]: Abstraction has 3326 states and 11006 transitions. [2022-03-15 19:19:29,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.382978723404255) internal successors, (112), 47 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have 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:19:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 11006 transitions. [2022-03-15 19:19:29,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:19:29,652 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:29,652 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:19:29,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 19:19:29,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:29,859 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:19:29,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash 392963064, now seen corresponding path program 38 times [2022-03-15 19:19:29,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:29,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771202753] [2022-03-15 19:19:29,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:29,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:29,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:29,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771202753] [2022-03-15 19:19:29,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771202753] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:29,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775472014] [2022-03-15 19:19:29,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:19:29,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:29,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:29,958 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:19:29,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 19:19:30,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:19:30,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:19:30,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:19:30,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:19:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:30,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:19:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:30,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775472014] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:19:30,253 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:19:30,253 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2022-03-15 19:19:30,253 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1779885472] [2022-03-15 19:19:30,253 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:30,255 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:30,264 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 135 transitions. [2022-03-15 19:19:30,264 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:31,538 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [149760#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 149756#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 149765#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 149745#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 149741#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 149770#(or (<= ~N~0 4) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 149762#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 6 ~N~0) (<= ~N~0 4)), 149747#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 149746#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 149769#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 149758#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 149759#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 149767#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 149761#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 5) (< 6 ~N~0)), 149740#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 149771#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 149751#(or (<= 6 ~N~0) (<= ~N~0 4) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 149755#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)))), 149753#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 149763#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 149744#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 149750#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 149764#(or (<= 6 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 4) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 149743#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 149749#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 149748#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 149754#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 149752#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 6 ~N~0) (<= ~N~0 4) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 149742#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 149768#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 149757#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 149739#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 149738#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 149766#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))))] [2022-03-15 19:19:31,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-15 19:19:31,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:31,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-15 19:19:31,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=2797, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 19:19:31,539 INFO L87 Difference]: Start difference. First operand 3326 states and 11006 transitions. Second operand has 49 states, 49 states have (on average 2.4285714285714284) internal successors, (119), 49 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:37,361 INFO L93 Difference]: Finished difference Result 5034 states and 15359 transitions. [2022-03-15 19:19:37,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-03-15 19:19:37,361 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.4285714285714284) internal successors, (119), 49 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:19:37,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:37,369 INFO L225 Difference]: With dead ends: 5034 [2022-03-15 19:19:37,369 INFO L226 Difference]: Without dead ends: 4992 [2022-03-15 19:19:37,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11915 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7551, Invalid=30279, Unknown=0, NotChecked=0, Total=37830 [2022-03-15 19:19:37,371 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 501 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:37,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 34 Invalid, 2665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:19:37,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2022-03-15 19:19:37,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 3446. [2022-03-15 19:19:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3446 states, 3445 states have (on average 3.302177068214804) internal successors, (11376), 3445 states have internal predecessors, (11376), 0 states have call successors, (0), 0 states have 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:19:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 3446 states and 11376 transitions. [2022-03-15 19:19:37,422 INFO L78 Accepts]: Start accepts. Automaton has 3446 states and 11376 transitions. Word has length 24 [2022-03-15 19:19:37,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:37,422 INFO L470 AbstractCegarLoop]: Abstraction has 3446 states and 11376 transitions. [2022-03-15 19:19:37,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.4285714285714284) internal successors, (119), 49 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3446 states and 11376 transitions. [2022-03-15 19:19:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:19:37,427 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:37,427 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:19:37,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-15 19:19:37,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 19:19:37,628 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:19:37,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:37,628 INFO L85 PathProgramCache]: Analyzing trace with hash 938695970, now seen corresponding path program 39 times [2022-03-15 19:19:37,628 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:37,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848650039] [2022-03-15 19:19:37,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:37,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:37,740 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:37,740 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:37,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848650039] [2022-03-15 19:19:37,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848650039] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:37,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764184967] [2022-03-15 19:19:37,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:19:37,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:37,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:37,742 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:19:37,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 19:19:37,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:19:37,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:19:37,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:19:37,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:19:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:37,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:19:38,034 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:38,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764184967] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:19:38,035 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:19:38,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2022-03-15 19:19:38,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1475191444] [2022-03-15 19:19:38,035 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:38,037 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:38,047 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 144 transitions. [2022-03-15 19:19:38,047 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:39,348 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [162294#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 162282#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 162305#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 5) (< 6 ~N~0)), 162288#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)))), 162302#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 162293#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 6 ~N~0) (<= ~N~0 4)), 162275#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 162295#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 162303#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 162292#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 162306#(or (<= ~N~0 4) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 162283#(or (<= 6 ~N~0) (<= ~N~0 4) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 162285#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 162297#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 162272#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 162298#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 162300#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 162299#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 162279#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 162287#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 162280#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 162304#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 162286#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 162273#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 162289#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 162284#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 6 ~N~0) (<= ~N~0 4) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 162281#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 162271#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 162274#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 162301#(or (<= 6 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 4) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 162276#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 162278#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 162296#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 162291#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 162290#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 162277#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0))] [2022-03-15 19:19:39,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 19:19:39,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:39,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 19:19:39,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=3029, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:19:39,349 INFO L87 Difference]: Start difference. First operand 3446 states and 11376 transitions. Second operand has 51 states, 51 states have (on average 2.4705882352941178) internal successors, (126), 51 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:45,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:45,300 INFO L93 Difference]: Finished difference Result 5092 states and 15656 transitions. [2022-03-15 19:19:45,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-03-15 19:19:45,300 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.4705882352941178) internal successors, (126), 51 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:19:45,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:45,308 INFO L225 Difference]: With dead ends: 5092 [2022-03-15 19:19:45,308 INFO L226 Difference]: Without dead ends: 5014 [2022-03-15 19:19:45,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11157 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6987, Invalid=29303, Unknown=0, NotChecked=0, Total=36290 [2022-03-15 19:19:45,311 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 455 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 2995 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 2995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:45,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [455 Valid, 42 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 2995 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 19:19:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5014 states. [2022-03-15 19:19:45,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5014 to 3646. [2022-03-15 19:19:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3646 states, 3645 states have (on average 3.2941015089163237) internal successors, (12007), 3645 states have internal predecessors, (12007), 0 states have call successors, (0), 0 states have 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:19:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3646 states to 3646 states and 12007 transitions. [2022-03-15 19:19:45,376 INFO L78 Accepts]: Start accepts. Automaton has 3646 states and 12007 transitions. Word has length 24 [2022-03-15 19:19:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:45,376 INFO L470 AbstractCegarLoop]: Abstraction has 3646 states and 12007 transitions. [2022-03-15 19:19:45,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.4705882352941178) internal successors, (126), 51 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3646 states and 12007 transitions. [2022-03-15 19:19:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:19:45,382 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:45,382 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:19:45,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-03-15 19:19:45,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:45,582 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:19:45,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:45,583 INFO L85 PathProgramCache]: Analyzing trace with hash 676546872, now seen corresponding path program 40 times [2022-03-15 19:19:45,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:45,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549509981] [2022-03-15 19:19:45,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:45,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:45,668 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:45,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549509981] [2022-03-15 19:19:45,668 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549509981] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:45,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996025852] [2022-03-15 19:19:45,668 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:19:45,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:45,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:45,670 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:19:45,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 19:19:45,735 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:19:45,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:19:45,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:19:45,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:19:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:45,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:19:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:45,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996025852] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:19:45,914 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:19:45,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2022-03-15 19:19:45,914 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1357499962] [2022-03-15 19:19:45,914 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:45,917 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:45,925 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 153 transitions. [2022-03-15 19:19:45,925 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:47,348 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 38 new interpolants: [175257#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 175258#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 175270#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 175262#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 175273#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 175269#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)))), 175280#(or (<= ~N~0 4) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 175250#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 175276#(or (<= 6 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 4) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 175281#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 175247#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 175271#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 175274#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 175264#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 6 ~N~0) (<= ~N~0 4) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 175252#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 175283#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 175246#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 175275#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 175256#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 175261#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 175277#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 175263#(or (<= 6 ~N~0) (<= ~N~0 4) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 175272#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 175260#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 175253#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 175268#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 175251#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 175278#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 175267#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 175279#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 5) (< 6 ~N~0)), 175248#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 175255#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 175282#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 175266#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 6 ~N~0) (<= ~N~0 4)), 175259#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 175254#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 175249#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 175265#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0))] [2022-03-15 19:19:47,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-15 19:19:47,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:47,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-15 19:19:47,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=527, Invalid=3255, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:19:47,349 INFO L87 Difference]: Start difference. First operand 3646 states and 12007 transitions. Second operand has 53 states, 53 states have (on average 2.509433962264151) internal successors, (133), 53 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have 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:19:53,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:53,375 INFO L93 Difference]: Finished difference Result 5594 states and 17419 transitions. [2022-03-15 19:19:53,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-03-15 19:19:53,375 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.509433962264151) internal successors, (133), 53 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:19:53,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:53,384 INFO L225 Difference]: With dead ends: 5594 [2022-03-15 19:19:53,384 INFO L226 Difference]: Without dead ends: 5496 [2022-03-15 19:19:53,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11369 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7075, Invalid=29597, Unknown=0, NotChecked=0, Total=36672 [2022-03-15 19:19:53,386 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 449 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 3385 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 3385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:53,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 49 Invalid, 3687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 3385 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:19:53,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5496 states. [2022-03-15 19:19:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5496 to 3798. [2022-03-15 19:19:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3798 states, 3797 states have (on average 3.278377666578878) internal successors, (12448), 3797 states have internal predecessors, (12448), 0 states have call successors, (0), 0 states have 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:19:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3798 states to 3798 states and 12448 transitions. [2022-03-15 19:19:53,445 INFO L78 Accepts]: Start accepts. Automaton has 3798 states and 12448 transitions. Word has length 24 [2022-03-15 19:19:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:53,445 INFO L470 AbstractCegarLoop]: Abstraction has 3798 states and 12448 transitions. [2022-03-15 19:19:53,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.509433962264151) internal successors, (133), 53 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have 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:19:53,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3798 states and 12448 transitions. [2022-03-15 19:19:53,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:19:53,453 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:53,453 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:19:53,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 19:19:53,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:53,667 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:19:53,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:53,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1679129836, now seen corresponding path program 41 times [2022-03-15 19:19:53,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:53,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156616324] [2022-03-15 19:19:53,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:53,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:53,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:53,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156616324] [2022-03-15 19:19:53,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156616324] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:53,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942812297] [2022-03-15 19:19:53,755 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:19:53,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:53,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:53,756 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:19:53,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 19:19:53,853 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:19:53,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:19:53,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:19:53,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:19:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:53,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:19:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:54,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942812297] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:19:54,040 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:19:54,041 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 24 [2022-03-15 19:19:54,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [195383599] [2022-03-15 19:19:54,041 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:54,043 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:54,051 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 117 transitions. [2022-03-15 19:19:54,051 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:55,071 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [189034#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 189032#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 189041#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 6 ~N~0) (<= ~N~0 4) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 189046#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 189048#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 189044#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 189035#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 189027#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 189033#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 189043#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 6 ~N~0) (<= ~N~0 4)), 189038#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 189053#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 189039#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 189050#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 3)), 189052#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 189040#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 5) (< 6 ~N~0)), 189051#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 189045#(or (<= 6 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 4) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 189037#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 189047#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0))), 189029#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 189049#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 189042#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 189036#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 189028#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 189026#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 189031#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 189054#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 189030#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0))] [2022-03-15 19:19:55,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 19:19:55,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:55,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 19:19:55,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=2281, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:19:55,072 INFO L87 Difference]: Start difference. First operand 3798 states and 12448 transitions. Second operand has 43 states, 43 states have (on average 2.4186046511627906) internal successors, (104), 43 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:58,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:58,810 INFO L93 Difference]: Finished difference Result 5386 states and 16480 transitions. [2022-03-15 19:19:58,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-03-15 19:19:58,810 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.4186046511627906) internal successors, (104), 43 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:19:58,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:58,822 INFO L225 Difference]: With dead ends: 5386 [2022-03-15 19:19:58,822 INFO L226 Difference]: Without dead ends: 5368 [2022-03-15 19:19:58,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6421 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4707, Invalid=16755, Unknown=0, NotChecked=0, Total=21462 [2022-03-15 19:19:58,824 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 410 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 2123 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 2123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:58,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 38 Invalid, 2374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 2123 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:19:58,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5368 states. [2022-03-15 19:19:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5368 to 4120. [2022-03-15 19:19:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4120 states, 4119 states have (on average 3.2903617382859918) internal successors, (13553), 4119 states have internal predecessors, (13553), 0 states have call successors, (0), 0 states have 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:19:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4120 states to 4120 states and 13553 transitions. [2022-03-15 19:19:58,912 INFO L78 Accepts]: Start accepts. Automaton has 4120 states and 13553 transitions. Word has length 24 [2022-03-15 19:19:58,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:58,913 INFO L470 AbstractCegarLoop]: Abstraction has 4120 states and 13553 transitions. [2022-03-15 19:19:58,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.4186046511627906) internal successors, (104), 43 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4120 states and 13553 transitions. [2022-03-15 19:19:58,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:19:58,921 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:58,921 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:19:58,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-03-15 19:19:59,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-03-15 19:19:59,122 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:19:59,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:59,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1289177052, now seen corresponding path program 42 times [2022-03-15 19:19:59,123 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:59,123 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30979679] [2022-03-15 19:19:59,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:59,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:59,218 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:59,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30979679] [2022-03-15 19:19:59,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30979679] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:59,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526689509] [2022-03-15 19:19:59,218 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:19:59,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:59,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:59,219 INFO L229 MonitoredProcess]: Starting monitored process 45 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:19:59,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 19:19:59,311 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:19:59,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:19:59,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:19:59,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:19:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:59,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:19:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:59,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526689509] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:19:59,485 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:19:59,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 24 [2022-03-15 19:19:59,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [283241474] [2022-03-15 19:19:59,485 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:59,487 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:59,519 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 126 transitions. [2022-03-15 19:19:59,519 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:00,573 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [203154#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 3)), 203130#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 203139#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 203142#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 203153#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 203137#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 203132#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 203149#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 203141#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 203147#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 203140#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0))), 203155#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 203129#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 203133#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 203146#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 203150#(or (<= 6 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 4) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 203127#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 203135#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 203144#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 6 ~N~0) (<= ~N~0 4)), 203148#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 203131#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 203128#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 203143#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 203138#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 203125#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 203145#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 203126#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 203151#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 5) (< 6 ~N~0)), 203134#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 203152#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 203136#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 6 ~N~0) (<= ~N~0 4) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0))] [2022-03-15 19:20:00,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 19:20:00,573 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:00,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 19:20:00,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=2505, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:20:00,574 INFO L87 Difference]: Start difference. First operand 4120 states and 13553 transitions. Second operand has 45 states, 45 states have (on average 2.466666666666667) internal successors, (111), 45 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:20:04,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:04,517 INFO L93 Difference]: Finished difference Result 5314 states and 16443 transitions. [2022-03-15 19:20:04,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-15 19:20:04,518 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.466666666666667) internal successors, (111), 45 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:20:04,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:04,527 INFO L225 Difference]: With dead ends: 5314 [2022-03-15 19:20:04,528 INFO L226 Difference]: Without dead ends: 5272 [2022-03-15 19:20:04,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6756 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4546, Invalid=17804, Unknown=0, NotChecked=0, Total=22350 [2022-03-15 19:20:04,530 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 407 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 2340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:04,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 30 Invalid, 2340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:20:04,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5272 states. [2022-03-15 19:20:04,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5272 to 4160. [2022-03-15 19:20:04,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4160 states, 4159 states have (on average 3.2909353209906227) internal successors, (13687), 4159 states have internal predecessors, (13687), 0 states have call successors, (0), 0 states have 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:20:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 13687 transitions. [2022-03-15 19:20:04,608 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 13687 transitions. Word has length 24 [2022-03-15 19:20:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:04,608 INFO L470 AbstractCegarLoop]: Abstraction has 4160 states and 13687 transitions. [2022-03-15 19:20:04,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.466666666666667) internal successors, (111), 45 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:20:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 13687 transitions. [2022-03-15 19:20:04,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:20:04,616 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:04,616 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:20:04,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-03-15 19:20:04,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 19:20:04,817 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:20:04,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:04,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1182589932, now seen corresponding path program 43 times [2022-03-15 19:20:04,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:04,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705099758] [2022-03-15 19:20:04,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:04,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:04,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:04,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705099758] [2022-03-15 19:20:04,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705099758] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:04,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205504921] [2022-03-15 19:20:04,907 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:20:04,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:04,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:04,908 INFO L229 MonitoredProcess]: Starting monitored process 46 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:20:04,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 19:20:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:04,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:20:04,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:05,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:05,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205504921] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:05,164 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:05,164 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 24 [2022-03-15 19:20:05,164 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1714597984] [2022-03-15 19:20:05,164 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:05,166 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:05,176 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 135 transitions. [2022-03-15 19:20:05,177 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:06,382 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 33 new interpolants: [217269#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 217262#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 217258#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 217259#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 6 ~N~0) (<= ~N~0 4)), 217268#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 217265#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 217250#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 217244#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 217251#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 217256#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 217249#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 217238#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 217266#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 5) (< 6 ~N~0)), 217245#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 217253#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 217240#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 217247#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 217242#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 217267#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 3)), 217243#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 217246#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 217257#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 6 ~N~0) (<= ~N~0 4) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 217237#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 217261#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 217260#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 217263#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 217241#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 217252#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 217264#(or (<= 6 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 4) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 217248#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 217254#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0))), 217255#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 217239#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)))] [2022-03-15 19:20:06,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 19:20:06,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:06,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 19:20:06,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=2723, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:20:06,383 INFO L87 Difference]: Start difference. First operand 4160 states and 13687 transitions. Second operand has 47 states, 47 states have (on average 2.5106382978723403) internal successors, (118), 47 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have 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:20:10,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:10,736 INFO L93 Difference]: Finished difference Result 6006 states and 18696 transitions. [2022-03-15 19:20:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-03-15 19:20:10,736 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.5106382978723403) internal successors, (118), 47 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:20:10,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:10,745 INFO L225 Difference]: With dead ends: 6006 [2022-03-15 19:20:10,745 INFO L226 Difference]: Without dead ends: 5920 [2022-03-15 19:20:10,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7159 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4406, Invalid=19464, Unknown=0, NotChecked=0, Total=23870 [2022-03-15 19:20:10,747 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 375 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:10,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 38 Invalid, 2809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:20:10,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5920 states. [2022-03-15 19:20:10,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5920 to 4502. [2022-03-15 19:20:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4502 states, 4501 states have (on average 3.277938235947567) internal successors, (14754), 4501 states have internal predecessors, (14754), 0 states have call successors, (0), 0 states have 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:20:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4502 states to 4502 states and 14754 transitions. [2022-03-15 19:20:10,816 INFO L78 Accepts]: Start accepts. Automaton has 4502 states and 14754 transitions. Word has length 24 [2022-03-15 19:20:10,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:10,816 INFO L470 AbstractCegarLoop]: Abstraction has 4502 states and 14754 transitions. [2022-03-15 19:20:10,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.5106382978723403) internal successors, (118), 47 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have 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:20:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 4502 states and 14754 transitions. [2022-03-15 19:20:10,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:20:10,824 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:10,824 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:20:10,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 19:20:11,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-03-15 19:20:11,024 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:20:11,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:11,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1895913096, now seen corresponding path program 44 times [2022-03-15 19:20:11,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:11,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024982123] [2022-03-15 19:20:11,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:11,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:11,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:11,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024982123] [2022-03-15 19:20:11,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024982123] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:11,111 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038664618] [2022-03-15 19:20:11,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:20:11,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:11,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:11,112 INFO L229 MonitoredProcess]: Starting monitored process 47 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:20:11,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 19:20:11,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:20:11,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:20:11,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:20:11,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:11,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:11,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038664618] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:11,377 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:11,377 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 24 [2022-03-15 19:20:11,377 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1510405431] [2022-03-15 19:20:11,377 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:11,379 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:11,387 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 117 transitions. [2022-03-15 19:20:11,387 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:12,350 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [232736#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 232743#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 232746#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 232739#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 232753#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 232747#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 232759#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 232750#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 232754#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 6 ~N~0) (<= ~N~0 4)), 232756#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 232761#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 232745#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 232755#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 232763#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 232742#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 232749#(and (or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 232752#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 5) (< 6 ~N~0)), 232737#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 232760#(or (<= 6 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 4) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 232758#(or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 232740#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 232748#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 232741#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 232744#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 232751#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 232757#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 232738#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 232762#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 2))] [2022-03-15 19:20:12,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:20:12,351 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:12,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:20:12,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=2227, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:20:12,351 INFO L87 Difference]: Start difference. First operand 4502 states and 14754 transitions. Second operand has 41 states, 41 states have (on average 2.5121951219512195) internal successors, (103), 41 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have 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:20:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:14,771 INFO L93 Difference]: Finished difference Result 5884 states and 18133 transitions. [2022-03-15 19:20:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-03-15 19:20:14,771 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.5121951219512195) internal successors, (103), 41 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:20:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:14,780 INFO L225 Difference]: With dead ends: 5884 [2022-03-15 19:20:14,780 INFO L226 Difference]: Without dead ends: 5842 [2022-03-15 19:20:14,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3776 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2588, Invalid=10294, Unknown=0, NotChecked=0, Total=12882 [2022-03-15 19:20:14,781 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 427 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:14,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 23 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:20:14,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5842 states. [2022-03-15 19:20:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5842 to 4572. [2022-03-15 19:20:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4572 states, 4571 states have (on average 3.2747757602275214) internal successors, (14969), 4571 states have internal predecessors, (14969), 0 states have call successors, (0), 0 states have 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:20:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4572 states to 4572 states and 14969 transitions. [2022-03-15 19:20:14,844 INFO L78 Accepts]: Start accepts. Automaton has 4572 states and 14969 transitions. Word has length 24 [2022-03-15 19:20:14,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:14,844 INFO L470 AbstractCegarLoop]: Abstraction has 4572 states and 14969 transitions. [2022-03-15 19:20:14,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.5121951219512195) internal successors, (103), 41 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have 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:20:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand 4572 states and 14969 transitions. [2022-03-15 19:20:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:20:14,850 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:14,850 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:20:14,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-03-15 19:20:15,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:15,053 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:20:15,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:15,053 INFO L85 PathProgramCache]: Analyzing trace with hash 153368162, now seen corresponding path program 45 times [2022-03-15 19:20:15,054 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:15,054 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469157237] [2022-03-15 19:20:15,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:15,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:15,136 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:15,136 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:15,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469157237] [2022-03-15 19:20:15,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469157237] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:15,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508178890] [2022-03-15 19:20:15,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:20:15,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:15,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:15,138 INFO L229 MonitoredProcess]: Starting monitored process 48 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:20:15,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 19:20:15,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:20:15,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:20:15,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:20:15,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:15,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:15,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508178890] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:15,394 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:15,394 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 24 [2022-03-15 19:20:15,394 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [423679585] [2022-03-15 19:20:15,394 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:15,396 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:15,402 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 126 transitions. [2022-03-15 19:20:15,403 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:16,487 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [248144#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 248152#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 248158#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 248155#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 248157#(and (or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 248160#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 6 ~N~0) (<= ~N~0 4)), 248150#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 248165#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 248168#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 248142#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 248156#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 5) (< 6 ~N~0)), 248166#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 2)), 248145#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 248153#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 248162#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 248163#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 248154#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 248141#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 248149#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 248140#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 248167#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 248143#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 248151#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 248146#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 248148#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 248169#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 248147#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 248161#(or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 248164#(or (<= 6 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 4) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 248159#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0))] [2022-03-15 19:20:16,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 19:20:16,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:16,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 19:20:16,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=2434, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:20:16,488 INFO L87 Difference]: Start difference. First operand 4572 states and 14969 transitions. Second operand has 44 states, 44 states have (on average 2.5) internal successors, (110), 44 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:19,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:19,552 INFO L93 Difference]: Finished difference Result 7196 states and 22392 transitions. [2022-03-15 19:20:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-03-15 19:20:19,552 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.5) internal successors, (110), 44 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:20:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:19,566 INFO L225 Difference]: With dead ends: 7196 [2022-03-15 19:20:19,566 INFO L226 Difference]: Without dead ends: 7122 [2022-03-15 19:20:19,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5097 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3142, Invalid=13628, Unknown=0, NotChecked=0, Total=16770 [2022-03-15 19:20:19,567 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 322 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 1881 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 2092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:19,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 23 Invalid, 2092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1881 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:20:19,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7122 states. [2022-03-15 19:20:19,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7122 to 4964. [2022-03-15 19:20:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4964 states, 4963 states have (on average 3.2738263147289945) internal successors, (16248), 4963 states have internal predecessors, (16248), 0 states have call successors, (0), 0 states have 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:20:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4964 states to 4964 states and 16248 transitions. [2022-03-15 19:20:19,691 INFO L78 Accepts]: Start accepts. Automaton has 4964 states and 16248 transitions. Word has length 24 [2022-03-15 19:20:19,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:19,691 INFO L470 AbstractCegarLoop]: Abstraction has 4964 states and 16248 transitions. [2022-03-15 19:20:19,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.5) internal successors, (110), 44 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:19,692 INFO L276 IsEmpty]: Start isEmpty. Operand 4964 states and 16248 transitions. [2022-03-15 19:20:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:20:19,701 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:19,701 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:20:19,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-03-15 19:20:19,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-03-15 19:20:19,903 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:20:19,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:19,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2061498754, now seen corresponding path program 46 times [2022-03-15 19:20:19,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:19,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299989894] [2022-03-15 19:20:19,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:19,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:20,001 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:20,001 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:20,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299989894] [2022-03-15 19:20:20,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299989894] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:20,002 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998651528] [2022-03-15 19:20:20,002 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:20:20,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:20,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:20,004 INFO L229 MonitoredProcess]: Starting monitored process 49 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:20:20,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 19:20:20,076 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:20:20,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:20:20,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:20:20,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:20,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:20,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998651528] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:20,277 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:20,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 12] total 24 [2022-03-15 19:20:20,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1070961983] [2022-03-15 19:20:20,277 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:20,279 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:20,285 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 108 transitions. [2022-03-15 19:20:20,286 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:21,124 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [265706#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 265686#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 265688#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 265708#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1)), 265693#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 265696#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 265700#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 6 ~N~0) (<= ~N~0 4)), 265689#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 265684#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 265697#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 265685#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 265687#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 265701#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 265691#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 265699#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 5) (< 6 ~N~0)), 265705#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 265698#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 265690#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 265694#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 265707#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 265704#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 265702#(or (<= 6 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 4) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 265703#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 265695#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 265692#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)))] [2022-03-15 19:20:21,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 19:20:21,125 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:21,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 19:20:21,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=1980, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:20:21,125 INFO L87 Difference]: Start difference. First operand 4964 states and 16248 transitions. Second operand has 38 states, 38 states have (on average 2.5) internal successors, (95), 38 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:22,657 INFO L93 Difference]: Finished difference Result 6484 states and 20395 transitions. [2022-03-15 19:20:22,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 19:20:22,657 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 38 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:20:22,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:22,668 INFO L225 Difference]: With dead ends: 6484 [2022-03-15 19:20:22,668 INFO L226 Difference]: Without dead ends: 6460 [2022-03-15 19:20:22,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2065 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1387, Invalid=5585, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 19:20:22,669 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 355 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:22,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 25 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:20:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2022-03-15 19:20:22,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 5596. [2022-03-15 19:20:22,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5596 states, 5595 states have (on average 3.294012511170688) internal successors, (18430), 5595 states have internal predecessors, (18430), 0 states have call successors, (0), 0 states have 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:20:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 18430 transitions. [2022-03-15 19:20:22,812 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 18430 transitions. Word has length 24 [2022-03-15 19:20:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:22,812 INFO L470 AbstractCegarLoop]: Abstraction has 5596 states and 18430 transitions. [2022-03-15 19:20:22,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 38 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 18430 transitions. [2022-03-15 19:20:22,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:20:22,821 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:22,821 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:20:22,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-15 19:20:23,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-03-15 19:20:23,035 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:20:23,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:23,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1687735636, now seen corresponding path program 47 times [2022-03-15 19:20:23,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:23,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395830494] [2022-03-15 19:20:23,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:23,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:23,110 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:23,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:23,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395830494] [2022-03-15 19:20:23,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395830494] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:23,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082012958] [2022-03-15 19:20:23,110 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:20:23,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:23,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:23,111 INFO L229 MonitoredProcess]: Starting monitored process 50 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:20:23,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-15 19:20:23,188 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:20:23,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:20:23,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:20:23,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:23,338 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:23,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:23,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082012958] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:23,378 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:23,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 25 [2022-03-15 19:20:23,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2129430768] [2022-03-15 19:20:23,378 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:23,380 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:23,386 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 117 transitions. [2022-03-15 19:20:23,386 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:24,380 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [283660#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 283663#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 283675#(or (<= 6 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 4) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 283679#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 283666#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 283656#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 283657#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 283661#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 283677#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 283674#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 283659#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 283653#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 283655#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 283662#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 283667#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 283673#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 6 ~N~0) (<= ~N~0 4)), 283654#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 283670#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 283668#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 283676#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 283669#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 5) (< 6 ~N~0)), 283658#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 283671#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 283678#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 283664#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 283665#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 283672#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1))] [2022-03-15 19:20:24,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:20:24,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:24,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:20:24,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=2251, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:20:24,381 INFO L87 Difference]: Start difference. First operand 5596 states and 18430 transitions. Second operand has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 41 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:25,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:25,978 INFO L93 Difference]: Finished difference Result 6354 states and 19943 transitions. [2022-03-15 19:20:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 19:20:25,978 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 41 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:20:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:25,989 INFO L225 Difference]: With dead ends: 6354 [2022-03-15 19:20:25,989 INFO L226 Difference]: Without dead ends: 6318 [2022-03-15 19:20:25,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1627, Invalid=6383, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 19:20:25,990 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 301 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:25,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 23 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:20:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6318 states. [2022-03-15 19:20:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6318 to 4484. [2022-03-15 19:20:26,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4484 states, 4483 states have (on average 3.2745929065358017) internal successors, (14680), 4483 states have internal predecessors, (14680), 0 states have call successors, (0), 0 states have 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:20:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 14680 transitions. [2022-03-15 19:20:26,078 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 14680 transitions. Word has length 24 [2022-03-15 19:20:26,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:26,078 INFO L470 AbstractCegarLoop]: Abstraction has 4484 states and 14680 transitions. [2022-03-15 19:20:26,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 41 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:26,078 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 14680 transitions. [2022-03-15 19:20:26,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:20:26,084 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:26,084 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:20:26,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-03-15 19:20:26,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:26,285 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:20:26,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:26,285 INFO L85 PathProgramCache]: Analyzing trace with hash 205060674, now seen corresponding path program 48 times [2022-03-15 19:20:26,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:26,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255829204] [2022-03-15 19:20:26,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:26,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:26,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:26,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255829204] [2022-03-15 19:20:26,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255829204] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:26,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421632942] [2022-03-15 19:20:26,397 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:20:26,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:26,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:26,399 INFO L229 MonitoredProcess]: Starting monitored process 51 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:20:26,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-15 19:20:26,495 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:20:26,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:20:26,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:20:26,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:26,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:26,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421632942] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:26,768 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:26,768 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 13] total 28 [2022-03-15 19:20:26,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1920461953] [2022-03-15 19:20:26,768 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:26,770 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:26,777 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 117 transitions. [2022-03-15 19:20:26,777 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:27,699 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [299300#(or (<= 6 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 4) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 299296#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 299295#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 299306#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 299283#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 299301#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 5) (< 6 ~N~0)), 299285#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 299289#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 299288#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 299302#(<= 1 thread1Thread1of1ForFork1_~i~0), 299291#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 299293#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 299294#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 299298#(or (<= 6 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 299282#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 299286#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 299284#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 299299#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 299297#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 299292#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 299287#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 299305#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 299303#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 299304#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 299290#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)))] [2022-03-15 19:20:27,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 19:20:27,699 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:27,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 19:20:27,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=2341, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:20:27,700 INFO L87 Difference]: Start difference. First operand 4484 states and 14680 transitions. Second operand has 40 states, 40 states have (on average 2.475) internal successors, (99), 40 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:29,123 INFO L93 Difference]: Finished difference Result 7192 states and 22317 transitions. [2022-03-15 19:20:29,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 19:20:29,124 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.475) internal successors, (99), 40 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:20:29,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:29,136 INFO L225 Difference]: With dead ends: 7192 [2022-03-15 19:20:29,136 INFO L226 Difference]: Without dead ends: 7084 [2022-03-15 19:20:29,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2406 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1552, Invalid=6280, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 19:20:29,137 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 273 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:29,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 18 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:20:29,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7084 states. [2022-03-15 19:20:29,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7084 to 3942. [2022-03-15 19:20:29,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 3941 states have (on average 3.241816797767064) internal successors, (12776), 3941 states have internal predecessors, (12776), 0 states have call successors, (0), 0 states have 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:20:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 12776 transitions. [2022-03-15 19:20:29,210 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 12776 transitions. Word has length 24 [2022-03-15 19:20:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:29,210 INFO L470 AbstractCegarLoop]: Abstraction has 3942 states and 12776 transitions. [2022-03-15 19:20:29,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.475) internal successors, (99), 40 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 12776 transitions. [2022-03-15 19:20:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:20:29,216 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:29,216 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:20:29,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-03-15 19:20:29,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-03-15 19:20:29,416 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:20:29,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:29,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2132738354, now seen corresponding path program 49 times [2022-03-15 19:20:29,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:29,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245629414] [2022-03-15 19:20:29,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:29,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:29,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:29,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245629414] [2022-03-15 19:20:29,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245629414] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:29,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055532665] [2022-03-15 19:20:29,521 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:20:29,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:29,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:29,523 INFO L229 MonitoredProcess]: Starting monitored process 52 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:20:29,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-15 19:20:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:29,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 19:20:29,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:29,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:29,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055532665] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:29,725 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:29,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-03-15 19:20:29,726 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1479461940] [2022-03-15 19:20:29,726 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:29,727 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:29,739 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 196 transitions. [2022-03-15 19:20:29,739 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:30,671 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [314645#(or (<= ~counter~0 1) (= ~counter~0 2)), 314647#(or (= ~counter~0 4) (<= ~counter~0 3)), 314648#(or (= ~counter~0 5) (<= ~counter~0 4)), 314646#(or (= ~counter~0 3) (<= ~counter~0 2)), 314644#(or (<= ~counter~0 0) (= ~counter~0 1)), 314650#(or (= ~counter~0 0) (<= (+ ~counter~0 1) 0)), 314649#(or (<= ~counter~0 5) (= ~counter~0 6))] [2022-03-15 19:20:30,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:20:30,672 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:30,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:20:30,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:20:30,672 INFO L87 Difference]: Start difference. First operand 3942 states and 12776 transitions. Second operand has 16 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have 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:20:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:30,891 INFO L93 Difference]: Finished difference Result 5491 states and 17947 transitions. [2022-03-15 19:20:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:20:30,891 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 0 states have call successors, (0), 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:20:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:30,901 INFO L225 Difference]: With dead ends: 5491 [2022-03-15 19:20:30,901 INFO L226 Difference]: Without dead ends: 5452 [2022-03-15 19:20:30,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 103 SyntacticMatches, 22 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:20:30,901 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 96 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:30,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 51 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:20:30,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2022-03-15 19:20:30,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 5262. [2022-03-15 19:20:30,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5262 states, 5261 states have (on average 3.298992586960654) internal successors, (17356), 5261 states have internal predecessors, (17356), 0 states have call successors, (0), 0 states have 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:20:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5262 states to 5262 states and 17356 transitions. [2022-03-15 19:20:30,994 INFO L78 Accepts]: Start accepts. Automaton has 5262 states and 17356 transitions. Word has length 25 [2022-03-15 19:20:30,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:30,994 INFO L470 AbstractCegarLoop]: Abstraction has 5262 states and 17356 transitions. [2022-03-15 19:20:30,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have 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:20:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 5262 states and 17356 transitions. [2022-03-15 19:20:31,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:20:31,004 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:31,004 INFO L514 BasicCegarLoop]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:20:31,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-03-15 19:20:31,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:31,207 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:20:31,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:31,208 INFO L85 PathProgramCache]: Analyzing trace with hash 904542871, now seen corresponding path program 50 times [2022-03-15 19:20:31,209 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:31,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729001583] [2022-03-15 19:20:31,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:31,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:31,311 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:31,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:31,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729001583] [2022-03-15 19:20:31,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729001583] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:31,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905901665] [2022-03-15 19:20:31,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:20:31,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:31,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:31,313 INFO L229 MonitoredProcess]: Starting monitored process 53 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:20:31,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-15 19:20:31,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:20:31,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:20:31,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:20:31,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:31,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:31,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905901665] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:31,593 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:31,593 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 25 [2022-03-15 19:20:31,593 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1474960707] [2022-03-15 19:20:31,593 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:31,595 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:31,603 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 130 transitions. [2022-03-15 19:20:31,603 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:32,366 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [330848#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 330862#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 330846#(or (<= ~N~0 4) (<= 2 thread1Thread1of1ForFork1_~i~0)), 330840#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 4)), 330835#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) thread1Thread1of1ForFork1_~i~0)), 330856#(or (<= ~N~0 4) (<= 0 thread1Thread1of1ForFork1_~i~0)), 330852#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 330842#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) thread1Thread1of1ForFork1_~i~0)), 330838#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) thread1Thread1of1ForFork1_~i~0)), 330841#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) thread1Thread1of1ForFork1_~i~0)), 330859#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 330850#(or (<= |thread2Thread1of1ForFork0_~i~1#1| thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 330839#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 330860#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 330854#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 330864#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0) (<= (+ ~N~0 1) thread1Thread1of1ForFork1_~i~0)), 330845#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 4)), 330853#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 330858#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 330836#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) thread1Thread1of1ForFork1_~i~0)), 330837#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 330851#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)))), 330863#(or (<= ~N~0 4) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 330847#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 330857#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 330849#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) thread1Thread1of1ForFork1_~i~0)), 330843#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) thread1Thread1of1ForFork1_~i~0)), 330855#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 4)), 330861#(< |thread2Thread1of1ForFork0_~i~1#1| ~N~0), 330844#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 4))] [2022-03-15 19:20:32,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 19:20:32,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:32,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 19:20:32,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=665, Invalid=2305, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:20:32,367 INFO L87 Difference]: Start difference. First operand 5262 states and 17356 transitions. Second operand has 46 states, 46 states have (on average 2.369565217391304) internal successors, (109), 46 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have 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:20:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:34,798 INFO L93 Difference]: Finished difference Result 6780 states and 21733 transitions. [2022-03-15 19:20:34,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-03-15 19:20:34,798 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.369565217391304) internal successors, (109), 46 states have internal predecessors, (109), 0 states have call successors, (0), 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:20:34,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:34,810 INFO L225 Difference]: With dead ends: 6780 [2022-03-15 19:20:34,810 INFO L226 Difference]: Without dead ends: 6770 [2022-03-15 19:20:34,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7329 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=6089, Invalid=17473, Unknown=0, NotChecked=0, Total=23562 [2022-03-15 19:20:34,813 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 262 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:34,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 35 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:20:34,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6770 states. [2022-03-15 19:20:34,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6770 to 4772. [2022-03-15 19:20:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4772 states, 4771 states have (on average 3.280025151959757) internal successors, (15649), 4771 states have internal predecessors, (15649), 0 states have call successors, (0), 0 states have 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:20:34,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4772 states to 4772 states and 15649 transitions. [2022-03-15 19:20:34,900 INFO L78 Accepts]: Start accepts. Automaton has 4772 states and 15649 transitions. Word has length 25 [2022-03-15 19:20:34,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:34,900 INFO L470 AbstractCegarLoop]: Abstraction has 4772 states and 15649 transitions. [2022-03-15 19:20:34,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.369565217391304) internal successors, (109), 46 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have 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:20:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4772 states and 15649 transitions. [2022-03-15 19:20:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:20:34,906 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:34,906 INFO L514 BasicCegarLoop]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:20:34,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-03-15 19:20:35,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-03-15 19:20:35,107 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:20:35,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:35,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1755218931, now seen corresponding path program 51 times [2022-03-15 19:20:35,108 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:35,108 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692253897] [2022-03-15 19:20:35,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:35,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:35,235 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:35,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692253897] [2022-03-15 19:20:35,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692253897] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:35,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510595674] [2022-03-15 19:20:35,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:20:35,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:35,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:35,236 INFO L229 MonitoredProcess]: Starting monitored process 54 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:20:35,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-03-15 19:20:35,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:20:35,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:20:35,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 19:20:35,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:35,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:35,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510595674] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:35,635 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:35,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 39 [2022-03-15 19:20:35,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2019203265] [2022-03-15 19:20:35,635 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:35,637 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:35,670 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 196 transitions. [2022-03-15 19:20:35,670 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:37,358 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [347681#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 347707#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 347677#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 347693#(or (<= 7 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 347672#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0)), 347709#(<= 1 thread1Thread1of1ForFork1_~i~0), 347694#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 4)), 347675#(<= 7 ~N~0), 347703#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 347692#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 4) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 347689#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 347671#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 347698#(<= 4 thread1Thread1of1ForFork1_~i~0), 347702#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 347683#(or (<= 7 ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 4)), 347684#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 347678#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 347691#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 347687#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 347705#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 347680#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 347701#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 347673#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 347669#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 347706#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 347676#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 347682#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 347695#(or (<= 7 ~N~0) (<= ~N~0 4) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 347708#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 4)), 347699#(<= 3 thread1Thread1of1ForFork1_~i~0), 347700#(<= 2 thread1Thread1of1ForFork1_~i~0), 347688#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 347690#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 347679#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 347697#(<= 5 thread1Thread1of1ForFork1_~i~0), 347674#(or (<= 7 ~N~0) (<= ~N~0 4)), 347670#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 347704#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 347686#(<= 6 thread1Thread1of1ForFork1_~i~0), 347696#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 4) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 347685#(or (<= 7 ~N~0) (<= ~N~0 4) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))] [2022-03-15 19:20:37,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-15 19:20:37,359 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:37,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-15 19:20:37,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=930, Invalid=5390, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 19:20:37,360 INFO L87 Difference]: Start difference. First operand 4772 states and 15649 transitions. Second operand has 57 states, 57 states have (on average 2.754385964912281) internal successors, (157), 57 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have 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:20:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:46,647 INFO L93 Difference]: Finished difference Result 7766 states and 24426 transitions. [2022-03-15 19:20:46,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2022-03-15 19:20:46,648 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.754385964912281) internal successors, (157), 57 states have internal predecessors, (157), 0 states have call successors, (0), 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:20:46,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:46,660 INFO L225 Difference]: With dead ends: 7766 [2022-03-15 19:20:46,661 INFO L226 Difference]: Without dead ends: 7764 [2022-03-15 19:20:46,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 226 SyntacticMatches, 1 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18866 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=9999, Invalid=48807, Unknown=0, NotChecked=0, Total=58806 [2022-03-15 19:20:46,664 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 538 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 3303 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 3639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 3303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:46,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [538 Valid, 55 Invalid, 3639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 3303 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:20:46,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7764 states. [2022-03-15 19:20:46,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7764 to 4730. [2022-03-15 19:20:46,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4730 states, 4729 states have (on average 3.283569465003172) internal successors, (15528), 4729 states have internal predecessors, (15528), 0 states have call successors, (0), 0 states have 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:20:46,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4730 states to 4730 states and 15528 transitions. [2022-03-15 19:20:46,748 INFO L78 Accepts]: Start accepts. Automaton has 4730 states and 15528 transitions. Word has length 25 [2022-03-15 19:20:46,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:46,749 INFO L470 AbstractCegarLoop]: Abstraction has 4730 states and 15528 transitions. [2022-03-15 19:20:46,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.754385964912281) internal successors, (157), 57 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have 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:20:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4730 states and 15528 transitions. [2022-03-15 19:20:46,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:20:46,756 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:46,757 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:20:46,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-03-15 19:20:46,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-03-15 19:20:46,959 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:20:46,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:46,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2021106627, now seen corresponding path program 52 times [2022-03-15 19:20:46,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:46,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565936332] [2022-03-15 19:20:46,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:46,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:47,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:47,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565936332] [2022-03-15 19:20:47,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565936332] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:47,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414006182] [2022-03-15 19:20:47,076 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:20:47,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:47,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:47,078 INFO L229 MonitoredProcess]: Starting monitored process 55 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:20:47,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-03-15 19:20:47,164 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:20:47,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:20:47,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:20:47,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:47,296 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:47,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:47,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414006182] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:47,348 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:47,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2022-03-15 19:20:47,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1799788025] [2022-03-15 19:20:47,349 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:47,350 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:47,362 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 208 transitions. [2022-03-15 19:20:47,362 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:49,630 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 53 new interpolants: [365606#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 365637#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 365615#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 365653#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 365620#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 365640#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 365622#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 365602#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 365634#(and (or (<= 7 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 365652#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 365608#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 365611#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 365610#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 365632#(or (<= 7 ~N~0) (<= ~N~0 5) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 365644#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0))), 365629#(and (or (<= 7 ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 365628#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 365614#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 365636#(or (<= 7 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 365625#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 365621#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 365639#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 5)), 365650#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 365607#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 365651#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 365603#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 365616#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 365613#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 365627#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 365626#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 365645#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0))), 365641#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 365648#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 6) (< 7 ~N~0)), 365635#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0))), 365618#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 365601#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 365630#(or (<= 7 ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 5)), 365646#(and (or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0))), 365623#(or (<= 7 ~N~0) (<= ~N~0 5)), 365647#(and (or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))) (or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 365604#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 365609#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 365631#(or (<= 7 ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 365619#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 365649#(or (<= 7 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 365605#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 365642#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 365624#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 365633#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 5)), 365617#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 365638#(or (<= 7 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 365643#(and (or (<= 7 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0))), 365612#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)))] [2022-03-15 19:20:49,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-03-15 19:20:49,630 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:49,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-03-15 19:20:49,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=786, Invalid=5376, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 19:20:49,632 INFO L87 Difference]: Start difference. First operand 4730 states and 15528 transitions. Second operand has 70 states, 70 states have (on average 2.5428571428571427) internal successors, (178), 70 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:21:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:02,580 INFO L93 Difference]: Finished difference Result 7918 states and 25162 transitions. [2022-03-15 19:21:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2022-03-15 19:21:02,581 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.5428571428571427) internal successors, (178), 70 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 26 [2022-03-15 19:21:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:02,594 INFO L225 Difference]: With dead ends: 7918 [2022-03-15 19:21:02,594 INFO L226 Difference]: Without dead ends: 7918 [2022-03-15 19:21:02,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 250 SyntacticMatches, 2 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21164 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=10625, Invalid=55681, Unknown=0, NotChecked=0, Total=66306 [2022-03-15 19:21:02,597 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 941 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 3752 mSolverCounterSat, 628 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 4380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 3752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:02,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [941 Valid, 76 Invalid, 4380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 3752 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 19:21:02,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7918 states. [2022-03-15 19:21:02,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7918 to 5146. [2022-03-15 19:21:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5146 states, 5145 states have (on average 3.2946550048590866) internal successors, (16951), 5145 states have internal predecessors, (16951), 0 states have call successors, (0), 0 states have 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:21:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5146 states to 5146 states and 16951 transitions. [2022-03-15 19:21:02,689 INFO L78 Accepts]: Start accepts. Automaton has 5146 states and 16951 transitions. Word has length 26 [2022-03-15 19:21:02,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:02,689 INFO L470 AbstractCegarLoop]: Abstraction has 5146 states and 16951 transitions. [2022-03-15 19:21:02,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 2.5428571428571427) internal successors, (178), 70 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:21:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 5146 states and 16951 transitions. [2022-03-15 19:21:02,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:02,724 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:02,724 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:21:02,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-03-15 19:21:02,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:02,932 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:21:02,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:02,932 INFO L85 PathProgramCache]: Analyzing trace with hash -165569149, now seen corresponding path program 53 times [2022-03-15 19:21:02,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:02,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713761294] [2022-03-15 19:21:02,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:02,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:03,048 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:03,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713761294] [2022-03-15 19:21:03,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713761294] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:03,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178147813] [2022-03-15 19:21:03,048 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:21:03,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:03,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:03,049 INFO L229 MonitoredProcess]: Starting monitored process 56 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:21:03,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-03-15 19:21:03,155 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:21:03,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:03,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:21:03,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:03,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:03,384 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:03,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178147813] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:03,384 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:03,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2022-03-15 19:21:03,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [180458345] [2022-03-15 19:21:03,385 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:03,387 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:03,398 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 137 transitions. [2022-03-15 19:21:03,398 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:04,692 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [384598#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 384582#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 384592#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0))), 384593#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 384594#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 384591#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 384581#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 384596#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 384606#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 384600#(or (<= 7 ~N~0) (<= ~N~0 5) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 384604#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 384609#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 384586#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 384612#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 384579#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 384587#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 384588#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 384611#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 384583#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 384602#(or (<= 7 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 384584#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 384590#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 384614#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 384580#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 384608#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 5)), 384603#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 5)), 384597#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 384599#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 384595#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 384585#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 384605#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 384610#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0)), 384578#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 384601#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 5)), 384613#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))), 384589#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 384607#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0))] [2022-03-15 19:21:04,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 19:21:04,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:04,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 19:21:04,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=3305, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:21:04,693 INFO L87 Difference]: Start difference. First operand 5146 states and 16951 transitions. Second operand has 54 states, 54 states have (on average 2.314814814814815) internal successors, (125), 54 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have 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:21:12,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:12,130 INFO L93 Difference]: Finished difference Result 8228 states and 25342 transitions. [2022-03-15 19:21:12,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2022-03-15 19:21:12,130 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.314814814814815) internal successors, (125), 54 states have internal predecessors, (125), 0 states have call successors, (0), 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:21:12,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:12,145 INFO L225 Difference]: With dead ends: 8228 [2022-03-15 19:21:12,145 INFO L226 Difference]: Without dead ends: 8224 [2022-03-15 19:21:12,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16628 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=11618, Invalid=40594, Unknown=0, NotChecked=0, Total=52212 [2022-03-15 19:21:12,149 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 529 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 3556 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 4019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 3556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:12,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [529 Valid, 57 Invalid, 4019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 3556 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:21:12,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8224 states. [2022-03-15 19:21:12,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8224 to 6354. [2022-03-15 19:21:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6354 states, 6353 states have (on average 3.330237682984417) internal successors, (21157), 6353 states have internal predecessors, (21157), 0 states have call successors, (0), 0 states have 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:21:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6354 states to 6354 states and 21157 transitions. [2022-03-15 19:21:12,295 INFO L78 Accepts]: Start accepts. Automaton has 6354 states and 21157 transitions. Word has length 26 [2022-03-15 19:21:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:12,296 INFO L470 AbstractCegarLoop]: Abstraction has 6354 states and 21157 transitions. [2022-03-15 19:21:12,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.314814814814815) internal successors, (125), 54 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have 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:21:12,296 INFO L276 IsEmpty]: Start isEmpty. Operand 6354 states and 21157 transitions. [2022-03-15 19:21:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:12,306 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:12,306 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:21:12,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-03-15 19:21:12,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:12,519 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:21:12,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:12,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1452874029, now seen corresponding path program 54 times [2022-03-15 19:21:12,521 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:12,521 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904042726] [2022-03-15 19:21:12,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:12,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:12,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:12,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904042726] [2022-03-15 19:21:12,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904042726] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:12,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256547697] [2022-03-15 19:21:12,639 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:21:12,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:12,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:12,644 INFO L229 MonitoredProcess]: Starting monitored process 57 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:21:12,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-03-15 19:21:12,748 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:21:12,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:12,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:21:12,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:12,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:12,957 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:12,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256547697] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:12,957 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:12,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2022-03-15 19:21:12,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [43917003] [2022-03-15 19:21:12,958 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:12,959 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:12,968 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 141 transitions. [2022-03-15 19:21:12,968 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:14,269 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [406234#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 406239#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 406236#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0))), 406225#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 406224#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 406232#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 406223#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 406251#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 406249#(or (<= 7 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 406230#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 406259#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 406231#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 406256#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 406235#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 406246#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 5)), 406245#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 406229#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 406240#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 406243#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 406233#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 406237#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 406257#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 406254#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 406255#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0)), 406244#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 406248#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 5)), 406227#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 406238#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 406247#(or (<= 7 ~N~0) (<= ~N~0 5) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 406258#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))), 406226#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 406253#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 406242#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 406250#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 5)), 406228#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 406252#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 406241#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)))] [2022-03-15 19:21:14,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 19:21:14,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:14,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 19:21:14,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=680, Invalid=3352, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:21:14,271 INFO L87 Difference]: Start difference. First operand 6354 states and 21157 transitions. Second operand has 54 states, 54 states have (on average 2.3333333333333335) internal successors, (126), 54 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:21:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:23,101 INFO L93 Difference]: Finished difference Result 9446 states and 29134 transitions. [2022-03-15 19:21:23,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2022-03-15 19:21:23,101 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.3333333333333335) internal successors, (126), 54 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:21:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:23,118 INFO L225 Difference]: With dead ends: 9446 [2022-03-15 19:21:23,119 INFO L226 Difference]: Without dead ends: 9428 [2022-03-15 19:21:23,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21777 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=12855, Invalid=51407, Unknown=0, NotChecked=0, Total=64262 [2022-03-15 19:21:23,122 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 620 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 3754 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 4239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 3754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:23,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [620 Valid, 46 Invalid, 4239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 3754 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:21:23,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9428 states. [2022-03-15 19:21:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9428 to 6786. [2022-03-15 19:21:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6786 states, 6785 states have (on average 3.334856300663228) internal successors, (22627), 6785 states have internal predecessors, (22627), 0 states have call successors, (0), 0 states have 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:21:23,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6786 states to 6786 states and 22627 transitions. [2022-03-15 19:21:23,235 INFO L78 Accepts]: Start accepts. Automaton has 6786 states and 22627 transitions. Word has length 26 [2022-03-15 19:21:23,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:23,235 INFO L470 AbstractCegarLoop]: Abstraction has 6786 states and 22627 transitions. [2022-03-15 19:21:23,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.3333333333333335) internal successors, (126), 54 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:21:23,236 INFO L276 IsEmpty]: Start isEmpty. Operand 6786 states and 22627 transitions. [2022-03-15 19:21:23,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:23,249 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:23,249 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:21:23,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-03-15 19:21:23,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:23,472 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:21:23,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:23,472 INFO L85 PathProgramCache]: Analyzing trace with hash 85004995, now seen corresponding path program 55 times [2022-03-15 19:21:23,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:23,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222636980] [2022-03-15 19:21:23,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:23,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:23,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:23,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222636980] [2022-03-15 19:21:23,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222636980] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:23,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60583715] [2022-03-15 19:21:23,628 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:21:23,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:23,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:23,629 INFO L229 MonitoredProcess]: Starting monitored process 58 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:21:23,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-03-15 19:21:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:23,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:21:23,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:23,907 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:23,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:23,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60583715] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:23,971 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:23,971 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2022-03-15 19:21:23,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [164409671] [2022-03-15 19:21:23,972 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:23,974 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:23,986 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 150 transitions. [2022-03-15 19:21:23,986 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:25,400 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 39 new interpolants: [430054#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 430030#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 430047#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 5)), 430056#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))), 430062#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 5)), 430026#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 430053#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0)), 430032#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 430043#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 430060#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 430051#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 430033#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 430045#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 430031#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 430042#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0))), 430048#(or (<= 7 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 430041#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 430052#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 430027#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 430061#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 430063#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 430025#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 430028#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 430029#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 430059#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 430050#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 430046#(or (<= 7 ~N~0) (<= ~N~0 5) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 430057#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 430058#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 430039#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 430055#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 430036#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 430038#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 430044#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 430035#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 430049#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 5)), 430040#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 430034#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 430037#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0))] [2022-03-15 19:21:25,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-15 19:21:25,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:25,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-15 19:21:25,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=661, Invalid=3629, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 19:21:25,401 INFO L87 Difference]: Start difference. First operand 6786 states and 22627 transitions. Second operand has 56 states, 56 states have (on average 2.375) internal successors, (133), 56 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have 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:21:34,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:34,705 INFO L93 Difference]: Finished difference Result 9958 states and 30804 transitions. [2022-03-15 19:21:34,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2022-03-15 19:21:34,706 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.375) internal successors, (133), 56 states have internal predecessors, (133), 0 states have call successors, (0), 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:21:34,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:34,723 INFO L225 Difference]: With dead ends: 9958 [2022-03-15 19:21:34,723 INFO L226 Difference]: Without dead ends: 9916 [2022-03-15 19:21:34,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22163 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12820, Invalid=53486, Unknown=0, NotChecked=0, Total=66306 [2022-03-15 19:21:34,727 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 620 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 4083 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 4569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 4083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:34,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [620 Valid, 45 Invalid, 4569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 4083 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 19:21:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9916 states. [2022-03-15 19:21:34,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9916 to 6900. [2022-03-15 19:21:34,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6900 states, 6899 states have (on average 3.330917524278881) internal successors, (22980), 6899 states have internal predecessors, (22980), 0 states have call successors, (0), 0 states have 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:21:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6900 states to 6900 states and 22980 transitions. [2022-03-15 19:21:34,873 INFO L78 Accepts]: Start accepts. Automaton has 6900 states and 22980 transitions. Word has length 26 [2022-03-15 19:21:34,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:34,873 INFO L470 AbstractCegarLoop]: Abstraction has 6900 states and 22980 transitions. [2022-03-15 19:21:34,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.375) internal successors, (133), 56 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have 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:21:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 6900 states and 22980 transitions. [2022-03-15 19:21:34,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:34,886 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:34,886 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:21:34,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-03-15 19:21:35,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-03-15 19:21:35,108 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:21:35,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:35,108 INFO L85 PathProgramCache]: Analyzing trace with hash 630737901, now seen corresponding path program 56 times [2022-03-15 19:21:35,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:35,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508247723] [2022-03-15 19:21:35,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:35,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:35,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:35,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508247723] [2022-03-15 19:21:35,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508247723] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:35,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518331431] [2022-03-15 19:21:35,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:21:35,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:35,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:35,224 INFO L229 MonitoredProcess]: Starting monitored process 59 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:21:35,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-03-15 19:21:35,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:21:35,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:35,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:21:35,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:35,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:35,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518331431] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:35,506 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:35,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2022-03-15 19:21:35,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1847604680] [2022-03-15 19:21:35,506 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:35,509 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:35,521 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 159 transitions. [2022-03-15 19:21:35,521 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:37,042 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [454575#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 454607#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))), 454581#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 454598#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 454595#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 5)), 454593#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 454609#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 454602#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 454589#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 454604#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 454590#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 454578#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 454586#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 454614#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 454613#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 5)), 454584#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 454600#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 454597#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 5)), 454612#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 454583#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 454596#(or (<= 7 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 454605#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 454615#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 454594#(or (<= 7 ~N~0) (<= ~N~0 5) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 454611#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 454601#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 454592#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0))), 454610#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 454576#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 454585#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 454599#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0)), 454591#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 454588#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 454582#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 454603#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 454606#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 454580#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 454577#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 454579#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 454587#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 454608#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0))] [2022-03-15 19:21:37,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 19:21:37,042 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:37,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 19:21:37,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=656, Invalid=3900, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 19:21:37,043 INFO L87 Difference]: Start difference. First operand 6900 states and 22980 transitions. Second operand has 58 states, 58 states have (on average 2.413793103448276) internal successors, (140), 58 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have 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:21:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:46,319 INFO L93 Difference]: Finished difference Result 10052 states and 31410 transitions. [2022-03-15 19:21:46,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2022-03-15 19:21:46,320 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.413793103448276) internal successors, (140), 58 states have internal predecessors, (140), 0 states have call successors, (0), 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:21:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:46,336 INFO L225 Difference]: With dead ends: 10052 [2022-03-15 19:21:46,336 INFO L226 Difference]: Without dead ends: 9982 [2022-03-15 19:21:46,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20873 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11989, Invalid=51767, Unknown=0, NotChecked=0, Total=63756 [2022-03-15 19:21:46,339 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 620 mSDsluCounter, 1691 mSDsCounter, 0 mSdLazyCounter, 4109 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 4563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 4109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:46,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [620 Valid, 47 Invalid, 4563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 4109 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 19:21:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9982 states. [2022-03-15 19:21:46,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9982 to 6966. [2022-03-15 19:21:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6966 states, 6965 states have (on average 3.321464465183058) internal successors, (23134), 6965 states have internal predecessors, (23134), 0 states have call successors, (0), 0 states have 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:21:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6966 states to 6966 states and 23134 transitions. [2022-03-15 19:21:46,489 INFO L78 Accepts]: Start accepts. Automaton has 6966 states and 23134 transitions. Word has length 26 [2022-03-15 19:21:46,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:46,489 INFO L470 AbstractCegarLoop]: Abstraction has 6966 states and 23134 transitions. [2022-03-15 19:21:46,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.413793103448276) internal successors, (140), 58 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have 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:21:46,490 INFO L276 IsEmpty]: Start isEmpty. Operand 6966 states and 23134 transitions. [2022-03-15 19:21:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:46,500 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:46,500 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:21:46,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-03-15 19:21:46,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-03-15 19:21:46,700 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:21:46,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:46,701 INFO L85 PathProgramCache]: Analyzing trace with hash 368588803, now seen corresponding path program 57 times [2022-03-15 19:21:46,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:46,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905746694] [2022-03-15 19:21:46,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:46,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:46,812 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:46,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:46,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905746694] [2022-03-15 19:21:46,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905746694] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:46,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694376328] [2022-03-15 19:21:46,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:21:46,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:46,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:46,814 INFO L229 MonitoredProcess]: Starting monitored process 60 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:21:46,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-03-15 19:21:46,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:21:46,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:46,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:21:46,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:47,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:47,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694376328] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:47,091 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:47,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2022-03-15 19:21:47,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1806688798] [2022-03-15 19:21:47,091 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:47,093 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:47,103 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 168 transitions. [2022-03-15 19:21:47,103 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:48,783 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [479347#(or (<= 7 ~N~0) (<= ~N~0 5) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 479372#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 479365#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 479348#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 5)), 479368#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0)), 479360#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 479357#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 479362#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 479339#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 479369#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 479364#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 479335#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 479337#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 479346#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 479359#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 479371#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))), 479352#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 479373#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 479370#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 479340#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 479361#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 479353#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0))), 479336#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 479363#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 479349#(or (<= 7 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 479350#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 479356#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 479332#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 479354#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 479367#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 479355#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 479374#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 479342#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 479333#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 479341#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 479343#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 479334#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 479344#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 479358#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 479338#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 479366#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 5)), 479345#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 479351#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 5))] [2022-03-15 19:21:48,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 19:21:48,783 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:48,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 19:21:48,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=665, Invalid=4165, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 19:21:48,784 INFO L87 Difference]: Start difference. First operand 6966 states and 23134 transitions. Second operand has 60 states, 60 states have (on average 2.45) internal successors, (147), 60 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have 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:21:57,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:57,258 INFO L93 Difference]: Finished difference Result 10434 states and 32833 transitions. [2022-03-15 19:21:57,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2022-03-15 19:21:57,259 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.45) internal successors, (147), 60 states have internal predecessors, (147), 0 states have call successors, (0), 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:21:57,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:57,277 INFO L225 Difference]: With dead ends: 10434 [2022-03-15 19:21:57,277 INFO L226 Difference]: Without dead ends: 10308 [2022-03-15 19:21:57,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17938 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10576, Invalid=45830, Unknown=0, NotChecked=0, Total=56406 [2022-03-15 19:21:57,280 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 551 mSDsluCounter, 1670 mSDsCounter, 0 mSdLazyCounter, 3853 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 4200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 3853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:57,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 55 Invalid, 4200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 3853 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:21:57,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10308 states. [2022-03-15 19:21:57,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10308 to 7270. [2022-03-15 19:21:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7270 states, 7269 states have (on average 3.3147613151740267) internal successors, (24095), 7269 states have internal predecessors, (24095), 0 states have call successors, (0), 0 states have 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:21:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7270 states to 7270 states and 24095 transitions. [2022-03-15 19:21:57,419 INFO L78 Accepts]: Start accepts. Automaton has 7270 states and 24095 transitions. Word has length 26 [2022-03-15 19:21:57,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:57,420 INFO L470 AbstractCegarLoop]: Abstraction has 7270 states and 24095 transitions. [2022-03-15 19:21:57,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.45) internal successors, (147), 60 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have 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:21:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand 7270 states and 24095 transitions. [2022-03-15 19:21:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:57,430 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:57,430 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:21:57,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2022-03-15 19:21:57,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:57,630 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:21:57,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:57,631 INFO L85 PathProgramCache]: Analyzing trace with hash 831901357, now seen corresponding path program 58 times [2022-03-15 19:21:57,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:57,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710416396] [2022-03-15 19:21:57,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:57,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:57,748 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:57,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710416396] [2022-03-15 19:21:57,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710416396] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:57,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097906480] [2022-03-15 19:21:57,749 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:21:57,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:57,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:57,750 INFO L229 MonitoredProcess]: Starting monitored process 61 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:21:57,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-03-15 19:21:57,849 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:21:57,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:57,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:21:57,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:58,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:58,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097906480] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:58,082 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:58,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2022-03-15 19:21:58,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [825141959] [2022-03-15 19:21:58,083 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:58,085 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:58,098 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 177 transitions. [2022-03-15 19:21:58,098 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:59,900 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 45 new interpolants: [505057#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 505042#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 505056#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 505064#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 505032#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 505045#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 505049#(or (<= 7 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 505031#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 505053#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 505047#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 505040#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 505065#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 505041#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 505054#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0))), 505062#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 505066#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 505051#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 505067#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 505050#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 5)), 505073#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 505060#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 505038#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 505048#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 5)), 505037#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 505036#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 505043#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 505046#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 505068#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))), 505030#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 505059#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 505063#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 505052#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 505074#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 505044#(or (<= 7 ~N~0) (<= ~N~0 5) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 505069#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 505034#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 505039#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 505071#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 505070#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 5)), 505055#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 505033#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 505072#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 505058#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0)), 505035#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 505061#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0))] [2022-03-15 19:21:59,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 19:21:59,900 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:59,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 19:21:59,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=688, Invalid=4424, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 19:21:59,901 INFO L87 Difference]: Start difference. First operand 7270 states and 24095 transitions. Second operand has 62 states, 62 states have (on average 2.4838709677419355) internal successors, (154), 62 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:08,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:08,524 INFO L93 Difference]: Finished difference Result 11422 states and 36286 transitions. [2022-03-15 19:22:08,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2022-03-15 19:22:08,524 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.4838709677419355) internal successors, (154), 62 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:22:08,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:08,547 INFO L225 Difference]: With dead ends: 11422 [2022-03-15 19:22:08,547 INFO L226 Difference]: Without dead ends: 11288 [2022-03-15 19:22:08,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17990 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10719, Invalid=45687, Unknown=0, NotChecked=0, Total=56406 [2022-03-15 19:22:08,550 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 591 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 4150 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 4610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 4150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:08,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [591 Valid, 44 Invalid, 4610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 4150 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 19:22:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11288 states. [2022-03-15 19:22:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11288 to 7476. [2022-03-15 19:22:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7476 states, 7475 states have (on average 3.303411371237458) internal successors, (24693), 7475 states have internal predecessors, (24693), 0 states have call successors, (0), 0 states have 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:22:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7476 states to 7476 states and 24693 transitions. [2022-03-15 19:22:08,703 INFO L78 Accepts]: Start accepts. Automaton has 7476 states and 24693 transitions. Word has length 26 [2022-03-15 19:22:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:08,703 INFO L470 AbstractCegarLoop]: Abstraction has 7476 states and 24693 transitions. [2022-03-15 19:22:08,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.4838709677419355) internal successors, (154), 62 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 7476 states and 24693 transitions. [2022-03-15 19:22:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:22:08,714 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:08,714 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:22:08,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-03-15 19:22:08,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:08,915 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:22:08,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:08,915 INFO L85 PathProgramCache]: Analyzing trace with hash 520541761, now seen corresponding path program 59 times [2022-03-15 19:22:08,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:08,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108827441] [2022-03-15 19:22:08,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:08,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:09,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:09,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108827441] [2022-03-15 19:22:09,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108827441] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:09,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965428064] [2022-03-15 19:22:09,016 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:22:09,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:09,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:22:09,017 INFO L229 MonitoredProcess]: Starting monitored process 62 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:22:09,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-03-15 19:22:09,107 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:22:09,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:22:09,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:22:09,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:22:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:09,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:22:09,309 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:09,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965428064] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:22:09,309 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:22:09,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 27 [2022-03-15 19:22:09,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1943983044] [2022-03-15 19:22:09,309 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:09,311 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:09,319 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 132 transitions. [2022-03-15 19:22:09,319 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:10,534 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [532138#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 532154#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 532139#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 532133#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 532153#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 532129#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 532144#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 532136#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 532142#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)))), 532141#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 532150#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 532145#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 532137#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 532128#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 532146#(or (<= ~N~0 4) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 532132#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 532147#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 5)), 532140#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 532130#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 532149#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 5)), 532134#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 532143#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 532124#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 532151#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 532152#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 532125#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 532156#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 532155#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 532157#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 532131#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 532126#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 532148#(or (<= 7 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 532135#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 532127#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0))] [2022-03-15 19:22:10,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 19:22:10,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:10,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 19:22:10,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=3034, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:22:10,535 INFO L87 Difference]: Start difference. First operand 7476 states and 24693 transitions. Second operand has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have 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:22:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:16,491 INFO L93 Difference]: Finished difference Result 10536 states and 32487 transitions. [2022-03-15 19:22:16,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2022-03-15 19:22:16,492 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 0 states have call successors, (0), 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:22:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:16,511 INFO L225 Difference]: With dead ends: 10536 [2022-03-15 19:22:16,511 INFO L226 Difference]: Without dead ends: 10518 [2022-03-15 19:22:16,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12023 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8197, Invalid=30023, Unknown=0, NotChecked=0, Total=38220 [2022-03-15 19:22:16,514 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 669 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 2764 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 3193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 2764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:16,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 44 Invalid, 3193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 2764 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:22:16,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10518 states. [2022-03-15 19:22:16,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10518 to 7934. [2022-03-15 19:22:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7934 states, 7933 states have (on average 3.3124921215177108) internal successors, (26278), 7933 states have internal predecessors, (26278), 0 states have call successors, (0), 0 states have 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:22:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7934 states to 7934 states and 26278 transitions. [2022-03-15 19:22:16,684 INFO L78 Accepts]: Start accepts. Automaton has 7934 states and 26278 transitions. Word has length 26 [2022-03-15 19:22:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:16,684 INFO L470 AbstractCegarLoop]: Abstraction has 7934 states and 26278 transitions. [2022-03-15 19:22:16,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have 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:22:16,684 INFO L276 IsEmpty]: Start isEmpty. Operand 7934 states and 26278 transitions. [2022-03-15 19:22:16,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:22:16,695 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:16,695 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:22:16,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-03-15 19:22:16,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:16,896 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:22:16,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:16,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1847202169, now seen corresponding path program 60 times [2022-03-15 19:22:16,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:16,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232295294] [2022-03-15 19:22:16,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:16,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:17,005 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:17,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232295294] [2022-03-15 19:22:17,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232295294] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:17,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403232074] [2022-03-15 19:22:17,005 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:22:17,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:17,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:22:17,006 INFO L229 MonitoredProcess]: Starting monitored process 63 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:22:17,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-03-15 19:22:17,097 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:22:17,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:22:17,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:22:17,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:22:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:17,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:22:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:17,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403232074] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:22:17,297 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:22:17,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 27 [2022-03-15 19:22:17,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1883387466] [2022-03-15 19:22:17,298 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:17,299 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:17,308 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 141 transitions. [2022-03-15 19:22:17,308 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:18,593 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [559146#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 559152#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 559178#(or (<= ~N~0 4) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 559161#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 559164#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 559158#(or (<= 7 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 559175#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 559156#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 5)), 559144#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 559172#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 559165#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 559179#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 559160#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 5)), 559177#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 559153#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 559157#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 559147#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 559174#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 559155#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 559170#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 559145#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 559162#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 559150#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 559163#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 559154#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 559176#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 559148#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 559151#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 559166#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 559169#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 559149#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 559171#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 559167#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 559168#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)))), 559159#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 559173#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)))] [2022-03-15 19:22:18,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 19:22:18,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:18,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 19:22:18,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=3297, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 19:22:18,594 INFO L87 Difference]: Start difference. First operand 7934 states and 26278 transitions. Second operand has 52 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 52 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have 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:22:25,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:25,478 INFO L93 Difference]: Finished difference Result 10562 states and 32782 transitions. [2022-03-15 19:22:25,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2022-03-15 19:22:25,478 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 52 states have internal predecessors, (125), 0 states have call successors, (0), 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:22:25,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:25,499 INFO L225 Difference]: With dead ends: 10562 [2022-03-15 19:22:25,499 INFO L226 Difference]: Without dead ends: 10520 [2022-03-15 19:22:25,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13853 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8688, Invalid=34368, Unknown=0, NotChecked=0, Total=43056 [2022-03-15 19:22:25,502 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 553 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 3286 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 3679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 3286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:25,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [553 Valid, 56 Invalid, 3679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 3286 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:22:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10520 states. [2022-03-15 19:22:25,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10520 to 7914. [2022-03-15 19:22:25,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7914 states, 7913 states have (on average 3.3108808290155443) internal successors, (26199), 7913 states have internal predecessors, (26199), 0 states have call successors, (0), 0 states have 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:22:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7914 states to 7914 states and 26199 transitions. [2022-03-15 19:22:25,690 INFO L78 Accepts]: Start accepts. Automaton has 7914 states and 26199 transitions. Word has length 26 [2022-03-15 19:22:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:25,690 INFO L470 AbstractCegarLoop]: Abstraction has 7914 states and 26199 transitions. [2022-03-15 19:22:25,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 52 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have 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:22:25,690 INFO L276 IsEmpty]: Start isEmpty. Operand 7914 states and 26199 transitions. [2022-03-15 19:22:25,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:22:25,703 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:25,703 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:22:25,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-03-15 19:22:25,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:25,904 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:22:25,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:25,904 INFO L85 PathProgramCache]: Analyzing trace with hash 24001857, now seen corresponding path program 61 times [2022-03-15 19:22:25,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:25,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618411858] [2022-03-15 19:22:25,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:25,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:26,011 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:26,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618411858] [2022-03-15 19:22:26,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618411858] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:26,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653285036] [2022-03-15 19:22:26,011 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:22:26,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:26,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:22:26,012 INFO L229 MonitoredProcess]: Starting monitored process 64 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:22:26,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-03-15 19:22:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:26,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:22:26,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:22:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:26,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:22:26,308 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:26,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653285036] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:22:26,308 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:22:26,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 27 [2022-03-15 19:22:26,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1280218214] [2022-03-15 19:22:26,308 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:26,310 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:26,319 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 150 transitions. [2022-03-15 19:22:26,319 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:27,717 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 38 new interpolants: [586191#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 586187#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 586182#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 586193#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 586194#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 586188#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 586190#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 586208#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)))), 586189#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 586201#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 5)), 586192#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 586216#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 586183#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 586219#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 586200#(or (<= 7 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 586210#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 586218#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 586196#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 586214#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 586206#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 586212#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 586217#(or (<= ~N~0 4) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 586215#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 586197#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 586186#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 586203#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 586199#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 5)), 586202#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 586198#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 586205#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 586204#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 586209#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 586184#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 586185#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 586195#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 586211#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 586213#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 586207#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)))] [2022-03-15 19:22:27,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 19:22:27,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:27,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 19:22:27,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=3554, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 19:22:27,719 INFO L87 Difference]: Start difference. First operand 7914 states and 26199 transitions. Second operand has 54 states, 54 states have (on average 2.4444444444444446) internal successors, (132), 54 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:34,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:34,706 INFO L93 Difference]: Finished difference Result 10126 states and 31801 transitions. [2022-03-15 19:22:34,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2022-03-15 19:22:34,706 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.4444444444444446) internal successors, (132), 54 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:22:34,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:34,724 INFO L225 Difference]: With dead ends: 10126 [2022-03-15 19:22:34,724 INFO L226 Difference]: Without dead ends: 10048 [2022-03-15 19:22:34,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12875 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=7675, Invalid=33331, Unknown=0, NotChecked=0, Total=41006 [2022-03-15 19:22:34,727 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 463 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 3714 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 4027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 3714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:34,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [463 Valid, 44 Invalid, 4027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 3714 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 19:22:34,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10048 states. [2022-03-15 19:22:34,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10048 to 8156. [2022-03-15 19:22:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8156 states, 8155 states have (on average 3.308399754751686) internal successors, (26980), 8155 states have internal predecessors, (26980), 0 states have call successors, (0), 0 states have 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:22:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8156 states to 8156 states and 26980 transitions. [2022-03-15 19:22:34,912 INFO L78 Accepts]: Start accepts. Automaton has 8156 states and 26980 transitions. Word has length 26 [2022-03-15 19:22:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:34,912 INFO L470 AbstractCegarLoop]: Abstraction has 8156 states and 26980 transitions. [2022-03-15 19:22:34,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.4444444444444446) internal successors, (132), 54 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 8156 states and 26980 transitions. [2022-03-15 19:22:34,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:22:34,923 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:34,923 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:22:34,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-03-15 19:22:35,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-03-15 19:22:35,124 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:22:35,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:35,124 INFO L85 PathProgramCache]: Analyzing trace with hash -660632967, now seen corresponding path program 62 times [2022-03-15 19:22:35,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:35,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102849208] [2022-03-15 19:22:35,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:35,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:35,219 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:35,219 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:35,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102849208] [2022-03-15 19:22:35,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102849208] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:35,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453930518] [2022-03-15 19:22:35,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:22:35,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:35,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:22:35,220 INFO L229 MonitoredProcess]: Starting monitored process 65 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:22:35,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-03-15 19:22:35,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:22:35,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:22:35,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:22:35,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:22:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:35,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:22:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:35,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453930518] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:22:35,508 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:22:35,508 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 27 [2022-03-15 19:22:35,508 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1211273730] [2022-03-15 19:22:35,509 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:35,510 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:35,520 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 159 transitions. [2022-03-15 19:22:35,520 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:37,031 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [613277#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 613275#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 613271#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 613264#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 613256#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 613262#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 613276#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 613280#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 613261#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 613253#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 613269#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)))), 613273#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 613278#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 613250#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 613263#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 613274#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 613270#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 613283#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 613266#(or (<= 7 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 613282#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 613284#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 613255#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 613260#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 613258#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 613279#(or (<= ~N~0 4) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 613287#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 613259#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 613251#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 613268#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 613288#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 613267#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 5)), 613285#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 613254#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 613286#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 613257#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 613252#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 613249#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 613272#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 613265#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 5)), 613281#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0))] [2022-03-15 19:22:37,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-15 19:22:37,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:37,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-15 19:22:37,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=3805, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 19:22:37,032 INFO L87 Difference]: Start difference. First operand 8156 states and 26980 transitions. Second operand has 56 states, 56 states have (on average 2.482142857142857) internal successors, (139), 56 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have 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:22:43,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:43,630 INFO L93 Difference]: Finished difference Result 12612 states and 40074 transitions. [2022-03-15 19:22:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-03-15 19:22:43,630 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.482142857142857) internal successors, (139), 56 states have internal predecessors, (139), 0 states have call successors, (0), 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:22:43,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:43,654 INFO L225 Difference]: With dead ends: 12612 [2022-03-15 19:22:43,654 INFO L226 Difference]: Without dead ends: 12490 [2022-03-15 19:22:43,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12217 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7131, Invalid=32669, Unknown=0, NotChecked=0, Total=39800 [2022-03-15 19:22:43,656 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 546 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 3160 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 3507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 3160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:43,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [546 Valid, 38 Invalid, 3507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 3160 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:22:43,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12490 states. [2022-03-15 19:22:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12490 to 8608. [2022-03-15 19:22:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8608 states, 8607 states have (on average 3.3003369350528637) internal successors, (28406), 8607 states have internal predecessors, (28406), 0 states have call successors, (0), 0 states have 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:22:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8608 states to 8608 states and 28406 transitions. [2022-03-15 19:22:43,820 INFO L78 Accepts]: Start accepts. Automaton has 8608 states and 28406 transitions. Word has length 26 [2022-03-15 19:22:43,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:43,820 INFO L470 AbstractCegarLoop]: Abstraction has 8608 states and 28406 transitions. [2022-03-15 19:22:43,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.482142857142857) internal successors, (139), 56 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have 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:22:43,821 INFO L276 IsEmpty]: Start isEmpty. Operand 8608 states and 28406 transitions. [2022-03-15 19:22:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:22:43,832 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:43,832 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:22:43,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2022-03-15 19:22:44,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:44,033 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:22:44,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:44,033 INFO L85 PathProgramCache]: Analyzing trace with hash 640739715, now seen corresponding path program 63 times [2022-03-15 19:22:44,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:44,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013623364] [2022-03-15 19:22:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:44,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:44,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:44,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013623364] [2022-03-15 19:22:44,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013623364] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:44,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377785185] [2022-03-15 19:22:44,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:22:44,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:44,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:22:44,134 INFO L229 MonitoredProcess]: Starting monitored process 66 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:22:44,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-03-15 19:22:44,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 19:22:44,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:22:44,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:22:44,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:22:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:44,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:22:44,456 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:44,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377785185] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:22:44,457 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:22:44,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 15] total 27 [2022-03-15 19:22:44,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1022922356] [2022-03-15 19:22:44,458 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:44,459 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:44,468 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 132 transitions. [2022-03-15 19:22:44,468 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:45,668 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 33 new interpolants: [643706#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 643702#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 643711#(or (<= 7 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 643710#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 643703#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 643722#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 643696#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 643725#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 643705#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 643694#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 643712#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 5)), 643724#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 3)), 643714#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 643709#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 643719#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 643701#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 643698#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 643704#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 643699#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 643693#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 643721#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 643715#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 643708#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 643717#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0))), 643720#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 643713#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 643716#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 643723#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 643695#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 643697#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 643700#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 643707#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 643718#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))))] [2022-03-15 19:22:45,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-15 19:22:45,668 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:45,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-15 19:22:45,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=2979, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:22:45,669 INFO L87 Difference]: Start difference. First operand 8608 states and 28406 transitions. Second operand has 48 states, 48 states have (on average 2.4375) internal successors, (117), 48 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:50,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:50,202 INFO L93 Difference]: Finished difference Result 10648 states and 33347 transitions. [2022-03-15 19:22:50,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-03-15 19:22:50,202 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.4375) internal successors, (117), 48 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:22:50,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:50,221 INFO L225 Difference]: With dead ends: 10648 [2022-03-15 19:22:50,221 INFO L226 Difference]: Without dead ends: 10606 [2022-03-15 19:22:50,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8311 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5444, Invalid=21616, Unknown=0, NotChecked=0, Total=27060 [2022-03-15 19:22:50,223 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 489 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 2306 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 2306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:50,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 41 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 2306 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:22:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10606 states. [2022-03-15 19:22:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10606 to 8650. [2022-03-15 19:22:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8650 states, 8649 states have (on average 3.2992253439704013) internal successors, (28535), 8649 states have internal predecessors, (28535), 0 states have call successors, (0), 0 states have 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:22:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 28535 transitions. [2022-03-15 19:22:50,364 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 28535 transitions. Word has length 26 [2022-03-15 19:22:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:50,364 INFO L470 AbstractCegarLoop]: Abstraction has 8650 states and 28535 transitions. [2022-03-15 19:22:50,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.4375) internal successors, (117), 48 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 28535 transitions. [2022-03-15 19:22:50,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:22:50,376 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:50,376 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:22:50,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-03-15 19:22:50,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-03-15 19:22:50,577 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:22:50,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:50,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1604946323, now seen corresponding path program 64 times [2022-03-15 19:22:50,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:50,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698839499] [2022-03-15 19:22:50,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:50,684 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:50,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698839499] [2022-03-15 19:22:50,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698839499] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:50,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034700066] [2022-03-15 19:22:50,684 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:22:50,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:50,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:22:50,688 INFO L229 MonitoredProcess]: Starting monitored process 67 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:22:50,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-03-15 19:22:50,781 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:22:50,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:22:50,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:22:50,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:22:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:50,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:22:50,989 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:50,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034700066] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:22:50,989 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:22:50,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 15] total 27 [2022-03-15 19:22:50,989 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [43728006] [2022-03-15 19:22:50,990 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:50,992 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:51,003 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 141 transitions. [2022-03-15 19:22:51,003 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:52,360 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [672196#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 672191#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 672183#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 5)), 672173#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 672172#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 672188#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 672197#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 672166#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 672182#(or (<= 7 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 672180#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 672200#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 3)), 672176#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 672192#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 672179#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 672178#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 672187#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 672170#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 672175#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 672190#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 672174#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 672194#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 672168#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 672185#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 672177#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 672198#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 672195#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 672171#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 672199#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 672167#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 672193#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0))), 672184#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 672169#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 672186#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 672181#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 672189#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5))] [2022-03-15 19:22:52,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 19:22:52,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:52,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 19:22:52,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=3222, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:22:52,361 INFO L87 Difference]: Start difference. First operand 8650 states and 28535 transitions. Second operand has 50 states, 50 states have (on average 2.48) internal successors, (124), 50 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have 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:22:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:57,356 INFO L93 Difference]: Finished difference Result 11972 states and 37611 transitions. [2022-03-15 19:22:57,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-15 19:22:57,356 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.48) internal successors, (124), 50 states have internal predecessors, (124), 0 states have call successors, (0), 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:22:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:57,376 INFO L225 Difference]: With dead ends: 11972 [2022-03-15 19:22:57,376 INFO L226 Difference]: Without dead ends: 11894 [2022-03-15 19:22:57,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8798 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5160, Invalid=23232, Unknown=0, NotChecked=0, Total=28392 [2022-03-15 19:22:57,377 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 438 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 2495 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 2495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:57,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [438 Valid, 34 Invalid, 2785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 2495 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:22:57,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11894 states. [2022-03-15 19:22:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11894 to 9138. [2022-03-15 19:22:57,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9138 states, 9137 states have (on average 3.3027251833205646) internal successors, (30177), 9137 states have internal predecessors, (30177), 0 states have call successors, (0), 0 states have 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:22:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9138 states to 9138 states and 30177 transitions. [2022-03-15 19:22:57,538 INFO L78 Accepts]: Start accepts. Automaton has 9138 states and 30177 transitions. Word has length 26 [2022-03-15 19:22:57,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:57,538 INFO L470 AbstractCegarLoop]: Abstraction has 9138 states and 30177 transitions. [2022-03-15 19:22:57,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.48) internal successors, (124), 50 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have 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:22:57,538 INFO L276 IsEmpty]: Start isEmpty. Operand 9138 states and 30177 transitions. [2022-03-15 19:22:57,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:22:57,550 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:57,550 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:22:57,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-03-15 19:22:57,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-03-15 19:22:57,751 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:22:57,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:57,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1793230531, now seen corresponding path program 65 times [2022-03-15 19:22:57,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:57,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822773858] [2022-03-15 19:22:57,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:57,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:57,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:57,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822773858] [2022-03-15 19:22:57,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822773858] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:57,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502475876] [2022-03-15 19:22:57,839 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:22:57,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:57,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:22:57,840 INFO L229 MonitoredProcess]: Starting monitored process 68 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:22:57,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-03-15 19:22:57,929 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:22:57,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:22:57,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:22:57,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:22:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:58,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:22:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:58,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502475876] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:22:58,129 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:22:58,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 15] total 27 [2022-03-15 19:22:58,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [57963960] [2022-03-15 19:22:58,130 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:58,131 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:58,140 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 150 transitions. [2022-03-15 19:22:58,140 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:59,520 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [702967#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 702975#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 702976#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 702955#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 702971#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 702947#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 702952#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 702969#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 5)), 702948#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 702961#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 702966#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0))), 702956#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 702949#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 702978#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 702965#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 702982#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 702957#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 702953#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 702954#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 702972#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 702983#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 702979#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 702958#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 702959#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 702950#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 702964#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 702960#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 702963#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 702981#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 702968#(or (<= 7 ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 702973#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 702980#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 3)), 702974#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 702951#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 702977#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 702970#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 702962#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0))] [2022-03-15 19:22:59,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-15 19:22:59,520 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:59,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-15 19:22:59,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=3462, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:22:59,521 INFO L87 Difference]: Start difference. First operand 9138 states and 30177 transitions. Second operand has 53 states, 53 states have (on average 2.4716981132075473) internal successors, (131), 53 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have 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:23:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:23:04,849 INFO L93 Difference]: Finished difference Result 14586 states and 46387 transitions. [2022-03-15 19:23:04,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-03-15 19:23:04,850 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.4716981132075473) internal successors, (131), 53 states have internal predecessors, (131), 0 states have call successors, (0), 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:23:04,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:23:04,876 INFO L225 Difference]: With dead ends: 14586 [2022-03-15 19:23:04,876 INFO L226 Difference]: Without dead ends: 14480 [2022-03-15 19:23:04,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9536 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5363, Invalid=25437, Unknown=0, NotChecked=0, Total=30800 [2022-03-15 19:23:04,878 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 451 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 3389 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 3389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:23:04,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 35 Invalid, 3668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 3389 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:23:04,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2022-03-15 19:23:05,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 9862. [2022-03-15 19:23:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9862 states, 9861 states have (on average 3.300780853868776) internal successors, (32549), 9861 states have internal predecessors, (32549), 0 states have call successors, (0), 0 states have 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:23:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9862 states to 9862 states and 32549 transitions. [2022-03-15 19:23:05,072 INFO L78 Accepts]: Start accepts. Automaton has 9862 states and 32549 transitions. Word has length 26 [2022-03-15 19:23:05,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:23:05,072 INFO L470 AbstractCegarLoop]: Abstraction has 9862 states and 32549 transitions. [2022-03-15 19:23:05,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.4716981132075473) internal successors, (131), 53 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have 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:23:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 9862 states and 32549 transitions. [2022-03-15 19:23:05,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:23:05,087 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:23:05,087 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:23:05,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-03-15 19:23:05,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-03-15 19:23:05,290 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:23:05,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:23:05,290 INFO L85 PathProgramCache]: Analyzing trace with hash -562732351, now seen corresponding path program 66 times [2022-03-15 19:23:05,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:23:05,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155842972] [2022-03-15 19:23:05,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:23:05,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:23:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:23:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:05,375 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:23:05,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155842972] [2022-03-15 19:23:05,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155842972] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:23:05,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774548260] [2022-03-15 19:23:05,375 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:23:05,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:05,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:23:05,376 INFO L229 MonitoredProcess]: Starting monitored process 69 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:23:05,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-03-15 19:23:05,470 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:23:05,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:23:05,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:23:05,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:23:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:05,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:23:05,686 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:05,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774548260] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:23:05,686 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:23:05,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 14] total 27 [2022-03-15 19:23:05,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1217286431] [2022-03-15 19:23:05,686 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:23:05,688 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:23:05,697 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 132 transitions. [2022-03-15 19:23:05,697 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:23:06,883 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [737818#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 737831#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 737827#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 737813#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 737823#(and (or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 737812#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 737815#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 737834#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 737826#(or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 737829#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 737820#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 737824#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 5)), 737819#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 737833#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 737814#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 737809#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 737808#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 737822#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 737830#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 737832#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 2)), 737835#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 737810#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 737828#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 737836#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 737807#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 737817#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 737837#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 737838#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 737825#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 737821#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 737816#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 737811#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0))] [2022-03-15 19:23:06,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 19:23:06,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:23:06,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 19:23:06,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=2908, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:23:06,884 INFO L87 Difference]: Start difference. First operand 9862 states and 32549 transitions. Second operand has 47 states, 47 states have (on average 2.4680851063829787) internal successors, (116), 47 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have 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:23:09,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:23:09,745 INFO L93 Difference]: Finished difference Result 12070 states and 38232 transitions. [2022-03-15 19:23:09,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-03-15 19:23:09,745 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.4680851063829787) internal successors, (116), 47 states have internal predecessors, (116), 0 states have call successors, (0), 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:23:09,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:23:09,769 INFO L225 Difference]: With dead ends: 12070 [2022-03-15 19:23:09,769 INFO L226 Difference]: Without dead ends: 12030 [2022-03-15 19:23:09,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4871 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3169, Invalid=12833, Unknown=0, NotChecked=0, Total=16002 [2022-03-15 19:23:09,771 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 367 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 2087 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 2087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:23:09,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 34 Invalid, 2275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 2087 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:23:09,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12030 states. [2022-03-15 19:23:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12030 to 8944. [2022-03-15 19:23:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8944 states, 8943 states have (on average 3.3002348205300236) internal successors, (29514), 8943 states have internal predecessors, (29514), 0 states have call successors, (0), 0 states have 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:23:09,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8944 states to 8944 states and 29514 transitions. [2022-03-15 19:23:09,976 INFO L78 Accepts]: Start accepts. Automaton has 8944 states and 29514 transitions. Word has length 26 [2022-03-15 19:23:09,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:23:09,976 INFO L470 AbstractCegarLoop]: Abstraction has 8944 states and 29514 transitions. [2022-03-15 19:23:09,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.4680851063829787) internal successors, (116), 47 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have 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:23:09,976 INFO L276 IsEmpty]: Start isEmpty. Operand 8944 states and 29514 transitions. [2022-03-15 19:23:09,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:23:09,988 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:23:09,988 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:23:10,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-03-15 19:23:10,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-03-15 19:23:10,189 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:23:10,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:23:10,189 INFO L85 PathProgramCache]: Analyzing trace with hash 815736739, now seen corresponding path program 67 times [2022-03-15 19:23:10,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:23:10,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605272510] [2022-03-15 19:23:10,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:23:10,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:23:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:23:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 41 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:23:10,280 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:23:10,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605272510] [2022-03-15 19:23:10,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605272510] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:23:10,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015290316] [2022-03-15 19:23:10,280 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:23:10,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:10,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:23:10,281 INFO L229 MonitoredProcess]: Starting monitored process 70 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:23:10,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-03-15 19:23:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:23:10,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:23:10,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:23:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:10,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:23:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:23:10,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015290316] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:23:10,590 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:23:10,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 14] total 27 [2022-03-15 19:23:10,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [431279664] [2022-03-15 19:23:10,590 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:23:10,592 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:23:10,600 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 132 transitions. [2022-03-15 19:23:10,600 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:23:11,746 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [768199#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 768182#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 768194#(and (or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 768181#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 768207#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 768209#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 768192#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 768178#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 768184#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 768186#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 768200#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 768197#(or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 768206#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 768204#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 768193#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 768196#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 768179#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 768208#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 768203#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 2)), 768205#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 768198#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 768185#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 768201#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 768191#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 768183#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 768202#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 768187#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 768195#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 5)), 768188#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 768190#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 768180#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 768189#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0))] [2022-03-15 19:23:11,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 19:23:11,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:23:11,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 19:23:11,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=2921, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:23:11,747 INFO L87 Difference]: Start difference. First operand 8944 states and 29514 transitions. Second operand has 47 states, 47 states have (on average 2.4680851063829787) internal successors, (116), 47 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have 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:23:15,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:23:15,418 INFO L93 Difference]: Finished difference Result 13012 states and 41357 transitions. [2022-03-15 19:23:15,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-03-15 19:23:15,418 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.4680851063829787) internal successors, (116), 47 states have internal predecessors, (116), 0 states have call successors, (0), 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:23:15,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:23:15,442 INFO L225 Difference]: With dead ends: 13012 [2022-03-15 19:23:15,442 INFO L226 Difference]: Without dead ends: 12942 [2022-03-15 19:23:15,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5272 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3198, Invalid=14094, Unknown=0, NotChecked=0, Total=17292 [2022-03-15 19:23:15,444 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 332 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 2690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 2516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:23:15,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 33 Invalid, 2690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 2516 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:23:15,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12942 states. [2022-03-15 19:23:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12942 to 10002. [2022-03-15 19:23:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10002 states, 10001 states have (on average 3.298970102989701) internal successors, (32993), 10001 states have internal predecessors, (32993), 0 states have call successors, (0), 0 states have 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:23:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10002 states to 10002 states and 32993 transitions. [2022-03-15 19:23:15,617 INFO L78 Accepts]: Start accepts. Automaton has 10002 states and 32993 transitions. Word has length 26 [2022-03-15 19:23:15,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:23:15,617 INFO L470 AbstractCegarLoop]: Abstraction has 10002 states and 32993 transitions. [2022-03-15 19:23:15,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.4680851063829787) internal successors, (116), 47 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have 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:23:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 10002 states and 32993 transitions. [2022-03-15 19:23:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:23:15,630 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:23:15,631 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:23:15,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-03-15 19:23:15,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:15,843 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:23:15,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:23:15,843 INFO L85 PathProgramCache]: Analyzing trace with hash 553587641, now seen corresponding path program 68 times [2022-03-15 19:23:15,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:23:15,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465136738] [2022-03-15 19:23:15,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:23:15,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:23:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:23:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:15,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:23:15,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465136738] [2022-03-15 19:23:15,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465136738] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:23:15,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662801252] [2022-03-15 19:23:15,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:23:15,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:15,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:23:15,948 INFO L229 MonitoredProcess]: Starting monitored process 71 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:23:15,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-03-15 19:23:16,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:23:16,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:23:16,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:23:16,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:23:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:16,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:23:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:16,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662801252] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:23:16,329 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:23:16,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 15] total 28 [2022-03-15 19:23:16,329 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [697629925] [2022-03-15 19:23:16,330 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:23:16,332 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:23:16,343 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 141 transitions. [2022-03-15 19:23:16,343 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:23:17,704 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [801647#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 801633#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 801649#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 801639#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 801625#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 801653#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 2)), 801654#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 801637#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 801648#(or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 801631#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 801638#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 801626#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 801636#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 801629#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 801646#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 801652#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 801650#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 801651#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 801627#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 801640#(and (or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 801641#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 801643#(or (<= 7 ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 5)), 801623#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 801632#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 801624#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 801655#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 801645#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 801642#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 801630#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 801644#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 801628#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 801635#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 801634#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 801656#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))] [2022-03-15 19:23:17,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 19:23:17,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:23:17,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 19:23:17,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=3244, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:23:17,705 INFO L87 Difference]: Start difference. First operand 10002 states and 32993 transitions. Second operand has 50 states, 50 states have (on average 2.46) internal successors, (123), 50 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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:23:21,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:23:21,630 INFO L93 Difference]: Finished difference Result 13362 states and 42111 transitions. [2022-03-15 19:23:21,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 19:23:21,631 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.46) internal successors, (123), 50 states have internal predecessors, (123), 0 states have call successors, (0), 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:23:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:23:21,657 INFO L225 Difference]: With dead ends: 13362 [2022-03-15 19:23:21,657 INFO L226 Difference]: Without dead ends: 13260 [2022-03-15 19:23:21,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7159 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4194, Invalid=18456, Unknown=0, NotChecked=0, Total=22650 [2022-03-15 19:23:21,659 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 365 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 2682 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 2682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:23:21,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 33 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 2682 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:23:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13260 states. [2022-03-15 19:23:21,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13260 to 9636. [2022-03-15 19:23:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9636 states, 9635 states have (on average 3.2928905033731186) internal successors, (31727), 9635 states have internal predecessors, (31727), 0 states have call successors, (0), 0 states have 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:23:21,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9636 states to 9636 states and 31727 transitions. [2022-03-15 19:23:21,836 INFO L78 Accepts]: Start accepts. Automaton has 9636 states and 31727 transitions. Word has length 26 [2022-03-15 19:23:21,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:23:21,836 INFO L470 AbstractCegarLoop]: Abstraction has 9636 states and 31727 transitions. [2022-03-15 19:23:21,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.46) internal successors, (123), 50 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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:23:21,837 INFO L276 IsEmpty]: Start isEmpty. Operand 9636 states and 31727 transitions. [2022-03-15 19:23:21,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:23:21,850 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:23:21,850 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:23:21,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-03-15 19:23:22,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:22,051 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:23:22,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:23:22,052 INFO L85 PathProgramCache]: Analyzing trace with hash 495779907, now seen corresponding path program 69 times [2022-03-15 19:23:22,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:23:22,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829338120] [2022-03-15 19:23:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:23:22,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:23:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:23:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:23:22,131 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:23:22,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829338120] [2022-03-15 19:23:22,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829338120] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:23:22,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25263241] [2022-03-15 19:23:22,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:23:22,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:22,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:23:22,133 INFO L229 MonitoredProcess]: Starting monitored process 72 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:23:22,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-03-15 19:23:22,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 19:23:22,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:23:22,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:23:22,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:23:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:22,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:23:22,457 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:23:22,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25263241] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:23:22,457 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:23:22,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 13] total 27 [2022-03-15 19:23:22,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1595636583] [2022-03-15 19:23:22,457 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:23:22,460 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:23:22,506 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 114 transitions. [2022-03-15 19:23:22,506 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:23:23,421 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [834744#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 834736#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 834737#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 834759#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 834743#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 834745#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 834735#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 834753#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 834740#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 834739#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 834752#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 834756#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 834742#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 834758#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1)), 834761#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 834741#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 834746#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 834748#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 834757#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 834760#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 834755#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 834750#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 834749#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 834751#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 834754#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 834738#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 834747#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0))] [2022-03-15 19:23:23,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:23:23,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:23:23,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:23:23,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=2411, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:23:23,422 INFO L87 Difference]: Start difference. First operand 9636 states and 31727 transitions. Second operand has 41 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 41 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have 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:23:25,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:23:25,987 INFO L93 Difference]: Finished difference Result 13468 states and 42195 transitions. [2022-03-15 19:23:25,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 19:23:25,987 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 41 states have internal predecessors, (101), 0 states have call successors, (0), 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:23:25,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:23:26,012 INFO L225 Difference]: With dead ends: 13468 [2022-03-15 19:23:26,012 INFO L226 Difference]: Without dead ends: 13420 [2022-03-15 19:23:26,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3285 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2340, Invalid=8790, Unknown=0, NotChecked=0, Total=11130 [2022-03-15 19:23:26,014 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 395 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:23:26,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 29 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:23:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13420 states. [2022-03-15 19:23:26,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13420 to 10762. [2022-03-15 19:23:26,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10762 states, 10761 states have (on average 3.3147477000278784) internal successors, (35670), 10761 states have internal predecessors, (35670), 0 states have call successors, (0), 0 states have 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:23:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10762 states to 10762 states and 35670 transitions. [2022-03-15 19:23:26,236 INFO L78 Accepts]: Start accepts. Automaton has 10762 states and 35670 transitions. Word has length 26 [2022-03-15 19:23:26,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:23:26,236 INFO L470 AbstractCegarLoop]: Abstraction has 10762 states and 35670 transitions. [2022-03-15 19:23:26,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 41 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have 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:23:26,236 INFO L276 IsEmpty]: Start isEmpty. Operand 10762 states and 35670 transitions. [2022-03-15 19:23:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:23:26,251 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:23:26,251 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:23:26,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-03-15 19:23:26,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:26,451 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:23:26,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:23:26,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1041512813, now seen corresponding path program 70 times [2022-03-15 19:23:26,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:23:26,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153833941] [2022-03-15 19:23:26,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:23:26,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:23:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:23:26,537 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:23:26,537 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:23:26,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153833941] [2022-03-15 19:23:26,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153833941] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:23:26,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65657646] [2022-03-15 19:23:26,537 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:23:26,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:26,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:23:26,538 INFO L229 MonitoredProcess]: Starting monitored process 73 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:23:26,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-03-15 19:23:26,624 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:23:26,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:23:26,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:23:26,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:23:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:26,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:23:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:23:26,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65657646] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:23:26,851 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:23:26,851 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 14] total 28 [2022-03-15 19:23:26,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1475686299] [2022-03-15 19:23:26,851 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:23:26,853 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:23:26,861 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 123 transitions. [2022-03-15 19:23:26,861 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:23:27,896 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [870090#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 870103#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 870115#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 870100#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 870111#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1)), 870094#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 870098#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 870089#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 870101#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 870109#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 870099#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 870096#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 870112#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 870095#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 870110#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 870116#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 870114#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 870108#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 870093#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 870102#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 870097#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 870105#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 870113#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 870106#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 870104#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 870088#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 870092#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 870107#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 870091#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0))] [2022-03-15 19:23:27,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 19:23:27,896 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:23:27,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 19:23:27,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=2725, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:23:27,897 INFO L87 Difference]: Start difference. First operand 10762 states and 35670 transitions. Second operand has 44 states, 44 states have (on average 2.4545454545454546) internal successors, (108), 44 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have 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:23:30,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:23:30,215 INFO L93 Difference]: Finished difference Result 11808 states and 37513 transitions. [2022-03-15 19:23:30,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 19:23:30,215 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.4545454545454546) internal successors, (108), 44 states have internal predecessors, (108), 0 states have call successors, (0), 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:23:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:23:30,236 INFO L225 Difference]: With dead ends: 11808 [2022-03-15 19:23:30,236 INFO L226 Difference]: Without dead ends: 11772 [2022-03-15 19:23:30,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2007, Invalid=8499, Unknown=0, NotChecked=0, Total=10506 [2022-03-15 19:23:30,238 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 381 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 1738 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:23:30,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 32 Invalid, 1881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:23:30,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11772 states. [2022-03-15 19:23:30,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11772 to 10456. [2022-03-15 19:23:30,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10456 states, 10455 states have (on average 3.309325681492109) internal successors, (34599), 10455 states have internal predecessors, (34599), 0 states have call successors, (0), 0 states have 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:23:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10456 states to 10456 states and 34599 transitions. [2022-03-15 19:23:30,409 INFO L78 Accepts]: Start accepts. Automaton has 10456 states and 34599 transitions. Word has length 26 [2022-03-15 19:23:30,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:23:30,409 INFO L470 AbstractCegarLoop]: Abstraction has 10456 states and 34599 transitions. [2022-03-15 19:23:30,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.4545454545454546) internal successors, (108), 44 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have 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:23:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 10456 states and 34599 transitions. [2022-03-15 19:23:30,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:23:30,424 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:23:30,424 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:23:30,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2022-03-15 19:23:30,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2022-03-15 19:23:30,624 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:23:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:23:30,625 INFO L85 PathProgramCache]: Analyzing trace with hash 779363715, now seen corresponding path program 71 times [2022-03-15 19:23:30,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:23:30,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568154678] [2022-03-15 19:23:30,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:23:30,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:23:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:23:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:30,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:23:30,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568154678] [2022-03-15 19:23:30,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568154678] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:23:30,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673848608] [2022-03-15 19:23:30,726 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:23:30,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:30,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:23:30,732 INFO L229 MonitoredProcess]: Starting monitored process 74 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:23:30,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-03-15 19:23:30,825 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:23:30,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:23:30,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:23:30,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:23:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:31,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:23:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:31,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673848608] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:23:31,104 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:23:31,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 15] total 29 [2022-03-15 19:23:31,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [864601053] [2022-03-15 19:23:31,104 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:23:31,105 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:23:31,113 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 132 transitions. [2022-03-15 19:23:31,113 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:23:32,255 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [903154#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 903178#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 903168#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 903181#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 903171#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 903172#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 903167#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 903174#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 903155#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 903163#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 903160#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 903182#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1)), 903159#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 903165#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 903183#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 903156#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 903175#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 903162#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 903169#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 903161#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 903170#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 903166#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 903164#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 903173#(or (<= 7 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 903158#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 903180#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 903179#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 903176#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 903184#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 903157#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 903177#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0))] [2022-03-15 19:23:32,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 19:23:32,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:23:32,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 19:23:32,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=3030, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:23:32,256 INFO L87 Difference]: Start difference. First operand 10456 states and 34599 transitions. Second operand has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have 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:23:34,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:23:34,310 INFO L93 Difference]: Finished difference Result 11632 states and 37034 transitions. [2022-03-15 19:23:34,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 19:23:34,311 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 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:23:34,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:23:34,329 INFO L225 Difference]: With dead ends: 11632 [2022-03-15 19:23:34,329 INFO L226 Difference]: Without dead ends: 11584 [2022-03-15 19:23:34,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3405 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2268, Invalid=9074, Unknown=0, NotChecked=0, Total=11342 [2022-03-15 19:23:34,330 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 388 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:23:34,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 24 Invalid, 1849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1686 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:23:34,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11584 states. [2022-03-15 19:23:34,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11584 to 8716. [2022-03-15 19:23:34,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8716 states, 8715 states have (on average 3.2925989672977627) internal successors, (28695), 8715 states have internal predecessors, (28695), 0 states have call successors, (0), 0 states have 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:23:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8716 states to 8716 states and 28695 transitions. [2022-03-15 19:23:34,474 INFO L78 Accepts]: Start accepts. Automaton has 8716 states and 28695 transitions. Word has length 26 [2022-03-15 19:23:34,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:23:34,474 INFO L470 AbstractCegarLoop]: Abstraction has 8716 states and 28695 transitions. [2022-03-15 19:23:34,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have 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:23:34,474 INFO L276 IsEmpty]: Start isEmpty. Operand 8716 states and 28695 transitions. [2022-03-15 19:23:34,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:23:34,486 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:23:34,486 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:23:34,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-03-15 19:23:34,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:34,707 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:23:34,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:23:34,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1758821067, now seen corresponding path program 72 times [2022-03-15 19:23:34,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:23:34,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252669740] [2022-03-15 19:23:34,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:23:34,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:23:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:23:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:34,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:23:34,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252669740] [2022-03-15 19:23:34,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252669740] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:23:34,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808171716] [2022-03-15 19:23:34,805 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:23:34,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:34,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:23:34,806 INFO L229 MonitoredProcess]: Starting monitored process 75 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:23:34,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-03-15 19:23:34,903 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:23:34,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:23:34,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:23:34,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:23:35,120 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:35,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:23:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 20 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:23:35,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808171716] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:23:35,165 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:23:35,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15] total 32 [2022-03-15 19:23:35,165 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1273816297] [2022-03-15 19:23:35,165 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:23:35,167 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:23:35,175 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 132 transitions. [2022-03-15 19:23:35,175 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:23:36,293 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [932593#(<= 1 thread1Thread1of1ForFork1_~i~0), 932588#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 932585#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 932586#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 932577#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 932576#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 932573#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 932579#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 932575#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 932590#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 932598#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 6) (< 7 ~N~0)), 932589#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 932591#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 932572#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 932584#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 932597#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 932594#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 932596#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 932583#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 932581#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 932580#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 932592#(or (<= 7 ~N~0) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 932582#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 932599#(or (<= 7 ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 5)), 932578#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 932595#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 932587#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 932600#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 932574#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)))] [2022-03-15 19:23:36,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 19:23:36,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:23:36,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 19:23:36,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=3127, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:23:36,295 INFO L87 Difference]: Start difference. First operand 8716 states and 28695 transitions. Second operand has 46 states, 46 states have (on average 2.4347826086956523) internal successors, (112), 46 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have 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:23:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:23:38,239 INFO L93 Difference]: Finished difference Result 12884 states and 40727 transitions. [2022-03-15 19:23:38,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 19:23:38,240 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.4347826086956523) internal successors, (112), 46 states have internal predecessors, (112), 0 states have call successors, (0), 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:23:38,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:23:38,267 INFO L225 Difference]: With dead ends: 12884 [2022-03-15 19:23:38,267 INFO L226 Difference]: Without dead ends: 12740 [2022-03-15 19:23:38,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2209, Invalid=9133, Unknown=0, NotChecked=0, Total=11342 [2022-03-15 19:23:38,268 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 307 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:23:38,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 29 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:23:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12740 states. [2022-03-15 19:23:38,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12740 to 7704. [2022-03-15 19:23:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7704 states, 7703 states have (on average 3.271193041672076) internal successors, (25198), 7703 states have internal predecessors, (25198), 0 states have call successors, (0), 0 states have 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:23:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7704 states to 7704 states and 25198 transitions. [2022-03-15 19:23:38,421 INFO L78 Accepts]: Start accepts. Automaton has 7704 states and 25198 transitions. Word has length 26 [2022-03-15 19:23:38,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:23:38,421 INFO L470 AbstractCegarLoop]: Abstraction has 7704 states and 25198 transitions. [2022-03-15 19:23:38,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.4347826086956523) internal successors, (112), 46 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have 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:23:38,421 INFO L276 IsEmpty]: Start isEmpty. Operand 7704 states and 25198 transitions. [2022-03-15 19:23:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:23:38,432 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:23:38,432 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:23:38,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-03-15 19:23:38,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:38,633 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:23:38,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:23:38,633 INFO L85 PathProgramCache]: Analyzing trace with hash -295296883, now seen corresponding path program 73 times [2022-03-15 19:23:38,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:23:38,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722808807] [2022-03-15 19:23:38,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:23:38,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:23:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:23:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:38,748 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:23:38,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722808807] [2022-03-15 19:23:38,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722808807] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:23:38,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431706928] [2022-03-15 19:23:38,749 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:23:38,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:38,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:23:38,752 INFO L229 MonitoredProcess]: Starting monitored process 76 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:23:38,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-03-15 19:23:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:23:38,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 19:23:38,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:23:38,981 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:38,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:23:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:39,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431706928] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:23:39,049 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:23:39,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2022-03-15 19:23:39,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1088627307] [2022-03-15 19:23:39,049 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:23:39,050 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:23:39,064 INFO L252 McrAutomatonBuilder]: Finished intersection with 116 states and 220 transitions. [2022-03-15 19:23:39,064 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:23:40,162 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [961202#(or (<= ~counter~0 5) (= ~counter~0 6)), 961197#(or (<= ~counter~0 0) (= ~counter~0 1)), 961203#(or (= ~counter~0 7) (<= ~counter~0 6)), 961201#(or (= ~counter~0 5) (<= ~counter~0 4)), 961204#(or (= ~counter~0 0) (<= (+ ~counter~0 1) 0)), 961199#(or (= ~counter~0 3) (<= ~counter~0 2)), 961198#(or (<= ~counter~0 1) (= ~counter~0 2)), 961200#(or (= ~counter~0 4) (<= ~counter~0 3))] [2022-03-15 19:23:40,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:23:40,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:23:40,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:23:40,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:23:40,163 INFO L87 Difference]: Start difference. First operand 7704 states and 25198 transitions. Second operand has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have 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:23:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:23:40,450 INFO L93 Difference]: Finished difference Result 10463 states and 34527 transitions. [2022-03-15 19:23:40,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:23:40,450 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 0 states have call successors, (0), 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:23:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:23:40,470 INFO L225 Difference]: With dead ends: 10463 [2022-03-15 19:23:40,470 INFO L226 Difference]: Without dead ends: 10420 [2022-03-15 19:23:40,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 114 SyntacticMatches, 25 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:23:40,471 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 125 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:23:40,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 73 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:23:40,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10420 states. [2022-03-15 19:23:40,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10420 to 10158. [2022-03-15 19:23:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10158 states, 10157 states have (on average 3.3200748252436743) internal successors, (33722), 10157 states have internal predecessors, (33722), 0 states have call successors, (0), 0 states have 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:23:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10158 states to 10158 states and 33722 transitions. [2022-03-15 19:23:40,665 INFO L78 Accepts]: Start accepts. Automaton has 10158 states and 33722 transitions. Word has length 27 [2022-03-15 19:23:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:23:40,666 INFO L470 AbstractCegarLoop]: Abstraction has 10158 states and 33722 transitions. [2022-03-15 19:23:40,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have 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:23:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 10158 states and 33722 transitions. [2022-03-15 19:23:40,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:23:40,680 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:23:40,680 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:23:40,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-03-15 19:23:40,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-03-15 19:23:40,881 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:23:40,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:23:40,882 INFO L85 PathProgramCache]: Analyzing trace with hash -52222676, now seen corresponding path program 74 times [2022-03-15 19:23:40,882 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:23:40,882 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601173890] [2022-03-15 19:23:40,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:23:40,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:23:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:23:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 19 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:41,016 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:23:41,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601173890] [2022-03-15 19:23:41,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601173890] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:23:41,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286380524] [2022-03-15 19:23:41,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:23:41,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:41,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:23:41,017 INFO L229 MonitoredProcess]: Starting monitored process 77 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:23:41,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-03-15 19:23:41,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:23:41,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:23:41,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:23:41,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:23:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:23:41,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:23:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 29 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:23:41,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286380524] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:23:41,304 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:23:41,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 28 [2022-03-15 19:23:41,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [712951427] [2022-03-15 19:23:41,305 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:23:41,306 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:23:41,316 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 145 transitions. [2022-03-15 19:23:41,316 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:23:42,280 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [992201#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 992197#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))), 992178#(or (<= ~N~0 5) (<= 6 thread1Thread1of1ForFork1_~i~0)), 992202#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 5)), 992187#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 992168#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) thread1Thread1of1ForFork1_~i~0)), 992185#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 992169#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) thread1Thread1of1ForFork1_~i~0)), 992181#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 992179#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 5)), 992171#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) thread1Thread1of1ForFork1_~i~0)), 992175#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) thread1Thread1of1ForFork1_~i~0)), 992188#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) thread1Thread1of1ForFork1_~i~0)), 992194#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 992182#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0))), 992192#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 992174#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|))), 992191#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 992186#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 5)), 992173#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|))), 992172#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 992170#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 992196#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 992195#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 5)), 992177#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) thread1Thread1of1ForFork1_~i~0)), 992190#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) thread1Thread1of1ForFork1_~i~0)), 992193#(or (<= |thread2Thread1of1ForFork0_~i~1#1| thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|))), 992180#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 5)), 992176#(< |thread2Thread1of1ForFork0_~i~1#1| ~N~0), 992198#(or (<= ~N~0 5) (<= 0 thread1Thread1of1ForFork1_~i~0)), 992199#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 992184#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0)), 992183#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 992200#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0) (<= (+ ~N~0 1) thread1Thread1of1ForFork1_~i~0)), 992189#(or (<= ~N~0 5) (<= 2 thread1Thread1of1ForFork1_~i~0))] [2022-03-15 19:23:42,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-15 19:23:42,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:23:42,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-15 19:23:42,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=3043, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 19:23:42,281 INFO L87 Difference]: Start difference. First operand 10158 states and 33722 transitions. Second operand has 53 states, 53 states have (on average 2.3207547169811322) internal successors, (123), 53 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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:23:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:23:46,011 INFO L93 Difference]: Finished difference Result 12868 states and 41681 transitions. [2022-03-15 19:23:46,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2022-03-15 19:23:46,012 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.3207547169811322) internal successors, (123), 53 states have internal predecessors, (123), 0 states have call successors, (0), 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:23:46,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:23:46,038 INFO L225 Difference]: With dead ends: 12868 [2022-03-15 19:23:46,038 INFO L226 Difference]: Without dead ends: 12858 [2022-03-15 19:23:46,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12092 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=9502, Invalid=27940, Unknown=0, NotChecked=0, Total=37442 [2022-03-15 19:23:46,042 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 295 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 2320 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 2539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 2320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:23:46,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 51 Invalid, 2539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 2320 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:23:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12858 states. [2022-03-15 19:23:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12858 to 9518. [2022-03-15 19:23:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9518 states, 9517 states have (on average 3.308395502784491) internal successors, (31486), 9517 states have internal predecessors, (31486), 0 states have call successors, (0), 0 states have 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:23:46,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9518 states to 9518 states and 31486 transitions. [2022-03-15 19:23:46,263 INFO L78 Accepts]: Start accepts. Automaton has 9518 states and 31486 transitions. Word has length 27 [2022-03-15 19:23:46,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:23:46,263 INFO L470 AbstractCegarLoop]: Abstraction has 9518 states and 31486 transitions. [2022-03-15 19:23:46,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.3207547169811322) internal successors, (123), 53 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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:23:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 9518 states and 31486 transitions. [2022-03-15 19:23:46,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:23:46,276 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:23:46,276 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:23:46,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-03-15 19:23:46,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-03-15 19:23:46,477 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:23:46,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:23:46,477 INFO L85 PathProgramCache]: Analyzing trace with hash -245038876, now seen corresponding path program 75 times [2022-03-15 19:23:46,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:23:46,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84092837] [2022-03-15 19:23:46,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:23:46,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:23:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:23:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:46,612 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:23:46,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84092837] [2022-03-15 19:23:46,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84092837] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:23:46,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159553200] [2022-03-15 19:23:46,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:23:46,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:46,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:23:46,613 INFO L229 MonitoredProcess]: Starting monitored process 78 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:23:46,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-03-15 19:23:46,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:23:46,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:23:46,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:23:46,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:23:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 28 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:46,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:23:47,052 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 28 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:47,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159553200] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:23:47,052 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:23:47,052 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 44 [2022-03-15 19:23:47,052 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1581928556] [2022-03-15 19:23:47,052 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:23:47,054 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:23:47,067 INFO L252 McrAutomatonBuilder]: Finished intersection with 116 states and 220 transitions. [2022-03-15 19:23:47,067 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:23:49,109 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 47 new interpolants: [1024744#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1024710#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1024720#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1024714#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|))), 1024719#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|))), 1024717#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1024733#(<= 7 thread1Thread1of1ForFork1_~i~0), 1024735#(<= 5 thread1Thread1of1ForFork1_~i~0), 1024708#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 1024711#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1024723#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1024705#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1024743#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1024721#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1024703#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1024742#(<= 1 thread1Thread1of1ForFork1_~i~0), 1024745#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1024730#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 5) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1024712#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1024702#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1024729#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 8 ~N~0) (<= ~N~0 5)), 1024709#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0)), 1024725#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 1024726#(or (<= 8 ~N~0) (<= ~N~0 5)), 1024722#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|))), 1024741#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 5)), 1024746#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 5) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1024728#(or (<= 8 ~N~0) (<= ~N~0 5) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1024727#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 8 ~N~0) (<= ~N~0 5)), 1024704#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1024736#(<= 4 thread1Thread1of1ForFork1_~i~0), 1024716#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1024700#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1024715#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|))), 1024724#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= ~N~0 7) (< 8 ~N~0)), 1024706#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 1024731#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 5)), 1024738#(<= 3 thread1Thread1of1ForFork1_~i~0), 1024707#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1024732#(<= 8 ~N~0), 1024718#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1024740#(<= 2 thread1Thread1of1ForFork1_~i~0), 1024737#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 5) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1024734#(<= 6 thread1Thread1of1ForFork1_~i~0), 1024739#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 5) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1024701#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 1024713#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0))] [2022-03-15 19:23:49,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-15 19:23:49,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:23:49,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-15 19:23:49,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=7016, Unknown=0, NotChecked=0, Total=8190 [2022-03-15 19:23:49,110 INFO L87 Difference]: Start difference. First operand 9518 states and 31486 transitions. Second operand has 65 states, 65 states have (on average 2.723076923076923) internal successors, (177), 65 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:24:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:24:03,005 INFO L93 Difference]: Finished difference Result 16630 states and 53222 transitions. [2022-03-15 19:24:03,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2022-03-15 19:24:03,005 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.723076923076923) internal successors, (177), 65 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:24:03,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:24:03,036 INFO L225 Difference]: With dead ends: 16630 [2022-03-15 19:24:03,037 INFO L226 Difference]: Without dead ends: 16628 [2022-03-15 19:24:03,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31595 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=15483, Invalid=79073, Unknown=0, NotChecked=0, Total=94556 [2022-03-15 19:24:03,041 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 606 mSDsluCounter, 2488 mSDsCounter, 0 mSdLazyCounter, 5625 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 5996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 5625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:24:03,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [606 Valid, 88 Invalid, 5996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 5625 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 19:24:03,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16628 states. [2022-03-15 19:24:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16628 to 9460. [2022-03-15 19:24:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9460 states, 9459 states have (on average 3.309969341368009) internal successors, (31309), 9459 states have internal predecessors, (31309), 0 states have call successors, (0), 0 states have 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:24:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9460 states to 9460 states and 31309 transitions. [2022-03-15 19:24:03,273 INFO L78 Accepts]: Start accepts. Automaton has 9460 states and 31309 transitions. Word has length 27 [2022-03-15 19:24:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:24:03,273 INFO L470 AbstractCegarLoop]: Abstraction has 9460 states and 31309 transitions. [2022-03-15 19:24:03,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.723076923076923) internal successors, (177), 65 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:24:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 9460 states and 31309 transitions. [2022-03-15 19:24:03,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:24:03,286 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:24:03,286 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:24:03,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-03-15 19:24:03,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:24:03,487 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:24:03,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:24:03,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1525111874, now seen corresponding path program 76 times [2022-03-15 19:24:03,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:24:03,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441281589] [2022-03-15 19:24:03,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:03,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:24:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:03,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:24:03,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441281589] [2022-03-15 19:24:03,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441281589] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:24:03,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383464707] [2022-03-15 19:24:03,604 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:24:03,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:24:03,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:24:03,605 INFO L229 MonitoredProcess]: Starting monitored process 79 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:24:03,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-03-15 19:24:03,696 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:24:03,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:24:03,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:24:03,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:24:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:03,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:24:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:03,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383464707] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:24:03,895 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:24:03,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 29 [2022-03-15 19:24:03,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [142269639] [2022-03-15 19:24:03,896 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:24:03,897 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:24:03,912 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 232 transitions. [2022-03-15 19:24:03,912 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:24:06,591 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 60 new interpolants: [1061146#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1061144#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1061184#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1061148#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1061182#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1061156#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1061154#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1061149#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1061159#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1061192#(and (or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0))), 1061142#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1061193#(and (or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))) (or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0)))), 1061151#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1061155#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 1061183#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1061187#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1061186#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1061157#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1061171#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1061161#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 8 ~N~0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1061140#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1061145#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1061176#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0))), 1061172#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1061196#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1061150#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1061173#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1061147#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1061175#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 8 ~N~0))), 1061174#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1061198#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1061167#(or (<= 8 ~N~0) (<= ~N~0 6) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1061169#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1061180#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0)), 1061179#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0))), 1061141#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1061162#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1061158#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1061152#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1061194#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 7) (< 8 ~N~0)), 1061160#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1061197#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0)), 1061139#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1061170#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1061168#(or (<= 8 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1061153#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1061165#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1061195#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1061178#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1061164#(or (<= 8 ~N~0) (<= ~N~0 6)), 1061177#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 8 ~N~0)), 1061185#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1061188#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1061143#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1061191#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0))), 1061190#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0))), 1061166#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 8 ~N~0)), 1061181#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1061163#(and (or (<= 8 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1061189#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0)))] [2022-03-15 19:24:06,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-03-15 19:24:06,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:24:06,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-03-15 19:24:06,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=966, Invalid=6866, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 19:24:06,593 INFO L87 Difference]: Start difference. First operand 9460 states and 31309 transitions. Second operand has 79 states, 79 states have (on average 2.518987341772152) internal successors, (199), 79 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have 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:24:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:24:25,157 INFO L93 Difference]: Finished difference Result 16242 states and 52414 transitions. [2022-03-15 19:24:25,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2022-03-15 19:24:25,157 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 2.518987341772152) internal successors, (199), 79 states have internal predecessors, (199), 0 states have call successors, (0), 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:24:25,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:24:25,188 INFO L225 Difference]: With dead ends: 16242 [2022-03-15 19:24:25,188 INFO L226 Difference]: Without dead ends: 16242 [2022-03-15 19:24:25,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 298 SyntacticMatches, 2 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31558 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=14547, Invalid=81243, Unknown=0, NotChecked=0, Total=95790 [2022-03-15 19:24:25,193 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 1130 mSDsluCounter, 2448 mSDsCounter, 0 mSdLazyCounter, 5142 mSolverCounterSat, 759 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 5901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 759 IncrementalHoareTripleChecker+Valid, 5142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:24:25,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1130 Valid, 105 Invalid, 5901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [759 Valid, 5142 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 19:24:25,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16242 states. [2022-03-15 19:24:25,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16242 to 10108. [2022-03-15 19:24:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10108 states, 10107 states have (on average 3.318887899475611) internal successors, (33544), 10107 states have internal predecessors, (33544), 0 states have call successors, (0), 0 states have 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:24:25,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10108 states to 10108 states and 33544 transitions. [2022-03-15 19:24:25,443 INFO L78 Accepts]: Start accepts. Automaton has 10108 states and 33544 transitions. Word has length 28 [2022-03-15 19:24:25,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:24:25,443 INFO L470 AbstractCegarLoop]: Abstraction has 10108 states and 33544 transitions. [2022-03-15 19:24:25,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 2.518987341772152) internal successors, (199), 79 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have 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:24:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 10108 states and 33544 transitions. [2022-03-15 19:24:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:24:25,457 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:24:25,457 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:24:25,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-03-15 19:24:25,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:24:25,658 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:24:25,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:24:25,658 INFO L85 PathProgramCache]: Analyzing trace with hash 839196376, now seen corresponding path program 77 times [2022-03-15 19:24:25,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:24:25,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088828520] [2022-03-15 19:24:25,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:25,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:24:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:25,796 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:24:25,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088828520] [2022-03-15 19:24:25,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088828520] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:24:25,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834158180] [2022-03-15 19:24:25,796 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:24:25,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:24:25,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:24:25,798 INFO L229 MonitoredProcess]: Starting monitored process 80 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:24:25,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-03-15 19:24:25,905 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:24:25,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:24:25,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:24:25,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:24:26,072 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:26,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:24:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:26,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834158180] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:24:26,126 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:24:26,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2022-03-15 19:24:26,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [491647914] [2022-03-15 19:24:26,126 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:24:26,128 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:24:26,139 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 152 transitions. [2022-03-15 19:24:26,139 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:24:27,651 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 42 new interpolants: [1098552#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1098549#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 1098523#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1098551#(or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1098542#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1098532#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1098528#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1098533#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 1098522#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1098518#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1098547#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0))), 1098524#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 6 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1098519#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1098540#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1098515#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1098514#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1098548#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1098550#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1098527#(or (<= 8 ~N~0) (<= ~N~0 6) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1098525#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1098512#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1098537#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1098535#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 1098543#(and (or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1098553#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 6)), 1098516#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1098538#(and (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0))) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1098513#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1098539#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 1098520#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1098531#(or (<= 6 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1098545#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1098521#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1098529#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1098541#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 1098517#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1098544#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1098546#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1098530#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1098536#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1098534#(and (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1098526#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0))] [2022-03-15 19:24:27,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 19:24:27,651 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:24:27,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 19:24:27,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=916, Invalid=4196, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 19:24:27,653 INFO L87 Difference]: Start difference. First operand 10108 states and 33544 transitions. Second operand has 61 states, 61 states have (on average 2.278688524590164) internal successors, (139), 61 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have 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:24:38,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:24:38,343 INFO L93 Difference]: Finished difference Result 15060 states and 47087 transitions. [2022-03-15 19:24:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2022-03-15 19:24:38,344 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.278688524590164) internal successors, (139), 61 states have internal predecessors, (139), 0 states have call successors, (0), 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:24:38,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:24:38,371 INFO L225 Difference]: With dead ends: 15060 [2022-03-15 19:24:38,371 INFO L226 Difference]: Without dead ends: 15056 [2022-03-15 19:24:38,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26077 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=17035, Invalid=62207, Unknown=0, NotChecked=0, Total=79242 [2022-03-15 19:24:38,374 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 705 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 4686 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 5292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 4686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:24:38,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [705 Valid, 57 Invalid, 5292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 4686 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 19:24:38,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15056 states. [2022-03-15 19:24:38,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15056 to 11844. [2022-03-15 19:24:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11844 states, 11843 states have (on average 3.342396352275606) internal successors, (39584), 11843 states have internal predecessors, (39584), 0 states have call successors, (0), 0 states have 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:24:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11844 states to 11844 states and 39584 transitions. [2022-03-15 19:24:38,596 INFO L78 Accepts]: Start accepts. Automaton has 11844 states and 39584 transitions. Word has length 28 [2022-03-15 19:24:38,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:24:38,596 INFO L470 AbstractCegarLoop]: Abstraction has 11844 states and 39584 transitions. [2022-03-15 19:24:38,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.278688524590164) internal successors, (139), 61 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have 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:24:38,596 INFO L276 IsEmpty]: Start isEmpty. Operand 11844 states and 39584 transitions. [2022-03-15 19:24:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:24:38,613 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:24:38,614 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:24:38,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2022-03-15 19:24:38,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:24:38,814 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:24:38,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:24:38,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1837327742, now seen corresponding path program 78 times [2022-03-15 19:24:38,815 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:24:38,815 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13661909] [2022-03-15 19:24:38,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:38,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:24:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:38,953 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:38,954 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:24:38,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13661909] [2022-03-15 19:24:38,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13661909] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:24:38,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226302840] [2022-03-15 19:24:38,954 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:24:38,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:24:38,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:24:38,956 INFO L229 MonitoredProcess]: Starting monitored process 81 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:24:38,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-03-15 19:24:39,085 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:24:39,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:24:39,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:24:39,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:24:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:39,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:24:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:39,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226302840] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:24:39,359 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:24:39,359 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2022-03-15 19:24:39,359 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1340277643] [2022-03-15 19:24:39,359 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:24:39,360 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:24:39,444 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 156 transitions. [2022-03-15 19:24:39,444 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:24:40,989 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 42 new interpolants: [1138146#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 1138134#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1138137#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1138132#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1138126#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1138131#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1138147#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1138128#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1138154#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1138149#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1138157#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1138124#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1138156#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1138162#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0))), 1138145#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 1138164#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 1138150#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 6)), 1138130#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1138138#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1138139#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1138155#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1138151#(or (<= 8 ~N~0) (<= ~N~0 6) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1138163#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1138165#(or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1138153#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1138148#(and (or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1138142#(and (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0))) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1138143#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1138133#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1138135#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1138152#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1138161#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 1138160#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 1138129#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1138144#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1138141#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1138140#(and (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1138158#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1138127#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1138136#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 6 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1138125#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1138159#(or (<= 6 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))] [2022-03-15 19:24:40,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 19:24:40,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:24:40,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 19:24:40,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=4251, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 19:24:40,991 INFO L87 Difference]: Start difference. First operand 11844 states and 39584 transitions. Second operand has 61 states, 61 states have (on average 2.2950819672131146) internal successors, (140), 61 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have 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:24:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:24:54,122 INFO L93 Difference]: Finished difference Result 17046 states and 53108 transitions. [2022-03-15 19:24:54,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2022-03-15 19:24:54,122 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.2950819672131146) internal successors, (140), 61 states have internal predecessors, (140), 0 states have call successors, (0), 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:24:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:24:54,154 INFO L225 Difference]: With dead ends: 17046 [2022-03-15 19:24:54,154 INFO L226 Difference]: Without dead ends: 17028 [2022-03-15 19:24:54,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36497 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=19684, Invalid=83678, Unknown=0, NotChecked=0, Total=103362 [2022-03-15 19:24:54,159 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 875 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 4560 mSolverCounterSat, 770 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 5330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 770 IncrementalHoareTripleChecker+Valid, 4560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:24:54,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [875 Valid, 41 Invalid, 5330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [770 Valid, 4560 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 19:24:54,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17028 states. [2022-03-15 19:24:54,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17028 to 12474. [2022-03-15 19:24:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12474 states, 12473 states have (on average 3.3458670728774154) internal successors, (41733), 12473 states have internal predecessors, (41733), 0 states have call successors, (0), 0 states have 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:24:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12474 states to 12474 states and 41733 transitions. [2022-03-15 19:24:54,473 INFO L78 Accepts]: Start accepts. Automaton has 12474 states and 41733 transitions. Word has length 28 [2022-03-15 19:24:54,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:24:54,474 INFO L470 AbstractCegarLoop]: Abstraction has 12474 states and 41733 transitions. [2022-03-15 19:24:54,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.2950819672131146) internal successors, (140), 61 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have 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:24:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 12474 states and 41733 transitions. [2022-03-15 19:24:54,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:24:54,490 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:24:54,490 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:24:54,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2022-03-15 19:24:54,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:24:54,690 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:24:54,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:24:54,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1089770520, now seen corresponding path program 79 times [2022-03-15 19:24:54,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:24:54,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199164987] [2022-03-15 19:24:54,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:54,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:24:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:54,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:24:54,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199164987] [2022-03-15 19:24:54,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199164987] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:24:54,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080689609] [2022-03-15 19:24:54,811 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:24:54,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:24:54,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:24:54,813 INFO L229 MonitoredProcess]: Starting monitored process 82 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:24:54,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-03-15 19:24:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:54,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:24:54,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:24:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:55,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:24:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:55,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080689609] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:24:55,144 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:24:55,144 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2022-03-15 19:24:55,145 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [253479167] [2022-03-15 19:24:55,145 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:24:55,146 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:24:55,158 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 165 transitions. [2022-03-15 19:24:55,158 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:24:56,985 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 44 new interpolants: [1181109#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1181127#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 6 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1181141#(and (or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1181111#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1181106#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1181103#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1181116#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1181136#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1181135#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1181104#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1181113#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1181115#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1181142#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1181143#(or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1181132#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 1181137#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 1181130#(and (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0))) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1181125#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1181121#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1181105#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1181128#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1181117#(or (<= 8 ~N~0) (<= ~N~0 6) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1181122#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1181107#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1181124#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1181126#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1181129#(and (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1181145#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 6)), 1181114#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1181118#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1181138#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 1181120#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1181140#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 1181102#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1181110#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1181119#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1181133#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 1181108#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1181139#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1181112#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1181144#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1181134#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0))), 1181123#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1181131#(or (<= 6 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))] [2022-03-15 19:24:56,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 19:24:56,986 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:24:56,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 19:24:56,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=4567, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 19:24:56,986 INFO L87 Difference]: Start difference. First operand 12474 states and 41733 transitions. Second operand has 63 states, 63 states have (on average 2.3333333333333335) internal successors, (147), 63 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have 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:25:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:25:10,958 INFO L93 Difference]: Finished difference Result 18082 states and 56346 transitions. [2022-03-15 19:25:10,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2022-03-15 19:25:10,958 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.3333333333333335) internal successors, (147), 63 states have internal predecessors, (147), 0 states have call successors, (0), 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:25:10,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:25:10,993 INFO L225 Difference]: With dead ends: 18082 [2022-03-15 19:25:10,993 INFO L226 Difference]: Without dead ends: 18040 [2022-03-15 19:25:10,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38247 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=20288, Invalid=88942, Unknown=0, NotChecked=0, Total=109230 [2022-03-15 19:25:10,999 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 825 mSDsluCounter, 2038 mSDsCounter, 0 mSdLazyCounter, 5302 mSolverCounterSat, 742 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 6044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 742 IncrementalHoareTripleChecker+Valid, 5302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:25:10,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [825 Valid, 55 Invalid, 6044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [742 Valid, 5302 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 19:25:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18040 states. [2022-03-15 19:25:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18040 to 12666. [2022-03-15 19:25:11,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12666 states, 12665 states have (on average 3.3441768653770234) internal successors, (42354), 12665 states have internal predecessors, (42354), 0 states have call successors, (0), 0 states have 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:25:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12666 states to 12666 states and 42354 transitions. [2022-03-15 19:25:11,282 INFO L78 Accepts]: Start accepts. Automaton has 12666 states and 42354 transitions. Word has length 28 [2022-03-15 19:25:11,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:25:11,282 INFO L470 AbstractCegarLoop]: Abstraction has 12666 states and 42354 transitions. [2022-03-15 19:25:11,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.3333333333333335) internal successors, (147), 63 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have 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:25:11,282 INFO L276 IsEmpty]: Start isEmpty. Operand 12666 states and 42354 transitions. [2022-03-15 19:25:11,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:25:11,300 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:25:11,300 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:25:11,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-03-15 19:25:11,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:11,501 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:25:11,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:25:11,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1635503426, now seen corresponding path program 80 times [2022-03-15 19:25:11,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:25:11,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932965255] [2022-03-15 19:25:11,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:25:11,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:25:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:25:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:11,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:25:11,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932965255] [2022-03-15 19:25:11,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932965255] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:25:11,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453619841] [2022-03-15 19:25:11,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:25:11,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:11,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:25:11,626 INFO L229 MonitoredProcess]: Starting monitored process 83 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:25:11,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-03-15 19:25:11,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:25:11,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:25:11,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:25:11,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:25:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:11,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:25:11,956 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:11,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453619841] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:25:11,956 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:25:11,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2022-03-15 19:25:11,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1292185997] [2022-03-15 19:25:11,956 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:25:11,959 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:25:11,971 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 174 transitions. [2022-03-15 19:25:11,971 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:25:13,765 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 46 new interpolants: [1225558#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1225559#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1225562#(and (or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1225547#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 6 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1225544#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1225526#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1225527#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1225538#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1225566#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1225531#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1225552#(or (<= 6 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1225535#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1225550#(and (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0))) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1225543#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1225564#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1225553#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 1225551#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 1225548#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1225568#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1225537#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1225560#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1225554#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 1225555#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0))), 1225545#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1225561#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 1225565#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 1225557#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1225532#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1225563#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 6)), 1225556#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1225528#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1225533#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1225567#(or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1225546#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1225540#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1225525#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1225542#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1225523#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1225529#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1225536#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1225541#(or (<= 8 ~N~0) (<= ~N~0 6) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1225539#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1225524#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1225534#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1225549#(and (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1225530#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)))] [2022-03-15 19:25:13,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-15 19:25:13,765 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:25:13,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-15 19:25:13,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=4877, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 19:25:13,766 INFO L87 Difference]: Start difference. First operand 12666 states and 42354 transitions. Second operand has 65 states, 65 states have (on average 2.3692307692307693) internal successors, (154), 65 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:25:27,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:25:27,530 INFO L93 Difference]: Finished difference Result 18560 states and 58333 transitions. [2022-03-15 19:25:27,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2022-03-15 19:25:27,531 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.3692307692307693) internal successors, (154), 65 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:25:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:25:27,568 INFO L225 Difference]: With dead ends: 18560 [2022-03-15 19:25:27,568 INFO L226 Difference]: Without dead ends: 18494 [2022-03-15 19:25:27,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36185 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=19319, Invalid=85981, Unknown=0, NotChecked=0, Total=105300 [2022-03-15 19:25:27,573 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 803 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 4919 mSolverCounterSat, 616 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 5535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 616 IncrementalHoareTripleChecker+Valid, 4919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:25:27,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [803 Valid, 60 Invalid, 5535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [616 Valid, 4919 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 19:25:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18494 states. [2022-03-15 19:25:27,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18494 to 12612. [2022-03-15 19:25:27,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12612 states, 12611 states have (on average 3.3403378003330424) internal successors, (42125), 12611 states have internal predecessors, (42125), 0 states have call successors, (0), 0 states have 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:25:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12612 states to 12612 states and 42125 transitions. [2022-03-15 19:25:27,834 INFO L78 Accepts]: Start accepts. Automaton has 12612 states and 42125 transitions. Word has length 28 [2022-03-15 19:25:27,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:25:27,834 INFO L470 AbstractCegarLoop]: Abstraction has 12612 states and 42125 transitions. [2022-03-15 19:25:27,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.3692307692307693) internal successors, (154), 65 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:25:27,834 INFO L276 IsEmpty]: Start isEmpty. Operand 12612 states and 42125 transitions. [2022-03-15 19:25:27,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:25:27,935 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:25:27,936 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:25:27,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2022-03-15 19:25:28,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable83 [2022-03-15 19:25:28,136 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:25:28,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:25:28,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1373354328, now seen corresponding path program 81 times [2022-03-15 19:25:28,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:25:28,139 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641471454] [2022-03-15 19:25:28,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:25:28,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:25:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:25:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:28,264 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:25:28,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641471454] [2022-03-15 19:25:28,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641471454] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:25:28,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014579446] [2022-03-15 19:25:28,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:25:28,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:28,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:25:28,265 INFO L229 MonitoredProcess]: Starting monitored process 84 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:25:28,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-03-15 19:25:28,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:25:28,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:25:28,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:25:28,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:25:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:28,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:25:28,602 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:28,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014579446] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:25:28,602 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:25:28,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2022-03-15 19:25:28,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1566220005] [2022-03-15 19:25:28,602 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:25:28,605 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:25:28,620 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 183 transitions. [2022-03-15 19:25:28,620 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:25:30,586 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 48 new interpolants: [1270296#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1270314#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1270332#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 1270331#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 1270309#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1270307#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 6 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1270320#(and (or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1270337#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1270313#(and (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0))) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1270299#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1270318#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 1270338#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1270305#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1270326#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1270330#(or (<= 6 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1270295#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1270333#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0))), 1270323#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1270312#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1270329#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1270311#(and (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1270303#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1270294#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1270334#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1270321#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 6)), 1270300#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1270308#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1270322#(or (<= 8 ~N~0) (<= ~N~0 6) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1270324#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1270306#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1270335#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 1270292#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1270293#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1270339#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 1270310#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1270336#(or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1270297#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1270304#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1270327#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1270302#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1270319#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 1270301#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1270298#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1270317#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1270315#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1270316#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1270325#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1270328#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6))] [2022-03-15 19:25:30,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-03-15 19:25:30,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:25:30,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-03-15 19:25:30,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=5181, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 19:25:30,587 INFO L87 Difference]: Start difference. First operand 12612 states and 42125 transitions. Second operand has 67 states, 67 states have (on average 2.4029850746268657) internal successors, (161), 67 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have 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:25:43,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:25:43,859 INFO L93 Difference]: Finished difference Result 19204 states and 60935 transitions. [2022-03-15 19:25:43,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2022-03-15 19:25:43,859 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.4029850746268657) internal successors, (161), 67 states have internal predecessors, (161), 0 states have call successors, (0), 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:25:43,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:25:43,900 INFO L225 Difference]: With dead ends: 19204 [2022-03-15 19:25:43,900 INFO L226 Difference]: Without dead ends: 19090 [2022-03-15 19:25:43,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33408 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=17736, Invalid=81174, Unknown=0, NotChecked=0, Total=98910 [2022-03-15 19:25:43,905 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 745 mSDsluCounter, 2188 mSDsCounter, 0 mSdLazyCounter, 5240 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 5732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 5240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:25:43,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [745 Valid, 66 Invalid, 5732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 5240 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 19:25:43,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19090 states. [2022-03-15 19:25:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19090 to 12772. [2022-03-15 19:25:44,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12772 states, 12771 states have (on average 3.335134288622661) internal successors, (42593), 12771 states have internal predecessors, (42593), 0 states have call successors, (0), 0 states have 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:25:44,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12772 states to 12772 states and 42593 transitions. [2022-03-15 19:25:44,181 INFO L78 Accepts]: Start accepts. Automaton has 12772 states and 42593 transitions. Word has length 28 [2022-03-15 19:25:44,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:25:44,181 INFO L470 AbstractCegarLoop]: Abstraction has 12772 states and 42593 transitions. [2022-03-15 19:25:44,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.4029850746268657) internal successors, (161), 67 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have 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:25:44,181 INFO L276 IsEmpty]: Start isEmpty. Operand 12772 states and 42593 transitions. [2022-03-15 19:25:44,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:25:44,204 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:25:44,204 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:25:44,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Forceful destruction successful, exit code 0 [2022-03-15 19:25:44,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:44,404 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:25:44,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:25:44,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1836666882, now seen corresponding path program 82 times [2022-03-15 19:25:44,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:25:44,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673769236] [2022-03-15 19:25:44,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:25:44,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:25:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:25:44,582 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:44,582 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:25:44,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673769236] [2022-03-15 19:25:44,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673769236] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:25:44,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322986785] [2022-03-15 19:25:44,582 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:25:44,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:44,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:25:44,583 INFO L229 MonitoredProcess]: Starting monitored process 85 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:25:44,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-03-15 19:25:44,681 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:25:44,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:25:44,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:25:44,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:25:44,837 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:44,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:25:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:44,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322986785] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:25:44,895 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:25:44,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2022-03-15 19:25:44,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1569842551] [2022-03-15 19:25:44,895 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:25:44,897 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:25:44,910 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 192 transitions. [2022-03-15 19:25:44,911 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:25:46,908 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 50 new interpolants: [1316033#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0))), 1316025#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1316001#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 1315995#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1315993#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1316038#(or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1316026#(and (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1316000#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1316031#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 1316003#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1316017#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1315999#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1316019#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1316008#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1316022#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1316002#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1316034#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1316018#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1316027#(and (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0))) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1316039#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1315998#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1316004#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1316023#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1316030#(or (<= 6 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1315991#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1316007#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1315994#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1315997#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1316037#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1316005#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1316021#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1316011#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1316016#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1316020#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1316010#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1316024#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 6 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1316006#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1316040#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 6)), 1316012#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1316014#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1316015#(or (<= 8 ~N~0) (<= ~N~0 6) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1315992#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1316035#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 1316029#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 1316036#(and (or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1316028#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 1316013#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1315996#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1316009#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1316032#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))] [2022-03-15 19:25:46,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-03-15 19:25:46,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:25:46,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-03-15 19:25:46,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=841, Invalid=5479, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 19:25:46,910 INFO L87 Difference]: Start difference. First operand 12772 states and 42593 transitions. Second operand has 69 states, 69 states have (on average 2.4347826086956523) internal successors, (168), 69 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:25:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:25:59,033 INFO L93 Difference]: Finished difference Result 19970 states and 63819 transitions. [2022-03-15 19:25:59,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2022-03-15 19:25:59,033 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.4347826086956523) internal successors, (168), 69 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:25:59,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:25:59,072 INFO L225 Difference]: With dead ends: 19970 [2022-03-15 19:25:59,072 INFO L226 Difference]: Without dead ends: 19784 [2022-03-15 19:25:59,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27591 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15385, Invalid=68425, Unknown=0, NotChecked=0, Total=83810 [2022-03-15 19:25:59,075 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 698 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 5082 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 5631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 5082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:25:59,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [698 Valid, 58 Invalid, 5631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 5082 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 19:25:59,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19784 states. [2022-03-15 19:25:59,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19784 to 13180. [2022-03-15 19:25:59,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13180 states, 13179 states have (on average 3.33044995826694) internal successors, (43892), 13179 states have internal predecessors, (43892), 0 states have call successors, (0), 0 states have 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:25:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13180 states to 13180 states and 43892 transitions. [2022-03-15 19:25:59,336 INFO L78 Accepts]: Start accepts. Automaton has 13180 states and 43892 transitions. Word has length 28 [2022-03-15 19:25:59,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:25:59,336 INFO L470 AbstractCegarLoop]: Abstraction has 13180 states and 43892 transitions. [2022-03-15 19:25:59,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.4347826086956523) internal successors, (168), 69 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:25:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 13180 states and 43892 transitions. [2022-03-15 19:25:59,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:25:59,357 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:25:59,357 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:25:59,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2022-03-15 19:25:59,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:59,558 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:25:59,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:25:59,558 INFO L85 PathProgramCache]: Analyzing trace with hash -980513128, now seen corresponding path program 83 times [2022-03-15 19:25:59,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:25:59,559 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850227551] [2022-03-15 19:25:59,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:25:59,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:25:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:25:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:59,679 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:25:59,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850227551] [2022-03-15 19:25:59,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850227551] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:25:59,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982869856] [2022-03-15 19:25:59,679 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:25:59,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:59,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:25:59,681 INFO L229 MonitoredProcess]: Starting monitored process 86 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:25:59,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-03-15 19:25:59,783 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:25:59,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:25:59,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:25:59,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:25:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:59,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:25:59,994 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:59,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982869856] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:25:59,994 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:25:59,994 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2022-03-15 19:25:59,995 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1465207566] [2022-03-15 19:25:59,995 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:25:59,997 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:00,014 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 201 transitions. [2022-03-15 19:26:00,014 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:02,241 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 52 new interpolants: [1363227#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1363200#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1363212#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1363241#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1363231#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1363201#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1363209#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1363235#(or (<= 6 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1363195#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1363213#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1363234#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 1363204#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1363225#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1363205#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1363239#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1363240#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 1363244#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1363219#(and (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0))) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1363198#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1363208#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1363197#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1363230#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1363232#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1363207#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1363218#(and (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1363228#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1363202#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1363196#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1363220#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 1363222#(and (or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1363206#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1363243#(or (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1363226#(or (<= 8 ~N~0) (<= ~N~0 6) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1363194#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1363193#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1363221#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 1363210#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1363237#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 1363236#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 1363214#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1363215#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1363229#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1363217#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1363216#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 6 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1363211#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1363199#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1363233#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1363238#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0))), 1363242#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1363223#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1363224#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 6)), 1363203#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)))] [2022-03-15 19:26:02,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-03-15 19:26:02,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:02,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-03-15 19:26:02,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=5771, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 19:26:02,243 INFO L87 Difference]: Start difference. First operand 13180 states and 43892 transitions. Second operand has 71 states, 71 states have (on average 2.464788732394366) internal successors, (175), 71 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have 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:26:14,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:14,091 INFO L93 Difference]: Finished difference Result 21582 states and 69499 transitions. [2022-03-15 19:26:14,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2022-03-15 19:26:14,091 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.464788732394366) internal successors, (175), 71 states have internal predecessors, (175), 0 states have call successors, (0), 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:26:14,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:14,134 INFO L225 Difference]: With dead ends: 21582 [2022-03-15 19:26:14,134 INFO L226 Difference]: Without dead ends: 21412 [2022-03-15 19:26:14,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 275 SyntacticMatches, 1 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26800 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15286, Invalid=66224, Unknown=0, NotChecked=0, Total=81510 [2022-03-15 19:26:14,138 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 714 mSDsluCounter, 2110 mSDsCounter, 0 mSdLazyCounter, 4686 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 4686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:14,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [714 Valid, 54 Invalid, 5239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 4686 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 19:26:14,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21412 states. [2022-03-15 19:26:14,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21412 to 13438. [2022-03-15 19:26:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13438 states, 13437 states have (on average 3.3220212845129122) internal successors, (44638), 13437 states have internal predecessors, (44638), 0 states have call successors, (0), 0 states have 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:26:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13438 states to 13438 states and 44638 transitions. [2022-03-15 19:26:14,413 INFO L78 Accepts]: Start accepts. Automaton has 13438 states and 44638 transitions. Word has length 28 [2022-03-15 19:26:14,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:14,413 INFO L470 AbstractCegarLoop]: Abstraction has 13438 states and 44638 transitions. [2022-03-15 19:26:14,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.464788732394366) internal successors, (175), 71 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have 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:26:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 13438 states and 44638 transitions. [2022-03-15 19:26:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:26:14,434 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:14,434 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:14,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Ended with exit code 0 [2022-03-15 19:26:14,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:14,634 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:26:14,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:14,635 INFO L85 PathProgramCache]: Analyzing trace with hash 925580876, now seen corresponding path program 84 times [2022-03-15 19:26:14,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:14,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804114232] [2022-03-15 19:26:14,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:14,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 11 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:14,744 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:14,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804114232] [2022-03-15 19:26:14,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804114232] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:14,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276659065] [2022-03-15 19:26:14,744 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:26:14,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:14,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:14,746 INFO L229 MonitoredProcess]: Starting monitored process 87 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:26:14,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-03-15 19:26:14,864 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 19:26:14,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:26:14,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:26:14,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:15,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:26:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 16 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:15,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276659065] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:26:15,092 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:26:15,092 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 18] total 30 [2022-03-15 19:26:15,093 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1924478531] [2022-03-15 19:26:15,093 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:15,094 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:15,105 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 147 transitions. [2022-03-15 19:26:15,105 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:16,570 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 39 new interpolants: [1412521#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1412520#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1412543#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1412532#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1412526#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1412523#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1412512#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1412534#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 1412542#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))), 1412538#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1412522#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1412517#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1412519#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1412540#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 1412545#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 5)), 1412541#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1412509#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1412531#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1412524#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1412539#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0)), 1412510#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1412515#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1412529#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1412527#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1412544#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1412508#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1412535#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1412514#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1412513#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1412511#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1412507#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1412525#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1412518#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1412536#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 1412537#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 1412528#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1412516#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1412530#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1412533#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0)))] [2022-03-15 19:26:16,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-15 19:26:16,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:16,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-15 19:26:16,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=799, Invalid=3893, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 19:26:16,572 INFO L87 Difference]: Start difference. First operand 13438 states and 44638 transitions. Second operand has 57 states, 57 states have (on average 2.3157894736842106) internal successors, (132), 57 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:25,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:25,603 INFO L93 Difference]: Finished difference Result 18734 states and 58333 transitions. [2022-03-15 19:26:25,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2022-03-15 19:26:25,603 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.3157894736842106) internal successors, (132), 57 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:26:25,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:25,641 INFO L225 Difference]: With dead ends: 18734 [2022-03-15 19:26:25,641 INFO L226 Difference]: Without dead ends: 18716 [2022-03-15 19:26:25,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20853 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=13165, Invalid=50087, Unknown=0, NotChecked=0, Total=63252 [2022-03-15 19:26:25,644 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 751 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 3845 mSolverCounterSat, 580 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 4425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 580 IncrementalHoareTripleChecker+Valid, 3845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:25,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [751 Valid, 40 Invalid, 4425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [580 Valid, 3845 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 19:26:25,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18716 states. [2022-03-15 19:26:25,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18716 to 14098. [2022-03-15 19:26:25,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14098 states, 14097 states have (on average 3.32921898276229) internal successors, (46932), 14097 states have internal predecessors, (46932), 0 states have call successors, (0), 0 states have 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:26:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14098 states to 14098 states and 46932 transitions. [2022-03-15 19:26:25,951 INFO L78 Accepts]: Start accepts. Automaton has 14098 states and 46932 transitions. Word has length 28 [2022-03-15 19:26:25,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:25,951 INFO L470 AbstractCegarLoop]: Abstraction has 14098 states and 46932 transitions. [2022-03-15 19:26:25,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.3157894736842106) internal successors, (132), 57 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 14098 states and 46932 transitions. [2022-03-15 19:26:25,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:26:25,973 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:25,973 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:25,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2022-03-15 19:26:26,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:26,174 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:26:26,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:26,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2042726012, now seen corresponding path program 85 times [2022-03-15 19:26:26,175 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:26,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597514548] [2022-03-15 19:26:26,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:26,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 11 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:26,285 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:26,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597514548] [2022-03-15 19:26:26,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597514548] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:26,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111595204] [2022-03-15 19:26:26,285 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:26:26,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:26,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:26,287 INFO L229 MonitoredProcess]: Starting monitored process 88 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:26:26,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-03-15 19:26:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:26,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:26:26,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:26,583 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:26,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:26:26,639 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 16 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:26,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111595204] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:26:26,639 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:26:26,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 18] total 30 [2022-03-15 19:26:26,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1306086832] [2022-03-15 19:26:26,639 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:26,641 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:26,652 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 156 transitions. [2022-03-15 19:26:26,652 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:28,196 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [1460235#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 1460220#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1460221#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1460219#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1460222#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1460229#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1460217#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1460244#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1460232#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1460230#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1460238#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1460243#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 5)), 1460226#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1460250#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1460257#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1460228#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1460218#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1460239#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 1460248#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1460247#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1460256#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1460234#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1460245#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1460253#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1460231#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1460225#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1460254#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))), 1460255#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1460224#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1460233#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0))), 1460227#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1460249#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1460240#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1460223#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1460242#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1460251#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0)), 1460246#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1460241#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 1460252#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 1460236#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1460237#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)))] [2022-03-15 19:26:28,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-03-15 19:26:28,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:28,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-03-15 19:26:28,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=775, Invalid=4195, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 19:26:28,197 INFO L87 Difference]: Start difference. First operand 14098 states and 46932 transitions. Second operand has 59 states, 59 states have (on average 2.3559322033898304) internal successors, (139), 59 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have 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:26:38,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:38,638 INFO L93 Difference]: Finished difference Result 19134 states and 59686 transitions. [2022-03-15 19:26:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2022-03-15 19:26:38,638 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.3559322033898304) internal successors, (139), 59 states have internal predecessors, (139), 0 states have call successors, (0), 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:26:38,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:38,676 INFO L225 Difference]: With dead ends: 19134 [2022-03-15 19:26:38,676 INFO L226 Difference]: Without dead ends: 19092 [2022-03-15 19:26:38,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24568 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=14434, Invalid=58736, Unknown=0, NotChecked=0, Total=73170 [2022-03-15 19:26:38,680 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 729 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 4172 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 4747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 4172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:38,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [729 Valid, 49 Invalid, 4747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 4172 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 19:26:38,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19092 states. [2022-03-15 19:26:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19092 to 14014. [2022-03-15 19:26:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14014 states, 14013 states have (on average 3.3268393634482267) internal successors, (46619), 14013 states have internal predecessors, (46619), 0 states have call successors, (0), 0 states have 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:26:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14014 states to 14014 states and 46619 transitions. [2022-03-15 19:26:38,989 INFO L78 Accepts]: Start accepts. Automaton has 14014 states and 46619 transitions. Word has length 28 [2022-03-15 19:26:38,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:38,989 INFO L470 AbstractCegarLoop]: Abstraction has 14014 states and 46619 transitions. [2022-03-15 19:26:38,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.3559322033898304) internal successors, (139), 59 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have 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:26:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand 14014 states and 46619 transitions. [2022-03-15 19:26:39,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:26:39,011 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:39,011 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:39,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Ended with exit code 0 [2022-03-15 19:26:39,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:39,211 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:26:39,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:39,212 INFO L85 PathProgramCache]: Analyzing trace with hash 429040972, now seen corresponding path program 86 times [2022-03-15 19:26:39,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:39,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80739050] [2022-03-15 19:26:39,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:39,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 11 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:39,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:39,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80739050] [2022-03-15 19:26:39,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80739050] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:39,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887621870] [2022-03-15 19:26:39,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:26:39,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:39,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:39,325 INFO L229 MonitoredProcess]: Starting monitored process 89 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:26:39,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-03-15 19:26:39,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:26:39,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:26:39,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:26:39,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:39,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:26:39,657 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 16 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:39,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887621870] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:26:39,657 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:26:39,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 18] total 30 [2022-03-15 19:26:39,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [682166802] [2022-03-15 19:26:39,658 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:39,659 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:39,670 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 165 transitions. [2022-03-15 19:26:39,671 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:41,409 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [1508216#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1508215#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1508242#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1508240#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 5)), 1508248#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 1508239#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 1508213#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1508243#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1508229#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1508247#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0)), 1508244#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1508221#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1508225#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1508227#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1508220#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1508236#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 1508245#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1508219#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1508237#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1508217#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1508251#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))), 1508212#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1508222#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1508253#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1508238#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 1508214#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1508246#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1508235#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0))), 1508250#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1508231#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1508226#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1508218#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1508234#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1508230#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1508252#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1508232#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1508241#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1508228#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1508249#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1508223#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1508254#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1508224#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1508233#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0))] [2022-03-15 19:26:41,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 19:26:41,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:41,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 19:26:41,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=4491, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 19:26:41,410 INFO L87 Difference]: Start difference. First operand 14014 states and 46619 transitions. Second operand has 61 states, 61 states have (on average 2.3934426229508197) internal successors, (146), 61 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have 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:26:52,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:52,092 INFO L93 Difference]: Finished difference Result 18894 states and 59414 transitions. [2022-03-15 19:26:52,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2022-03-15 19:26:52,093 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.3934426229508197) internal successors, (146), 61 states have internal predecessors, (146), 0 states have call successors, (0), 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:26:52,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:52,130 INFO L225 Difference]: With dead ends: 18894 [2022-03-15 19:26:52,130 INFO L226 Difference]: Without dead ends: 18820 [2022-03-15 19:26:52,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24071 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13535, Invalid=59095, Unknown=0, NotChecked=0, Total=72630 [2022-03-15 19:26:52,134 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 617 mSDsluCounter, 1817 mSDsCounter, 0 mSdLazyCounter, 4445 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 4857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 4445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:52,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 47 Invalid, 4857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 4445 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 19:26:52,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18820 states. [2022-03-15 19:26:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18820 to 14054. [2022-03-15 19:26:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14054 states, 14053 states have (on average 3.3247705116345263) internal successors, (46723), 14053 states have internal predecessors, (46723), 0 states have call successors, (0), 0 states have 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:26:52,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14054 states to 14054 states and 46723 transitions. [2022-03-15 19:26:52,420 INFO L78 Accepts]: Start accepts. Automaton has 14054 states and 46723 transitions. Word has length 28 [2022-03-15 19:26:52,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:52,420 INFO L470 AbstractCegarLoop]: Abstraction has 14054 states and 46723 transitions. [2022-03-15 19:26:52,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.3934426229508197) internal successors, (146), 61 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have 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:26:52,420 INFO L276 IsEmpty]: Start isEmpty. Operand 14054 states and 46723 transitions. [2022-03-15 19:26:52,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:26:52,442 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:52,442 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:52,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2022-03-15 19:26:52,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2022-03-15 19:26:52,642 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:26:52,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:52,643 INFO L85 PathProgramCache]: Analyzing trace with hash -255593852, now seen corresponding path program 87 times [2022-03-15 19:26:52,643 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:52,643 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444471065] [2022-03-15 19:26:52,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:52,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 11 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:52,779 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:52,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444471065] [2022-03-15 19:26:52,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444471065] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:52,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418259773] [2022-03-15 19:26:52,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:26:52,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:52,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:52,781 INFO L229 MonitoredProcess]: Starting monitored process 90 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:26:52,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-03-15 19:26:52,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:26:52,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:26:52,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:26:52,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:53,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:26:53,222 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 16 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:53,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418259773] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:26:53,222 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:26:53,222 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 18] total 30 [2022-03-15 19:26:53,222 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1497027317] [2022-03-15 19:26:53,222 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:53,224 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:53,235 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 174 transitions. [2022-03-15 19:26:53,235 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:54,987 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 45 new interpolants: [1556056#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1556050#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 1556066#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1556081#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))), 1556058#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1556054#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1556045#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1556069#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1556044#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1556071#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1556049#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1556061#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0))), 1556068#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1556072#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1556077#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1556064#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1556048#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1556075#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 1556082#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1556055#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1556059#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1556073#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1556053#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1556047#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1556076#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 1556062#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1556051#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1556078#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0)), 1556043#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1556042#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1556052#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1556080#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1556084#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 5)), 1556057#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1556065#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1556083#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1556079#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 1556070#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1556040#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1556067#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1556060#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1556046#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1556063#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 1556074#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1556041#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0))] [2022-03-15 19:26:54,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 19:26:54,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:54,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 19:26:54,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=769, Invalid=4781, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 19:26:54,989 INFO L87 Difference]: Start difference. First operand 14054 states and 46723 transitions. Second operand has 63 states, 63 states have (on average 2.4285714285714284) internal successors, (153), 63 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have 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:27:05,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:27:05,017 INFO L93 Difference]: Finished difference Result 19118 states and 60787 transitions. [2022-03-15 19:27:05,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2022-03-15 19:27:05,017 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.4285714285714284) internal successors, (153), 63 states have internal predecessors, (153), 0 states have call successors, (0), 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:27:05,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:27:05,055 INFO L225 Difference]: With dead ends: 19118 [2022-03-15 19:27:05,055 INFO L226 Difference]: Without dead ends: 19004 [2022-03-15 19:27:05,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21354 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=11651, Invalid=54141, Unknown=0, NotChecked=0, Total=65792 [2022-03-15 19:27:05,060 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 629 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4303 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 4732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 4303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:27:05,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 43 Invalid, 4732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 4303 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 19:27:05,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19004 states. [2022-03-15 19:27:05,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19004 to 14264. [2022-03-15 19:27:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14264 states, 14263 states have (on average 3.322863352730842) internal successors, (47394), 14263 states have internal predecessors, (47394), 0 states have call successors, (0), 0 states have 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:27:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14264 states to 14264 states and 47394 transitions. [2022-03-15 19:27:05,354 INFO L78 Accepts]: Start accepts. Automaton has 14264 states and 47394 transitions. Word has length 28 [2022-03-15 19:27:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:27:05,354 INFO L470 AbstractCegarLoop]: Abstraction has 14264 states and 47394 transitions. [2022-03-15 19:27:05,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.4285714285714284) internal successors, (153), 63 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have 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:27:05,355 INFO L276 IsEmpty]: Start isEmpty. Operand 14264 states and 47394 transitions. [2022-03-15 19:27:05,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:27:05,376 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:27:05,376 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:27:05,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2022-03-15 19:27:05,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:05,576 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:27:05,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:27:05,577 INFO L85 PathProgramCache]: Analyzing trace with hash -4436916, now seen corresponding path program 88 times [2022-03-15 19:27:05,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:27:05,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539544397] [2022-03-15 19:27:05,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:27:05,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:27:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 11 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:27:05,691 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:27:05,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539544397] [2022-03-15 19:27:05,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539544397] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:27:05,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846317645] [2022-03-15 19:27:05,691 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:27:05,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:05,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:27:05,692 INFO L229 MonitoredProcess]: Starting monitored process 91 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:27:05,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-03-15 19:27:05,795 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:27:05,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:27:05,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:27:05,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:27:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:27:06,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:27:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 16 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:27:06,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846317645] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:27:06,074 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:27:06,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 18] total 30 [2022-03-15 19:27:06,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [461274778] [2022-03-15 19:27:06,074 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:27:06,076 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:27:06,092 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 183 transitions. [2022-03-15 19:27:06,092 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:27:08,082 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 47 new interpolants: [1604497#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1604510#(and (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 1604481#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1604480#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1604507#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 1604504#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1604476#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1604503#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1604470#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1604495#(and (or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1604473#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1604509#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 1604482#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1604488#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1604508#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1604500#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1604490#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1604498#(or (<= 5 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1604475#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1604501#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0)), 1604513#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1604514#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4))), 1604494#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1604485#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1604493#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1604484#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1604505#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1604489#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1604502#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1604478#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1604487#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1604477#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1604512#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 1604471#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1604479#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 1604499#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 4 thread1Thread1of1ForFork1_~i~0))), 1604483#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1604491#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1604486#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1604469#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1604496#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1604511#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 5)), 1604515#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1604472#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1604474#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1604506#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1604492#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0))] [2022-03-15 19:27:08,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-15 19:27:08,082 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:27:08,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-15 19:27:08,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=5065, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 19:27:08,083 INFO L87 Difference]: Start difference. First operand 14264 states and 47394 transitions. Second operand has 65 states, 65 states have (on average 2.4615384615384617) internal successors, (160), 65 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:27:18,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:27:18,050 INFO L93 Difference]: Finished difference Result 24228 states and 78004 transitions. [2022-03-15 19:27:18,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2022-03-15 19:27:18,050 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.4615384615384617) internal successors, (160), 65 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 28 [2022-03-15 19:27:18,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:27:18,097 INFO L225 Difference]: With dead ends: 24228 [2022-03-15 19:27:18,097 INFO L226 Difference]: Without dead ends: 24054 [2022-03-15 19:27:18,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19930 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=11002, Invalid=51748, Unknown=0, NotChecked=0, Total=62750 [2022-03-15 19:27:18,099 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 631 mSDsluCounter, 2128 mSDsCounter, 0 mSdLazyCounter, 4959 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 5374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 4959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:27:18,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 41 Invalid, 5374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 4959 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 19:27:18,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24054 states. [2022-03-15 19:27:18,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24054 to 14810. [2022-03-15 19:27:18,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14810 states, 14809 states have (on average 3.317509622526842) internal successors, (49129), 14809 states have internal predecessors, (49129), 0 states have call successors, (0), 0 states have 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:27:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14810 states to 14810 states and 49129 transitions. [2022-03-15 19:27:18,425 INFO L78 Accepts]: Start accepts. Automaton has 14810 states and 49129 transitions. Word has length 28 [2022-03-15 19:27:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:27:18,425 INFO L470 AbstractCegarLoop]: Abstraction has 14810 states and 49129 transitions. [2022-03-15 19:27:18,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.4615384615384617) internal successors, (160), 65 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:27:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 14810 states and 49129 transitions. [2022-03-15 19:27:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:27:18,448 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:27:18,448 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:27:18,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2022-03-15 19:27:18,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:18,650 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:27:18,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:27:18,650 INFO L85 PathProgramCache]: Analyzing trace with hash -365870696, now seen corresponding path program 89 times [2022-03-15 19:27:18,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:27:18,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170455015] [2022-03-15 19:27:18,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:27:18,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:27:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:27:18,750 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:27:18,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170455015] [2022-03-15 19:27:18,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170455015] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:27:18,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932602699] [2022-03-15 19:27:18,751 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:27:18,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:18,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:27:18,752 INFO L229 MonitoredProcess]: Starting monitored process 92 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:27:18,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-03-15 19:27:18,862 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:27:18,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:27:18,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:27:18,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:27:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:27:19,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:27:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:27:19,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932602699] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:27:19,111 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:27:19,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 17] total 30 [2022-03-15 19:27:19,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [924900804] [2022-03-15 19:27:19,111 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:27:19,113 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:27:19,123 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 147 transitions. [2022-03-15 19:27:19,123 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:27:20,552 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 38 new interpolants: [1659104#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1659092#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1659102#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1659109#(or (<= ~N~0 4) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 1659113#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 1659081#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1659090#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1659082#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1659114#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1659083#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1659084#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1659087#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1659091#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1659093#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1659101#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1659078#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1659086#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1659096#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1659103#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1659108#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 1659106#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1659115#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1659110#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1659112#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1659095#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)))), 1659105#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1659094#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1659111#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 1659107#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1659098#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1659089#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1659099#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1659088#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1659079#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1659100#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1659097#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1659080#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1659085#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0))] [2022-03-15 19:27:20,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-15 19:27:20,553 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:27:20,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-15 19:27:20,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=3837, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 19:27:20,554 INFO L87 Difference]: Start difference. First operand 14810 states and 49129 transitions. Second operand has 55 states, 55 states have (on average 2.381818181818182) internal successors, (131), 55 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have 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:27:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:27:28,067 INFO L93 Difference]: Finished difference Result 19658 states and 61629 transitions. [2022-03-15 19:27:28,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2022-03-15 19:27:28,067 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.381818181818182) internal successors, (131), 55 states have internal predecessors, (131), 0 states have call successors, (0), 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:27:28,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:27:28,104 INFO L225 Difference]: With dead ends: 19658 [2022-03-15 19:27:28,105 INFO L226 Difference]: Without dead ends: 19592 [2022-03-15 19:27:28,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15889 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10024, Invalid=39482, Unknown=0, NotChecked=0, Total=49506 [2022-03-15 19:27:28,107 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 617 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 3321 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 3735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 3321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:27:28,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 38 Invalid, 3735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 3321 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 19:27:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19592 states. [2022-03-15 19:27:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19592 to 14958. [2022-03-15 19:27:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14958 states, 14957 states have (on average 3.317042187604466) internal successors, (49613), 14957 states have internal predecessors, (49613), 0 states have call successors, (0), 0 states have 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:27:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14958 states to 14958 states and 49613 transitions. [2022-03-15 19:27:28,405 INFO L78 Accepts]: Start accepts. Automaton has 14958 states and 49613 transitions. Word has length 28 [2022-03-15 19:27:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:27:28,405 INFO L470 AbstractCegarLoop]: Abstraction has 14958 states and 49613 transitions. [2022-03-15 19:27:28,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.381818181818182) internal successors, (131), 55 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have 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:27:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 14958 states and 49613 transitions. [2022-03-15 19:27:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:27:28,428 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:27:28,428 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:27:28,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Forceful destruction successful, exit code 0 [2022-03-15 19:27:28,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:28,629 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:27:28,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:27:28,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1683410562, now seen corresponding path program 90 times [2022-03-15 19:27:28,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:27:28,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318525200] [2022-03-15 19:27:28,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:27:28,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:27:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:27:28,731 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:27:28,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318525200] [2022-03-15 19:27:28,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318525200] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:27:28,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276002060] [2022-03-15 19:27:28,731 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:27:28,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:28,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:27:28,732 INFO L229 MonitoredProcess]: Starting monitored process 93 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:27:28,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-03-15 19:27:28,846 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 19:27:28,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:27:28,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:27:28,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:27:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:27:29,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:27:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:27:29,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276002060] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:27:29,084 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:27:29,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 17] total 30 [2022-03-15 19:27:29,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [92157384] [2022-03-15 19:27:29,084 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:27:29,086 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:27:29,096 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 156 transitions. [2022-03-15 19:27:29,097 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:27:30,651 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [1709350#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1709376#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1709347#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1709349#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1709362#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1709367#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1709359#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1709373#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1709360#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1709377#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1709372#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1709370#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1709352#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1709386#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1709371#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1709368#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)))), 1709356#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1709366#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1709382#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 1709365#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1709355#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1709361#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1709381#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 1709384#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1709380#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1709353#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1709358#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1709378#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1709351#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1709379#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 1709374#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1709357#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1709364#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1709369#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1709383#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1709385#(or (<= ~N~0 4) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 1709348#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1709363#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1709375#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1709354#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)))] [2022-03-15 19:27:30,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-15 19:27:30,651 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:27:30,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-15 19:27:30,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=711, Invalid=4119, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 19:27:30,652 INFO L87 Difference]: Start difference. First operand 14958 states and 49613 transitions. Second operand has 57 states, 57 states have (on average 2.4210526315789473) internal successors, (138), 57 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have 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:27:38,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:27:38,523 INFO L93 Difference]: Finished difference Result 19142 states and 60656 transitions. [2022-03-15 19:27:38,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2022-03-15 19:27:38,524 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.4210526315789473) internal successors, (138), 57 states have internal predecessors, (138), 0 states have call successors, (0), 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:27:38,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:27:38,565 INFO L225 Difference]: With dead ends: 19142 [2022-03-15 19:27:38,565 INFO L226 Difference]: Without dead ends: 19068 [2022-03-15 19:27:38,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15754 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9179, Invalid=39441, Unknown=0, NotChecked=0, Total=48620 [2022-03-15 19:27:38,569 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 540 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 3612 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 4038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 3612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:27:38,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [540 Valid, 31 Invalid, 4038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 3612 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:27:38,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19068 states. [2022-03-15 19:27:38,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19068 to 15062. [2022-03-15 19:27:38,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15062 states, 15061 states have (on average 3.318305557399907) internal successors, (49977), 15061 states have internal predecessors, (49977), 0 states have call successors, (0), 0 states have 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:27:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15062 states to 15062 states and 49977 transitions. [2022-03-15 19:27:38,877 INFO L78 Accepts]: Start accepts. Automaton has 15062 states and 49977 transitions. Word has length 28 [2022-03-15 19:27:38,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:27:38,877 INFO L470 AbstractCegarLoop]: Abstraction has 15062 states and 49977 transitions. [2022-03-15 19:27:38,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.4210526315789473) internal successors, (138), 57 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have 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:27:38,877 INFO L276 IsEmpty]: Start isEmpty. Operand 15062 states and 49977 transitions. [2022-03-15 19:27:38,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:27:38,899 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:27:38,899 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:27:38,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Ended with exit code 0 [2022-03-15 19:27:39,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:39,100 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:27:39,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:27:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash 786620120, now seen corresponding path program 91 times [2022-03-15 19:27:39,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:27:39,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127370713] [2022-03-15 19:27:39,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:27:39,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:27:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:27:39,206 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:27:39,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127370713] [2022-03-15 19:27:39,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127370713] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:27:39,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221649592] [2022-03-15 19:27:39,206 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:27:39,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:39,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:27:39,207 INFO L229 MonitoredProcess]: Starting monitored process 94 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:27:39,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-03-15 19:27:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:39,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:27:39,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:27:39,550 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:27:39,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:27:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:27:39,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221649592] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:27:39,606 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:27:39,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 17] total 30 [2022-03-15 19:27:39,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1533653307] [2022-03-15 19:27:39,606 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:27:39,608 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:27:39,619 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 165 transitions. [2022-03-15 19:27:39,619 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:27:41,228 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 42 new interpolants: [1759326#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1759336#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1759315#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1759332#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 1759313#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1759339#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1759299#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1759320#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1759319#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1759308#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1759302#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1759310#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1759324#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1759300#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1759298#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1759323#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1759311#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1759325#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1759312#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1759314#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1759301#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1759337#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1759306#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1759307#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1759329#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1759318#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1759327#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1759333#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1759322#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 1759321#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)))), 1759334#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1759309#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1759331#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1759338#(or (<= ~N~0 4) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 1759316#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1759335#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 1759317#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1759304#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1759305#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1759303#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1759328#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1759330#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0))] [2022-03-15 19:27:41,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-03-15 19:27:41,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:27:41,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-03-15 19:27:41,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=717, Invalid=4395, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 19:27:41,229 INFO L87 Difference]: Start difference. First operand 15062 states and 49977 transitions. Second operand has 59 states, 59 states have (on average 2.457627118644068) internal successors, (145), 59 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have 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:27:49,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:27:49,272 INFO L93 Difference]: Finished difference Result 21448 states and 68202 transitions. [2022-03-15 19:27:49,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2022-03-15 19:27:49,272 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.457627118644068) internal successors, (145), 59 states have internal predecessors, (145), 0 states have call successors, (0), 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:27:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:27:49,315 INFO L225 Difference]: With dead ends: 21448 [2022-03-15 19:27:49,316 INFO L226 Difference]: Without dead ends: 21322 [2022-03-15 19:27:49,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15328 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=8195, Invalid=39985, Unknown=0, NotChecked=0, Total=48180 [2022-03-15 19:27:49,320 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 510 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 4558 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 4926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 4558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:27:49,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [510 Valid, 45 Invalid, 4926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 4558 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 19:27:49,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21322 states. [2022-03-15 19:27:49,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21322 to 15616. [2022-03-15 19:27:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15616 states, 15615 states have (on average 3.317451168747999) internal successors, (51802), 15615 states have internal predecessors, (51802), 0 states have call successors, (0), 0 states have 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:27:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15616 states to 15616 states and 51802 transitions. [2022-03-15 19:27:49,652 INFO L78 Accepts]: Start accepts. Automaton has 15616 states and 51802 transitions. Word has length 28 [2022-03-15 19:27:49,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:27:49,652 INFO L470 AbstractCegarLoop]: Abstraction has 15616 states and 51802 transitions. [2022-03-15 19:27:49,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.457627118644068) internal successors, (145), 59 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have 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:27:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 15616 states and 51802 transitions. [2022-03-15 19:27:49,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:27:49,675 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:27:49,675 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:27:49,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Ended with exit code 0 [2022-03-15 19:27:49,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:49,875 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:27:49,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:27:49,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1244079806, now seen corresponding path program 92 times [2022-03-15 19:27:49,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:27:49,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354108462] [2022-03-15 19:27:49,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:27:49,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:27:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:49,981 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:27:49,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:27:49,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354108462] [2022-03-15 19:27:49,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354108462] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:27:49,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164871171] [2022-03-15 19:27:49,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:27:49,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:49,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:27:49,982 INFO L229 MonitoredProcess]: Starting monitored process 95 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:27:49,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-03-15 19:27:50,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:27:50,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:27:50,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:27:50,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:27:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:27:50,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:27:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:27:50,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164871171] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:27:50,318 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:27:50,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 17] total 30 [2022-03-15 19:27:50,318 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1307950352] [2022-03-15 19:27:50,318 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:27:50,320 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:27:50,331 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 174 transitions. [2022-03-15 19:27:50,331 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:27:52,071 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 44 new interpolants: [1812666#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1812665#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1812688#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)))), 1812671#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1812699#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1812675#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1812697#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 1812657#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1812693#(or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1812698#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1812663#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1812690#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 1 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1812664#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1812672#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1812679#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1812668#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1812680#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1812678#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1812689#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1812659#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1812684#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1812670#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1812695#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1812683#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1812676#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1812660#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1812658#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1812661#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1812667#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1812674#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 4 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1812685#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1812686#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 1812682#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1812691#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)))), 1812687#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1812662#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1812669#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1812656#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1812677#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1812694#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1))), 1812681#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1812692#(or (<= ~N~0 4) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 1812696#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1812673#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0))] [2022-03-15 19:27:52,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 19:27:52,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:27:52,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 19:27:52,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=734, Invalid=4668, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 19:27:52,073 INFO L87 Difference]: Start difference. First operand 15616 states and 51802 transitions. Second operand has 62 states, 62 states have (on average 2.4516129032258065) internal successors, (152), 62 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have 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:27:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:27:59,464 INFO L93 Difference]: Finished difference Result 27160 states and 87517 transitions. [2022-03-15 19:27:59,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-03-15 19:27:59,464 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.4516129032258065) internal successors, (152), 62 states have internal predecessors, (152), 0 states have call successors, (0), 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:27:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:27:59,524 INFO L225 Difference]: With dead ends: 27160 [2022-03-15 19:27:59,524 INFO L226 Difference]: Without dead ends: 27026 [2022-03-15 19:27:59,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13832 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=7664, Invalid=36646, Unknown=0, NotChecked=0, Total=44310 [2022-03-15 19:27:59,526 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 520 mSDsluCounter, 1815 mSDsCounter, 0 mSdLazyCounter, 4337 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 4661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 4337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:27:59,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [520 Valid, 43 Invalid, 4661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 4337 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 19:27:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27026 states. [2022-03-15 19:27:59,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27026 to 16776. [2022-03-15 19:27:59,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16776 states, 16775 states have (on average 3.3175558867362147) internal successors, (55652), 16775 states have internal predecessors, (55652), 0 states have call successors, (0), 0 states have 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:27:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16776 states to 16776 states and 55652 transitions. [2022-03-15 19:27:59,905 INFO L78 Accepts]: Start accepts. Automaton has 16776 states and 55652 transitions. Word has length 28 [2022-03-15 19:27:59,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:27:59,905 INFO L470 AbstractCegarLoop]: Abstraction has 16776 states and 55652 transitions. [2022-03-15 19:27:59,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.4516129032258065) internal successors, (152), 62 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have 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:27:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 16776 states and 55652 transitions. [2022-03-15 19:27:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:27:59,929 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:27:59,929 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:27:59,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2022-03-15 19:28:00,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable95 [2022-03-15 19:28:00,130 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:28:00,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:28:00,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1914162188, now seen corresponding path program 93 times [2022-03-15 19:28:00,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:28:00,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031795209] [2022-03-15 19:28:00,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:28:00,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:28:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:28:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:28:00,234 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:28:00,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031795209] [2022-03-15 19:28:00,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031795209] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:28:00,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914083530] [2022-03-15 19:28:00,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:28:00,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:28:00,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:28:00,236 INFO L229 MonitoredProcess]: Starting monitored process 96 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:28:00,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-03-15 19:28:00,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 19:28:00,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:28:00,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:28:00,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:28:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:28:00,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:28:00,694 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:28:00,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914083530] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:28:00,694 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:28:00,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 16] total 30 [2022-03-15 19:28:00,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2060688514] [2022-03-15 19:28:00,694 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:28:00,696 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:28:00,706 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 147 transitions. [2022-03-15 19:28:00,706 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:28:02,076 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [1874024#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1874037#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1874047#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 1874039#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1874040#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1874027#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 1874029#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1874023#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1874041#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1874032#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1874043#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 1874049#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1874031#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1874033#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1874042#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0))), 1874015#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1874017#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1874048#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1874018#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1874021#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1874034#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1874046#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1874019#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1874030#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1874050#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 3)), 1874035#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1874022#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1874045#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1874038#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1874020#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1874026#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1874051#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1874036#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1874044#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 1874025#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1874028#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1874016#(< thread1Thread1of1ForFork1_~i~0 ~N~0)] [2022-03-15 19:28:02,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-15 19:28:02,076 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:28:02,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-15 19:28:02,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=661, Invalid=3761, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 19:28:02,077 INFO L87 Difference]: Start difference. First operand 16776 states and 55652 transitions. Second operand has 53 states, 53 states have (on average 2.452830188679245) internal successors, (130), 53 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:28:07,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:28:07,557 INFO L93 Difference]: Finished difference Result 20538 states and 64913 transitions. [2022-03-15 19:28:07,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-03-15 19:28:07,558 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.452830188679245) internal successors, (130), 53 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:28:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:28:07,600 INFO L225 Difference]: With dead ends: 20538 [2022-03-15 19:28:07,600 INFO L226 Difference]: Without dead ends: 20464 [2022-03-15 19:28:07,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9894 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5836, Invalid=25670, Unknown=0, NotChecked=0, Total=31506 [2022-03-15 19:28:07,603 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 597 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 2666 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 2666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:28:07,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [597 Valid, 31 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 2666 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:28:07,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20464 states. [2022-03-15 19:28:07,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20464 to 16904. [2022-03-15 19:28:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16904 states, 16903 states have (on average 3.3152694787907473) internal successors, (56038), 16903 states have internal predecessors, (56038), 0 states have call successors, (0), 0 states have 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:28:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16904 states to 16904 states and 56038 transitions. [2022-03-15 19:28:07,938 INFO L78 Accepts]: Start accepts. Automaton has 16904 states and 56038 transitions. Word has length 28 [2022-03-15 19:28:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:28:07,938 INFO L470 AbstractCegarLoop]: Abstraction has 16904 states and 56038 transitions. [2022-03-15 19:28:07,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.452830188679245) internal successors, (130), 53 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:28:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 16904 states and 56038 transitions. [2022-03-15 19:28:07,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:28:07,963 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:28:07,963 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:28:07,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2022-03-15 19:28:08,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable96 [2022-03-15 19:28:08,163 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:28:08,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:28:08,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1264485116, now seen corresponding path program 94 times [2022-03-15 19:28:08,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:28:08,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016758229] [2022-03-15 19:28:08,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:28:08,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:28:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:28:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:28:08,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:28:08,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016758229] [2022-03-15 19:28:08,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016758229] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:28:08,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788991196] [2022-03-15 19:28:08,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:28:08,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:28:08,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:28:08,282 INFO L229 MonitoredProcess]: Starting monitored process 97 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:28:08,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-03-15 19:28:08,385 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:28:08,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:28:08,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:28:08,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:28:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:28:08,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:28:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:28:08,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788991196] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:28:08,623 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:28:08,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 16] total 30 [2022-03-15 19:28:08,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1542887151] [2022-03-15 19:28:08,624 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:28:08,625 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:28:08,636 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 156 transitions. [2022-03-15 19:28:08,636 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:28:10,132 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 39 new interpolants: [1928950#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1928944#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1928947#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1928954#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1928958#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1928939#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1928946#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1928931#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1928923#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1928941#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1928943#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0))), 1928945#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 1928929#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1928930#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1928957#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1928948#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1928952#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 1928942#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1928949#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1928960#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 3)), 1928926#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1928951#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1928955#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 1928925#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1928936#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 1928938#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1928959#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 1928961#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1928937#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1928927#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1928935#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1928934#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1928924#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1928953#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1928933#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1928932#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1928940#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1928928#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1928956#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0)))] [2022-03-15 19:28:10,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-15 19:28:10,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:28:10,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-15 19:28:10,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=665, Invalid=4027, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 19:28:10,133 INFO L87 Difference]: Start difference. First operand 16904 states and 56038 transitions. Second operand has 56 states, 56 states have (on average 2.4464285714285716) internal successors, (137), 56 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have 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:28:16,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:28:16,260 INFO L93 Difference]: Finished difference Result 24222 states and 77010 transitions. [2022-03-15 19:28:16,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-03-15 19:28:16,261 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.4464285714285716) internal successors, (137), 56 states have internal predecessors, (137), 0 states have call successors, (0), 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:28:16,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:28:16,308 INFO L225 Difference]: With dead ends: 24222 [2022-03-15 19:28:16,309 INFO L226 Difference]: Without dead ends: 24108 [2022-03-15 19:28:16,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11616 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6323, Invalid=29967, Unknown=0, NotChecked=0, Total=36290 [2022-03-15 19:28:16,311 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 475 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 3483 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 3812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 3483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:28:16,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 33 Invalid, 3812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 3483 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:28:16,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24108 states. [2022-03-15 19:28:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24108 to 17632. [2022-03-15 19:28:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17632 states, 17631 states have (on average 3.319607509500312) internal successors, (58528), 17631 states have internal predecessors, (58528), 0 states have call successors, (0), 0 states have 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:28:16,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17632 states to 17632 states and 58528 transitions. [2022-03-15 19:28:16,748 INFO L78 Accepts]: Start accepts. Automaton has 17632 states and 58528 transitions. Word has length 28 [2022-03-15 19:28:16,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:28:16,748 INFO L470 AbstractCegarLoop]: Abstraction has 17632 states and 58528 transitions. [2022-03-15 19:28:16,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.4464285714285716) internal successors, (137), 56 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have 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:28:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 17632 states and 58528 transitions. [2022-03-15 19:28:16,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:28:16,773 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:28:16,773 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:28:16,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Ended with exit code 0 [2022-03-15 19:28:16,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:28:16,973 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:28:16,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:28:16,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1481616286, now seen corresponding path program 95 times [2022-03-15 19:28:16,974 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:28:16,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848286390] [2022-03-15 19:28:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:28:16,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:28:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:28:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 54 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:28:17,070 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:28:17,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848286390] [2022-03-15 19:28:17,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848286390] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:28:17,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327006855] [2022-03-15 19:28:17,070 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:28:17,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:28:17,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:28:17,071 INFO L229 MonitoredProcess]: Starting monitored process 98 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:28:17,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-03-15 19:28:17,182 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:28:17,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:28:17,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:28:17,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:28:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 25 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:28:17,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:28:17,438 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 50 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:28:17,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327006855] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:28:17,438 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:28:17,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 16] total 30 [2022-03-15 19:28:17,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [904376173] [2022-03-15 19:28:17,438 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:28:17,440 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:28:17,453 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 156 transitions. [2022-03-15 19:28:17,453 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:28:18,933 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 39 new interpolants: [1989042#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 1989010#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 1989029#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 1989020#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1989018#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 1989025#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1989038#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 1989006#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1989036#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1989012#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1989022#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 1989023#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 1989033#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1989007#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1989013#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1989044#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 1989028#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 1989014#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1989043#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 3)), 1989008#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 1989039#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1989041#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 1989017#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1989021#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 1989032#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 1989034#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 1989035#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 1989037#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 1989031#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1989019#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1989026#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 1989015#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 1989009#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 1989016#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 1989011#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 1989030#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 1989040#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 1989027#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0))), 1989024#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0))] [2022-03-15 19:28:18,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-15 19:28:18,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:28:18,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-15 19:28:18,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=4040, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 19:28:18,935 INFO L87 Difference]: Start difference. First operand 17632 states and 58528 transitions. Second operand has 56 states, 56 states have (on average 2.4464285714285716) internal successors, (137), 56 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have 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:28:25,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:28:25,082 INFO L93 Difference]: Finished difference Result 23570 states and 75903 transitions. [2022-03-15 19:28:25,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-03-15 19:28:25,082 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.4464285714285716) internal successors, (137), 56 states have internal predecessors, (137), 0 states have call successors, (0), 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:28:25,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:28:25,130 INFO L225 Difference]: With dead ends: 23570 [2022-03-15 19:28:25,130 INFO L226 Difference]: Without dead ends: 23468 [2022-03-15 19:28:25,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9958 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5524, Invalid=26696, Unknown=0, NotChecked=0, Total=32220 [2022-03-15 19:28:25,132 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 450 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 3599 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 3599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:28:25,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [450 Valid, 42 Invalid, 3836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 3599 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:28:25,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23468 states. [2022-03-15 19:28:25,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23468 to 18030. [2022-03-15 19:28:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18030 states, 18029 states have (on average 3.3192634089522435) internal successors, (59843), 18029 states have internal predecessors, (59843), 0 states have call successors, (0), 0 states have 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:28:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18030 states to 18030 states and 59843 transitions. [2022-03-15 19:28:25,531 INFO L78 Accepts]: Start accepts. Automaton has 18030 states and 59843 transitions. Word has length 28 [2022-03-15 19:28:25,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:28:25,531 INFO L470 AbstractCegarLoop]: Abstraction has 18030 states and 59843 transitions. [2022-03-15 19:28:25,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.4464285714285716) internal successors, (137), 56 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have 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:28:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 18030 states and 59843 transitions. [2022-03-15 19:28:25,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:28:25,556 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:28:25,556 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:28:25,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2022-03-15 19:28:25,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:28:25,757 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:28:25,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:28:25,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1018303732, now seen corresponding path program 96 times [2022-03-15 19:28:25,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:28:25,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940866277] [2022-03-15 19:28:25,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:28:25,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:28:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:28:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:28:25,863 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:28:25,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940866277] [2022-03-15 19:28:25,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940866277] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:28:25,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581143268] [2022-03-15 19:28:25,863 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:28:25,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:28:25,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:28:25,864 INFO L229 MonitoredProcess]: Starting monitored process 99 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:28:25,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-03-15 19:28:25,980 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:28:25,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:28:25,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:28:25,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:28:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:28:26,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:28:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:28:26,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581143268] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:28:26,223 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:28:26,223 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 17] total 31 [2022-03-15 19:28:26,223 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [51778596] [2022-03-15 19:28:26,223 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:28:26,226 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:28:26,239 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 165 transitions. [2022-03-15 19:28:26,239 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:28:27,979 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [2049228#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 2049234#(or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 2049237#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 2049224#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 2049211#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 2049241#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 3)), 2049202#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 2049233#(and (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0))), 2049227#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 2049212#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 2049209#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 2049220#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= 8 ~N~0) (<= ~N~0 6)), 2049240#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 2049208#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 2049236#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 2049225#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 2049239#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 2049218#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0)), 2049205#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 2049210#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 2049204#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 2049206#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 2049222#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2049214#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 2049232#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)))), 2049231#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0))), 2049203#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 2049213#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 2049201#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 2049230#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (<= 3 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 2049229#(or (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 2049226#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 2049207#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 2049219#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2049216#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 2049217#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 2049215#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2049235#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 2 thread1Thread1of1ForFork1_~i~0)), 2049238#(or (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0))), 2049221#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2049223#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0))] [2022-03-15 19:28:27,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-03-15 19:28:27,980 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:28:27,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-03-15 19:28:27,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=4415, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 19:28:27,980 INFO L87 Difference]: Start difference. First operand 18030 states and 59843 transitions. Second operand has 59 states, 59 states have (on average 2.440677966101695) internal successors, (144), 59 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have 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:28:34,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:28:34,600 INFO L93 Difference]: Finished difference Result 24962 states and 80058 transitions. [2022-03-15 19:28:34,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-03-15 19:28:34,600 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.440677966101695) internal successors, (144), 59 states have internal predecessors, (144), 0 states have call successors, (0), 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:28:34,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:28:34,655 INFO L225 Difference]: With dead ends: 24962 [2022-03-15 19:28:34,655 INFO L226 Difference]: Without dead ends: 24828 [2022-03-15 19:28:34,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13037 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=6959, Invalid=33643, Unknown=0, NotChecked=0, Total=40602 [2022-03-15 19:28:34,657 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 512 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 4325 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 4591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 4325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:28:34,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [512 Valid, 39 Invalid, 4591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 4325 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 19:28:34,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24828 states. [2022-03-15 19:28:35,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24828 to 17494. [2022-03-15 19:28:35,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17494 states, 17493 states have (on average 3.3140113188132396) internal successors, (57972), 17493 states have internal predecessors, (57972), 0 states have call successors, (0), 0 states have 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:28:35,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17494 states to 17494 states and 57972 transitions. [2022-03-15 19:28:35,094 INFO L78 Accepts]: Start accepts. Automaton has 17494 states and 57972 transitions. Word has length 28 [2022-03-15 19:28:35,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:28:35,094 INFO L470 AbstractCegarLoop]: Abstraction has 17494 states and 57972 transitions. [2022-03-15 19:28:35,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.440677966101695) internal successors, (144), 59 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have 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:28:35,094 INFO L276 IsEmpty]: Start isEmpty. Operand 17494 states and 57972 transitions. [2022-03-15 19:28:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:28:35,120 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:28:35,120 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:28:35,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Forceful destruction successful, exit code 0 [2022-03-15 19:28:35,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2022-03-15 19:28:35,321 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:28:35,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:28:35,321 INFO L85 PathProgramCache]: Analyzing trace with hash -162088894, now seen corresponding path program 97 times [2022-03-15 19:28:35,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:28:35,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442414904] [2022-03-15 19:28:35,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:28:35,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:28:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:28:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:28:35,427 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:28:35,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442414904] [2022-03-15 19:28:35,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442414904] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:28:35,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280383481] [2022-03-15 19:28:35,427 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:28:35,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:28:35,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:28:35,428 INFO L229 MonitoredProcess]: Starting monitored process 100 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:28:35,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-03-15 19:28:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:28:35,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:28:35,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:28:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 24 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:28:35,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:28:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 48 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:28:35,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280383481] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:28:35,796 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:28:35,796 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 15] total 30 [2022-03-15 19:28:35,796 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1019869007] [2022-03-15 19:28:35,796 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:28:35,798 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:28:35,807 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 138 transitions. [2022-03-15 19:28:35,808 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:28:37,146 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [2109795#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 2109793#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 2109800#(and (or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 2109780#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 2109791#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2109807#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 2109798#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 2109792#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2109782#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 2109796#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2109806#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 2)), 2109783#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 2109778#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 2109805#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 2109801#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 2109774#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 2109786#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 2109799#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 2109789#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2109784#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2109804#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 2109797#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2109790#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2109781#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 2109779#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 2109802#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 2109785#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2109776#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 2109787#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 2109777#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 2109788#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2109775#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 2109803#(or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 2109794#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0)))] [2022-03-15 19:28:37,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 19:28:37,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:28:37,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 19:28:37,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=594, Invalid=3438, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:28:37,147 INFO L87 Difference]: Start difference. First operand 17494 states and 57972 transitions. Second operand has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:28:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:28:41,114 INFO L93 Difference]: Finished difference Result 21562 states and 69255 transitions. [2022-03-15 19:28:41,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-15 19:28:41,115 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:28:41,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:28:41,157 INFO L225 Difference]: With dead ends: 21562 [2022-03-15 19:28:41,158 INFO L226 Difference]: Without dead ends: 21526 [2022-03-15 19:28:41,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6503 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3968, Invalid=16912, Unknown=0, NotChecked=0, Total=20880 [2022-03-15 19:28:41,159 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 413 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 2795 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 2795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:28:41,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 34 Invalid, 2981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 2795 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:28:41,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21526 states. [2022-03-15 19:28:41,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21526 to 18674. [2022-03-15 19:28:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18674 states, 18673 states have (on average 3.3324050768489264) internal successors, (62226), 18673 states have internal predecessors, (62226), 0 states have call successors, (0), 0 states have 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:28:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18674 states to 18674 states and 62226 transitions. [2022-03-15 19:28:41,520 INFO L78 Accepts]: Start accepts. Automaton has 18674 states and 62226 transitions. Word has length 28 [2022-03-15 19:28:41,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:28:41,520 INFO L470 AbstractCegarLoop]: Abstraction has 18674 states and 62226 transitions. [2022-03-15 19:28:41,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:28:41,520 INFO L276 IsEmpty]: Start isEmpty. Operand 18674 states and 62226 transitions. [2022-03-15 19:28:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:28:41,546 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:28:41,546 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:28:41,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Forceful destruction successful, exit code 0 [2022-03-15 19:28:41,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:28:41,748 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:28:41,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:28:41,748 INFO L85 PathProgramCache]: Analyzing trace with hash -424237992, now seen corresponding path program 98 times [2022-03-15 19:28:41,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:28:41,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240709855] [2022-03-15 19:28:41,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:28:41,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:28:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:28:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 11 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:28:41,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:28:41,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240709855] [2022-03-15 19:28:41,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240709855] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:28:41,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764377537] [2022-03-15 19:28:41,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:28:41,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:28:41,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:28:41,845 INFO L229 MonitoredProcess]: Starting monitored process 101 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:28:41,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-03-15 19:28:41,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:28:41,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:28:41,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:28:41,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:28:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:28:42,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:28:42,272 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:28:42,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764377537] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:28:42,272 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:28:42,272 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 16] total 31 [2022-03-15 19:28:42,272 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [493940490] [2022-03-15 19:28:42,272 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:28:42,274 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:28:42,284 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 147 transitions. [2022-03-15 19:28:42,284 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:28:43,645 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [2169158#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 2169186#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 2169162#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0)), 2169174#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2169185#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 2169169#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2169168#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2169183#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 2169173#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2169178#(and (or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 2169181#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 2169166#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2169187#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 2169164#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 2169176#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 2169165#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2169160#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 2169175#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 2169177#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0)), 2169167#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0)), 2169171#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2169182#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 2169155#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 2169161#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 2169179#(or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 2169159#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 2169188#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 2169172#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2169157#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 2169156#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 2169170#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2169154#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 2169184#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 2169189#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 2)), 2169163#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< thread1Thread1of1ForFork1_~i~0 ~N~0)), 2169180#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)))] [2022-03-15 19:28:43,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-15 19:28:43,646 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:28:43,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-15 19:28:43,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=631, Invalid=3791, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 19:28:43,647 INFO L87 Difference]: Start difference. First operand 18674 states and 62226 transitions. Second operand has 53 states, 53 states have (on average 2.4339622641509435) internal successors, (129), 53 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have 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:28:47,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:28:47,203 INFO L93 Difference]: Finished difference Result 21260 states and 68289 transitions. [2022-03-15 19:28:47,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-03-15 19:28:47,204 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.4339622641509435) internal successors, (129), 53 states have internal predecessors, (129), 0 states have call successors, (0), 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:28:47,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:28:47,247 INFO L225 Difference]: With dead ends: 21260 [2022-03-15 19:28:47,248 INFO L226 Difference]: Without dead ends: 21208 [2022-03-15 19:28:47,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6734 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4195, Invalid=17267, Unknown=0, NotChecked=0, Total=21462 [2022-03-15 19:28:47,249 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 416 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:28:47,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 29 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:28:47,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21208 states. [2022-03-15 19:28:47,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21208 to 16172. [2022-03-15 19:28:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16172 states, 16171 states have (on average 3.318409498484942) internal successors, (53662), 16171 states have internal predecessors, (53662), 0 states have call successors, (0), 0 states have 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:28:47,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16172 states to 16172 states and 53662 transitions. [2022-03-15 19:28:47,580 INFO L78 Accepts]: Start accepts. Automaton has 16172 states and 53662 transitions. Word has length 28 [2022-03-15 19:28:47,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:28:47,580 INFO L470 AbstractCegarLoop]: Abstraction has 16172 states and 53662 transitions. [2022-03-15 19:28:47,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.4339622641509435) internal successors, (129), 53 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have 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:28:47,581 INFO L276 IsEmpty]: Start isEmpty. Operand 16172 states and 53662 transitions. [2022-03-15 19:28:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:28:47,603 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:28:47,603 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:28:47,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2022-03-15 19:28:47,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:28:47,804 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:28:47,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:28:47,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1484623810, now seen corresponding path program 99 times [2022-03-15 19:28:47,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:28:47,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284516314] [2022-03-15 19:28:47,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:28:47,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:28:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:28:47,893 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 11 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:28:47,893 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:28:47,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284516314] [2022-03-15 19:28:47,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284516314] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:28:47,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282184371] [2022-03-15 19:28:47,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:28:47,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:28:47,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:28:47,894 INFO L229 MonitoredProcess]: Starting monitored process 102 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:28:47,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-03-15 19:28:48,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:28:48,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:28:48,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:28:48,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:28:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 24 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:28:48,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:28:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 48 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:28:48,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282184371] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:28:48,259 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:28:48,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 15] total 30 [2022-03-15 19:28:48,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1353887476] [2022-03-15 19:28:48,259 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:28:48,317 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:28:48,326 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 138 transitions. [2022-03-15 19:28:48,327 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:28:49,553 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [2223240#(or (<= ~N~0 (+ 3 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 2223239#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2223249#(or (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2223252#(and (or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0))), 2223257#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)), 2223236#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 3)) (<= (+ 5 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 2223253#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0))), 2223228#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0)), 2223238#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4))), 2223230#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 2223233#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 2223243#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2223248#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (<= 8 ~N~0) (<= ~N~0 6) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2223250#(or (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0)) (<= 8 ~N~0) (<= ~N~0 6)), 2223234#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2))), 2223254#(and (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (<= 0 thread1Thread1of1ForFork1_~i~0)) (or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0))), 2223256#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= 1 thread1Thread1of1ForFork1_~i~0)), 2223244#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= ~N~0 (+ 5 thread1Thread1of1ForFork1_~i~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 6 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2223231#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 2223242#(or (<= ~N~0 (+ 5 |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ 7 |thread2Thread1of1ForFork0_~i~1#1|) ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2223258#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 2)), 2223259#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 2223255#(or (<= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 2223227#(< thread1Thread1of1ForFork1_~i~0 ~N~0), 2223232#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3) ~N~0)), 2223246#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 2223247#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (<= ~N~0 7) (< 8 ~N~0)), 2223241#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 4)) (< (+ 5 thread1Thread1of1ForFork1_~i~0) ~N~0)), 2223235#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 4) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 2223237#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 6) ~N~0) (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 4)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 2223229#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0)), 2223251#(or (< (+ thread1Thread1of1ForFork1_~i~0 8) ~N~0) (<= 8 ~N~0) (<= ~N~0 6) (<= ~N~0 (+ 7 thread1Thread1of1ForFork1_~i~0))), 2223245#(or (<= ~N~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 6)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 8) ~N~0) (< (+ 7 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~N~0 (+ 6 thread1Thread1of1ForFork1_~i~0))), 2223226#(or (<= ~N~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) ~N~0))] [2022-03-15 19:28:49,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 19:28:49,553 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:28:49,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 19:28:49,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=589, Invalid=3443, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:28:49,554 INFO L87 Difference]: Start difference. First operand 16172 states and 53662 transitions. Second operand has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 19:28:54,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-03-15 19:28:54,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8164 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5191, Invalid=20249, Unknown=0, NotChecked=0, Total=25440 [2022-03-15 19:28:54,488 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 344 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 2859 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 3074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 2859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:28:54,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 31 Invalid, 3074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 2859 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:28:54,488 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-03-15 19:28:54,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Ended with exit code 0 [2022-03-15 19:28:54,509 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:28:54,509 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:28:54,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-03-15 19:28:54,689 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (16172states) and FLOYD_HOARE automaton (currently 103 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 160 known predicates. [2022-03-15 19:28:54,691 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 19:28:54,691 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 19:28:54,692 INFO L732 BasicCegarLoop]: Path program histogram: [99, 3, 1] [2022-03-15 19:28:54,693 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:28:54,693 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:28:54,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:28:54 BasicIcfg [2022-03-15 19:28:54,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:28:54,695 INFO L158 Benchmark]: Toolchain (without parser) took 702489.13ms. Allocated memory was 195.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 139.4MB in the beginning and 320.0MB in the end (delta: -180.6MB). Peak memory consumption was 869.7MB. Max. memory is 8.0GB. [2022-03-15 19:28:54,695 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 195.0MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:28:54,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.59ms. Allocated memory is still 195.0MB. Free memory was 139.1MB in the beginning and 164.6MB in the end (delta: -25.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-15 19:28:54,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.59ms. Allocated memory is still 195.0MB. Free memory was 164.6MB in the beginning and 163.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:28:54,695 INFO L158 Benchmark]: Boogie Preprocessor took 30.77ms. Allocated memory is still 195.0MB. Free memory was 163.4MB in the beginning and 162.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:28:54,695 INFO L158 Benchmark]: RCFGBuilder took 368.18ms. Allocated memory is still 195.0MB. Free memory was 162.0MB in the beginning and 148.8MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-03-15 19:28:54,695 INFO L158 Benchmark]: TraceAbstraction took 701824.01ms. Allocated memory was 195.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 148.4MB in the beginning and 320.0MB in the end (delta: -171.6MB). Peak memory consumption was 880.4MB. Max. memory is 8.0GB. [2022-03-15 19:28:54,696 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 195.0MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.59ms. Allocated memory is still 195.0MB. Free memory was 139.1MB in the beginning and 164.6MB in the end (delta: -25.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.59ms. Allocated memory is still 195.0MB. Free memory was 164.6MB in the beginning and 163.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.77ms. Allocated memory is still 195.0MB. Free memory was 163.4MB in the beginning and 162.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 368.18ms. Allocated memory is still 195.0MB. Free memory was 162.0MB in the beginning and 148.8MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 701824.01ms. Allocated memory was 195.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 148.4MB in the beginning and 320.0MB in the end (delta: -171.6MB). Peak memory consumption was 880.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 79 PlacesBefore, 23 PlacesAfterwards, 77 TransitionsBefore, 18 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 66 TotalNumberOfCompositions, 540 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 524, positive: 521, positive conditional: 0, positive unconditional: 521, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 261, positive: 259, positive conditional: 0, positive unconditional: 259, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 524, positive: 262, positive conditional: 0, positive unconditional: 262, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 261, unknown conditional: 0, unknown unconditional: 261] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (16172states) and FLOYD_HOARE automaton (currently 103 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 160 known predicates. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (16172states) and FLOYD_HOARE automaton (currently 103 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 160 known predicates. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (16172states) and FLOYD_HOARE automaton (currently 103 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 160 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 93 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 701.7s, OverallIterations: 103, TraceHistogramMax: 8, PathProgramHistogramMax: 99, EmptinessCheckTime: 1.1s, AutomataDifference: 504.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41413 SdHoareTripleChecker+Valid, 104.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41413 mSDsluCounter, 3981 SdHoareTripleChecker+Invalid, 87.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107259 mSDsCounter, 26312 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 243489 IncrementalHoareTripleChecker+Invalid, 269801 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26312 mSolverCounterUnsat, 921 mSDtfsCounter, 243489 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31809 GetRequests, 16086 SyntacticMatches, 210 SemanticMatches, 15512 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008218 ImplicationChecksByTransitivity, 450.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18674occurred in iteration=101, InterpolantAutomatonStates: 10822, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.4s AutomataMinimizationTime, 102 MinimizatonAttempts, 242886 StatesRemovedByMinimization, 101 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 28.2s InterpolantComputationTime, 4861 NumberOfCodeBlocks, 4816 NumberOfCodeBlocksAsserted, 419 NumberOfCheckSat, 6972 ConstructedInterpolants, 0 QuantifiedInterpolants, 27894 SizeOfPredicates, 278 NumberOfNonLiveVariables, 17766 ConjunctsInSsa, 1486 ConjunctsInUnsatCore, 305 InterpolantComputations, 2 PerfectInterpolantSequences, 3413/11856 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown