/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-nonblocking-cntr.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:35:26,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:35:26,687 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:35:26,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:35:26,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:35:26,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:35:26,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:35:26,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:35:26,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:35:26,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:35:26,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:35:26,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:35:26,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:35:26,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:35:26,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:35:26,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:35:26,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:35:26,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:35:26,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:35:26,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:35:26,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:35:26,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:35:26,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:35:26,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:35:26,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:35:26,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:35:26,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:35:26,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:35:26,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:35:26,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:35:26,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:35:26,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:35:26,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:35:26,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:35:26,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:35:26,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:35:26,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:35:26,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:35:26,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:35:26,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:35:26,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:35:26,743 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:35:26,764 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:35:26,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:35:26,765 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:35:26,765 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:35:26,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:35:26,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:35:26,766 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:35:26,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:35:26,766 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:35:26,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:35:26,766 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:35:26,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:35:26,766 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:35:26,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:35:26,767 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:35:26,767 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:35:26,767 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:35:26,767 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:35:26,767 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:35:26,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:35:26,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:35:26,767 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:35:26,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:35:26,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:35:26,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:35:26,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:35:26,768 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:35:26,768 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:35:26,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:35:26,768 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:35:26,768 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:35:26,768 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:35:26,768 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:35:26,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:35:26,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:35:26,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:35:26,955 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:35:26,955 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:35:26,956 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c [2022-03-15 19:35:27,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d8f6e25d/acc4324604504f0490b221bcc511738c/FLAG082d6d4c4 [2022-03-15 19:35:27,361 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:35:27,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c [2022-03-15 19:35:27,367 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d8f6e25d/acc4324604504f0490b221bcc511738c/FLAG082d6d4c4 [2022-03-15 19:35:27,381 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d8f6e25d/acc4324604504f0490b221bcc511738c [2022-03-15 19:35:27,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:35:27,385 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:35:27,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:35:27,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:35:27,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:35:27,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:35:27" (1/1) ... [2022-03-15 19:35:27,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@573021eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:35:27, skipping insertion in model container [2022-03-15 19:35:27,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:35:27" (1/1) ... [2022-03-15 19:35:27,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:35:27,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:35:27,532 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-nonblocking-cntr.wvr.c[2037,2050] [2022-03-15 19:35:27,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:35:27,538 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:35:27,554 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-nonblocking-cntr.wvr.c[2037,2050] [2022-03-15 19:35:27,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:35:27,563 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:35:27,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:35:27 WrapperNode [2022-03-15 19:35:27,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:35:27,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:35:27,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:35:27,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:35:27,569 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:35:27" (1/1) ... [2022-03-15 19:35:27,575 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:35:27" (1/1) ... [2022-03-15 19:35:27,590 INFO L137 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2022-03-15 19:35:27,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:35:27,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:35:27,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:35:27,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:35:27,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:35:27" (1/1) ... [2022-03-15 19:35:27,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:35:27" (1/1) ... [2022-03-15 19:35:27,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:35:27" (1/1) ... [2022-03-15 19:35:27,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:35:27" (1/1) ... [2022-03-15 19:35:27,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:35:27" (1/1) ... [2022-03-15 19:35:27,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:35:27" (1/1) ... [2022-03-15 19:35:27,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:35:27" (1/1) ... [2022-03-15 19:35:27,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:35:27,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:35:27,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:35:27,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:35:27,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:35:27" (1/1) ... [2022-03-15 19:35:27,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:35:27,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:27,663 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:35:27,681 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:35:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:35:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:35:27,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:35:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:35:27,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:35:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:35:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:35:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:35:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:35:27,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:35:27,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:35:27,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:35:27,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:35:27,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:35:27,707 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:35:27,767 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:35:27,768 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:35:27,923 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:35:27,960 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:35:27,960 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 19:35:27,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:35:27 BoogieIcfgContainer [2022-03-15 19:35:27,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:35:27,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:35:27,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:35:27,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:35:27,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:35:27" (1/3) ... [2022-03-15 19:35:27,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb80a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:35:27, skipping insertion in model container [2022-03-15 19:35:27,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:35:27" (2/3) ... [2022-03-15 19:35:27,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb80a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:35:27, skipping insertion in model container [2022-03-15 19:35:27,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:35:27" (3/3) ... [2022-03-15 19:35:27,968 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-nonblocking-cntr.wvr.c [2022-03-15 19:35:27,971 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:35:27,971 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:35:27,971 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:35:27,972 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:35:28,021 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,021 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,021 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,022 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,022 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,022 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,022 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,022 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,023 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,023 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,023 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,023 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,023 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,023 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,024 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,024 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,024 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,024 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,024 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,024 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,024 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,025 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,025 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,025 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,025 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,025 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,026 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,026 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,027 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,027 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,027 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,027 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,027 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,027 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,028 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,028 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,028 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,028 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,028 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,031 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,031 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,031 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,031 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,031 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,032 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,032 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,032 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,032 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,032 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:35:28,035 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 19:35:28,063 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:35:28,070 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:35:28,070 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 19:35:28,084 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:35:28,092 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 82 transitions, 180 flow [2022-03-15 19:35:28,096 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 82 transitions, 180 flow [2022-03-15 19:35:28,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 82 transitions, 180 flow [2022-03-15 19:35:28,146 INFO L129 PetriNetUnfolder]: 6/80 cut-off events. [2022-03-15 19:35:28,146 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 19:35:28,148 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 80 events. 6/80 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2022-03-15 19:35:28,151 INFO L116 LiptonReduction]: Number of co-enabled transitions 404 [2022-03-15 19:35:29,835 INFO L131 LiptonReduction]: Checked pairs total: 500 [2022-03-15 19:35:29,835 INFO L133 LiptonReduction]: Total number of compositions: 75 [2022-03-15 19:35:29,840 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 18 transitions, 52 flow [2022-03-15 19:35:29,850 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:35:29,852 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:35:29,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 19:35:29,855 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:29,856 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:29,856 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:29,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:29,859 INFO L85 PathProgramCache]: Analyzing trace with hash -870565279, now seen corresponding path program 1 times [2022-03-15 19:35:29,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:29,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594060892] [2022-03-15 19:35:29,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:29,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:30,036 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:35:30,036 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:30,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594060892] [2022-03-15 19:35:30,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594060892] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:35:30,037 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:35:30,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:35:30,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1452754399] [2022-03-15 19:35:30,038 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:30,041 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:30,059 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 57 transitions. [2022-03-15 19:35:30,064 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:30,203 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [158#(< thread2Thread1of1ForFork1_~i~1 ~M~0)] [2022-03-15 19:35:30,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:35:30,205 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:30,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:35:30,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:35:30,219 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 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:30,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:30,255 INFO L93 Difference]: Finished difference Result 42 states and 92 transitions. [2022-03-15 19:35:30,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:35:30,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 19:35:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:30,262 INFO L225 Difference]: With dead ends: 42 [2022-03-15 19:35:30,262 INFO L226 Difference]: Without dead ends: 42 [2022-03-15 19:35:30,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:35:30,265 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:30,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 5 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:35:30,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-03-15 19:35:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-03-15 19:35:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 41 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 92 transitions. [2022-03-15 19:35:30,286 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 92 transitions. Word has length 13 [2022-03-15 19:35:30,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:30,286 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 92 transitions. [2022-03-15 19:35:30,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 92 transitions. [2022-03-15 19:35:30,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 19:35:30,287 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:30,287 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:30,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:35:30,288 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:30,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:30,288 INFO L85 PathProgramCache]: Analyzing trace with hash -682786049, now seen corresponding path program 1 times [2022-03-15 19:35:30,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:30,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748961441] [2022-03-15 19:35:30,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:30,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:30,342 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:35:30,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:30,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748961441] [2022-03-15 19:35:30,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748961441] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:30,343 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635160949] [2022-03-15 19:35:30,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:30,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:30,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:30,344 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:35:30,345 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:35:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:30,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 19:35:30,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:30,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:35:30,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635160949] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:35:30,475 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:35:30,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2022-03-15 19:35:30,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1454597613] [2022-03-15 19:35:30,476 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:30,477 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:30,489 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 74 transitions. [2022-03-15 19:35:30,489 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:30,778 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [334#(<= 0 thread2Thread1of1ForFork1_~i~1), 332#(<= ~M~0 0), 331#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 333#(< 0 ~M~0)] [2022-03-15 19:35:30,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:35:30,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:30,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:35:30,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-03-15 19:35:30,780 INFO L87 Difference]: Start difference. First operand 42 states and 92 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:30,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:30,855 INFO L93 Difference]: Finished difference Result 52 states and 116 transitions. [2022-03-15 19:35:30,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:35:30,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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:35:30,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:30,856 INFO L225 Difference]: With dead ends: 52 [2022-03-15 19:35:30,856 INFO L226 Difference]: Without dead ends: 52 [2022-03-15 19:35:30,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:35:30,857 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:30,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 11 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:35:30,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-03-15 19:35:30,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-03-15 19:35:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.2745098039215685) internal successors, (116), 51 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:35:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 116 transitions. [2022-03-15 19:35:30,861 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 116 transitions. Word has length 14 [2022-03-15 19:35:30,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:30,862 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 116 transitions. [2022-03-15 19:35:30,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 116 transitions. [2022-03-15 19:35:30,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 19:35:30,862 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:30,862 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:30,882 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:35:31,079 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:35:31,080 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:31,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:31,080 INFO L85 PathProgramCache]: Analyzing trace with hash 413457626, now seen corresponding path program 1 times [2022-03-15 19:35:31,081 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:31,081 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640710927] [2022-03-15 19:35:31,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:31,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:31,170 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:35:31,170 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:31,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640710927] [2022-03-15 19:35:31,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640710927] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:31,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705675968] [2022-03-15 19:35:31,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:31,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:31,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:31,180 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:35:31,181 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:35:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:31,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:35:31,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:31,270 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:35:31,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:31,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705675968] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:31,423 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:31,424 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 3] total 4 [2022-03-15 19:35:31,424 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2116393417] [2022-03-15 19:35:31,424 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:31,425 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:31,431 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 76 transitions. [2022-03-15 19:35:31,431 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:31,675 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:35:31,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:35:31,676 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:31,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:35:31,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:35:31,681 INFO L87 Difference]: Start difference. First operand 52 states and 116 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:31,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:31,717 INFO L93 Difference]: Finished difference Result 95 states and 211 transitions. [2022-03-15 19:35:31,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:35:31,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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:35:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:31,723 INFO L225 Difference]: With dead ends: 95 [2022-03-15 19:35:31,723 INFO L226 Difference]: Without dead ends: 76 [2022-03-15 19:35:31,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:35:31,725 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:31,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:35:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-03-15 19:35:31,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2022-03-15 19:35:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.3174603174603177) internal successors, (146), 63 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:35:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 146 transitions. [2022-03-15 19:35:31,740 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 146 transitions. Word has length 15 [2022-03-15 19:35:31,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:31,740 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 146 transitions. [2022-03-15 19:35:31,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 146 transitions. [2022-03-15 19:35:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 19:35:31,741 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:31,741 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:31,757 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:35:31,955 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:35:31,956 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:31,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:31,956 INFO L85 PathProgramCache]: Analyzing trace with hash 138417778, now seen corresponding path program 2 times [2022-03-15 19:35:31,957 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:31,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887001295] [2022-03-15 19:35:31,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:31,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:35:31,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:31,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887001295] [2022-03-15 19:35:31,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887001295] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:31,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673520088] [2022-03-15 19:35:31,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:35:31,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:31,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:31,997 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:35:31,998 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:35:32,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:35:32,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:32,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:35:32,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:35:32,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:35:32,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673520088] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:32,194 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:32,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2022-03-15 19:35:32,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [363371997] [2022-03-15 19:35:32,195 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:32,196 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:32,200 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 60 transitions. [2022-03-15 19:35:32,200 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:32,346 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:35:32,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:35:32,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:32,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:35:32,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:35:32,347 INFO L87 Difference]: Start difference. First operand 64 states and 146 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:32,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:32,380 INFO L93 Difference]: Finished difference Result 76 states and 170 transitions. [2022-03-15 19:35:32,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:35:32,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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:35:32,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:32,381 INFO L225 Difference]: With dead ends: 76 [2022-03-15 19:35:32,381 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 19:35:32,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:35:32,382 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:32,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:35:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 19:35:32,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2022-03-15 19:35:32,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.305084745762712) internal successors, (136), 59 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:35:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 136 transitions. [2022-03-15 19:35:32,385 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 136 transitions. Word has length 15 [2022-03-15 19:35:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:32,385 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 136 transitions. [2022-03-15 19:35:32,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 136 transitions. [2022-03-15 19:35:32,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:35:32,386 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:32,386 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:32,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 19:35:32,586 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:35:32,586 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:32,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:32,587 INFO L85 PathProgramCache]: Analyzing trace with hash 37273183, now seen corresponding path program 3 times [2022-03-15 19:35:32,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:32,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748938848] [2022-03-15 19:35:32,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:32,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:32,648 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:35:32,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:32,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748938848] [2022-03-15 19:35:32,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748938848] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:32,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733307188] [2022-03-15 19:35:32,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:35:32,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:32,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:32,650 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:35:32,651 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:35:32,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:35:32,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:32,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:35:32,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:32,773 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:35:32,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:32,908 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:35:32,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733307188] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:32,908 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:32,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-03-15 19:35:32,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [828090505] [2022-03-15 19:35:32,908 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:32,910 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:32,914 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 88 transitions. [2022-03-15 19:35:32,914 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:33,357 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [1211#(and (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)) (or (<= 2 ~M~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0))), 1212#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 1213#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 1216#(and (or (<= ~M~0 1) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= ~M~0 1) (<= 0 ~counter~0))), 1210#(and (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0))), 1214#(and (or (<= 0 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))) (or (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)))), 1217#(or (<= ~M~0 1) (<= 0 ~counter~0)), 1215#(and (or (<= 0 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))) (or (<= 2 ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))))] [2022-03-15 19:35:33,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:35:33,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:33,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:35:33,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:35:33,358 INFO L87 Difference]: Start difference. First operand 60 states and 136 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 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:35:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:33,892 INFO L93 Difference]: Finished difference Result 142 states and 313 transitions. [2022-03-15 19:35:33,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:35:33,893 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 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 16 [2022-03-15 19:35:33,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:33,894 INFO L225 Difference]: With dead ends: 142 [2022-03-15 19:35:33,894 INFO L226 Difference]: Without dead ends: 142 [2022-03-15 19:35:33,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=372, Invalid=1268, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:35:33,895 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 91 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:33,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 24 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:35:33,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-03-15 19:35:33,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 66. [2022-03-15 19:35:33,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.3076923076923075) internal successors, (150), 65 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:33,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 150 transitions. [2022-03-15 19:35:33,899 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 150 transitions. Word has length 16 [2022-03-15 19:35:33,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:33,899 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 150 transitions. [2022-03-15 19:35:33,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 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:35:33,899 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 150 transitions. [2022-03-15 19:35:33,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:35:33,900 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:33,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:35:33,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 19:35:34,111 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:35:34,111 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:34,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:34,112 INFO L85 PathProgramCache]: Analyzing trace with hash -237766665, now seen corresponding path program 4 times [2022-03-15 19:35:34,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:34,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825933450] [2022-03-15 19:35:34,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:34,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:34,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:34,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825933450] [2022-03-15 19:35:34,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825933450] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:34,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651381635] [2022-03-15 19:35:34,165 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:35:34,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:34,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:34,166 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:35:34,167 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:35:34,201 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:35:34,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:34,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:35:34,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:34,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:34,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651381635] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:34,326 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:34,326 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-03-15 19:35:34,327 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1031313852] [2022-03-15 19:35:34,327 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:34,328 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:34,332 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 62 transitions. [2022-03-15 19:35:34,332 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:34,549 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [1632#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0))), 1630#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 1634#(< thread2Thread1of1ForFork1_~i~1 ~M~0), 1631#(and (or (not (< 0 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 0 ~M~0)) (<= 0 ~counter~0))), 1633#(or (not (< 0 ~M~0)) (<= 0 ~counter~0))] [2022-03-15 19:35:34,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:35:34,549 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:34,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:35:34,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:35:34,550 INFO L87 Difference]: Start difference. First operand 66 states and 150 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:34,981 INFO L93 Difference]: Finished difference Result 130 states and 288 transitions. [2022-03-15 19:35:34,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:35:34,981 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 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:35:34,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:34,982 INFO L225 Difference]: With dead ends: 130 [2022-03-15 19:35:34,982 INFO L226 Difference]: Without dead ends: 124 [2022-03-15 19:35:34,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=918, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:35:34,983 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 71 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:34,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 19 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:35:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-03-15 19:35:34,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 76. [2022-03-15 19:35:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 2.3866666666666667) internal successors, (179), 75 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 179 transitions. [2022-03-15 19:35:34,987 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 179 transitions. Word has length 16 [2022-03-15 19:35:34,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:34,987 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 179 transitions. [2022-03-15 19:35:34,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:34,987 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 179 transitions. [2022-03-15 19:35:34,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:35:34,988 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:34,988 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:35,007 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:35:35,188 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:35:35,189 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:35,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:35,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1154463581, now seen corresponding path program 5 times [2022-03-15 19:35:35,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:35,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124674054] [2022-03-15 19:35:35,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:35,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:35,249 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:35:35,250 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:35,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124674054] [2022-03-15 19:35:35,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124674054] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:35,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370399542] [2022-03-15 19:35:35,250 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:35:35,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:35,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:35,251 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:35:35,252 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:35:35,297 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:35:35,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:35,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 19:35:35,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:35,354 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:35:35,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:35,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370399542] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:35,448 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:35,448 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 5] total 8 [2022-03-15 19:35:35,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1667396163] [2022-03-15 19:35:35,449 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:35,450 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:35,456 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 100 transitions. [2022-03-15 19:35:35,456 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:35,778 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:35:35,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:35:35,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:35,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:35:35,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:35:35,779 INFO L87 Difference]: Start difference. First operand 76 states and 179 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:35,823 INFO L93 Difference]: Finished difference Result 149 states and 344 transitions. [2022-03-15 19:35:35,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:35:35,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 19:35:35,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:35,825 INFO L225 Difference]: With dead ends: 149 [2022-03-15 19:35:35,825 INFO L226 Difference]: Without dead ends: 126 [2022-03-15 19:35:35,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:35:35,826 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:35,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 12 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:35:35,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-03-15 19:35:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 98. [2022-03-15 19:35:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.484536082474227) internal successors, (241), 97 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 241 transitions. [2022-03-15 19:35:35,837 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 241 transitions. Word has length 17 [2022-03-15 19:35:35,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:35,837 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 241 transitions. [2022-03-15 19:35:35,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:35,837 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 241 transitions. [2022-03-15 19:35:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:35:35,839 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:35,839 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:35,857 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:35:36,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:36,040 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:36,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:36,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2103194683, now seen corresponding path program 6 times [2022-03-15 19:35:36,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:36,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174066802] [2022-03-15 19:35:36,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:36,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:36,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:35:36,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:36,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174066802] [2022-03-15 19:35:36,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174066802] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:36,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792317575] [2022-03-15 19:35:36,079 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:35:36,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:36,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:36,084 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:35:36,085 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:35:36,128 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:35:36,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:36,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 19:35:36,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:36,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:36,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792317575] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:36,446 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:36,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2022-03-15 19:35:36,446 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1545416208] [2022-03-15 19:35:36,446 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:36,447 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:36,451 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 65 transitions. [2022-03-15 19:35:36,451 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:36,589 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:35:36,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:35:36,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:36,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:35:36,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:35:36,590 INFO L87 Difference]: Start difference. First operand 98 states and 241 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:36,668 INFO L93 Difference]: Finished difference Result 150 states and 354 transitions. [2022-03-15 19:35:36,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:35:36,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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:35:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:36,669 INFO L225 Difference]: With dead ends: 150 [2022-03-15 19:35:36,669 INFO L226 Difference]: Without dead ends: 146 [2022-03-15 19:35:36,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:35:36,670 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:36,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 9 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:35:36,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-03-15 19:35:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 110. [2022-03-15 19:35:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 2.5779816513761467) internal successors, (281), 109 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:35:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 281 transitions. [2022-03-15 19:35:36,678 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 281 transitions. Word has length 17 [2022-03-15 19:35:36,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:36,678 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 281 transitions. [2022-03-15 19:35:36,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 281 transitions. [2022-03-15 19:35:36,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:35:36,679 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:36,679 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:36,709 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:35:36,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:36,900 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:36,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:36,900 INFO L85 PathProgramCache]: Analyzing trace with hash 418466722, now seen corresponding path program 7 times [2022-03-15 19:35:36,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:36,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155604298] [2022-03-15 19:35:36,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:36,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:36,993 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:35:36,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:36,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155604298] [2022-03-15 19:35:36,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155604298] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:36,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157296295] [2022-03-15 19:35:36,994 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:35:36,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:36,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:36,995 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:35:37,019 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:35:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:37,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:35:37,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:37,150 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:35:37,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:37,413 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:35:37,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157296295] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:37,414 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:37,414 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-03-15 19:35:37,415 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [870603568] [2022-03-15 19:35:37,415 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:37,417 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:37,422 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 112 transitions. [2022-03-15 19:35:37,422 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:38,072 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [3015#(and (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 1 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)))), 3020#(and (or (<= ~M~0 2) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= ~M~0 2) (<= 0 ~counter~0))), 3016#(and (or (<= 2 ~counter~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)) (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 3 ~M~0))), 3021#(or (<= ~M~0 2) (<= 0 ~counter~0)), 3019#(and (or (<= 3 ~M~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= 0 ~counter~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0)))), 3013#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 3018#(and (or (<= 3 ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))) (or (<= 1 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)))), 3012#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 3011#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 3014#(and (or (<= 2 ~counter~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)) (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0))), 3017#(and (or (<= 0 ~counter~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))))] [2022-03-15 19:35:38,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:35:38,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:38,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:35:38,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:35:38,073 INFO L87 Difference]: Start difference. First operand 110 states and 281 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 20 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:35:39,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:39,003 INFO L93 Difference]: Finished difference Result 294 states and 678 transitions. [2022-03-15 19:35:39,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 19:35:39,004 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 20 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 18 [2022-03-15 19:35:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:39,005 INFO L225 Difference]: With dead ends: 294 [2022-03-15 19:35:39,005 INFO L226 Difference]: Without dead ends: 294 [2022-03-15 19:35:39,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=746, Invalid=2676, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:35:39,006 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 183 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:39,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 25 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:35:39,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-03-15 19:35:39,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 118. [2022-03-15 19:35:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.5811965811965814) internal successors, (302), 117 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 302 transitions. [2022-03-15 19:35:39,010 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 302 transitions. Word has length 18 [2022-03-15 19:35:39,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:39,010 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 302 transitions. [2022-03-15 19:35:39,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 20 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:35:39,010 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 302 transitions. [2022-03-15 19:35:39,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:35:39,011 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:39,011 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:39,029 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:35:39,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-03-15 19:35:39,227 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:39,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:39,228 INFO L85 PathProgramCache]: Analyzing trace with hash -766244470, now seen corresponding path program 8 times [2022-03-15 19:35:39,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:39,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483014068] [2022-03-15 19:35:39,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:39,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:39,328 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:35:39,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:39,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483014068] [2022-03-15 19:35:39,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483014068] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:39,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070731231] [2022-03-15 19:35:39,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:35:39,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:39,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:39,340 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:35:39,341 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:35:39,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:35:39,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:39,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:35:39,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:39,493 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:35:39,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:39,697 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:35:39,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070731231] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:39,697 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:39,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-03-15 19:35:39,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1279082819] [2022-03-15 19:35:39,697 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:39,698 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:39,702 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 81 transitions. [2022-03-15 19:35:39,702 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:40,118 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [3735#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 3732#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 3730#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 1 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 3737#(or (not (< 1 ~M~0)) (<= 0 ~counter~0)), 3731#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 3733#(and (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 3736#(and (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 3734#(and (or (not (< 1 ~M~0)) (<= 0 ~counter~0)) (or (not (< 1 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:35:40,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:35:40,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:40,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:35:40,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2022-03-15 19:35:40,120 INFO L87 Difference]: Start difference. First operand 118 states and 302 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:40,744 INFO L93 Difference]: Finished difference Result 292 states and 677 transitions. [2022-03-15 19:35:40,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:35:40,745 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 19:35:40,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:40,746 INFO L225 Difference]: With dead ends: 292 [2022-03-15 19:35:40,746 INFO L226 Difference]: Without dead ends: 280 [2022-03-15 19:35:40,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=515, Invalid=1837, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:35:40,747 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 117 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:40,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 20 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:35:40,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-03-15 19:35:40,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 120. [2022-03-15 19:35:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 2.630252100840336) internal successors, (313), 119 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 313 transitions. [2022-03-15 19:35:40,751 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 313 transitions. Word has length 18 [2022-03-15 19:35:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:40,751 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 313 transitions. [2022-03-15 19:35:40,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 313 transitions. [2022-03-15 19:35:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:35:40,751 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:40,751 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:40,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 19:35:40,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 19:35:40,979 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:40,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1455775754, now seen corresponding path program 9 times [2022-03-15 19:35:40,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:40,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171358887] [2022-03-15 19:35:40,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:40,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:41,053 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:35:41,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:41,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171358887] [2022-03-15 19:35:41,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171358887] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:41,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205979097] [2022-03-15 19:35:41,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:35:41,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:41,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:41,055 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:35:41,060 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:35:41,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:35:41,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:41,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 19:35:41,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:41,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:41,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205979097] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:41,375 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:41,376 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-03-15 19:35:41,376 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [679455823] [2022-03-15 19:35:41,376 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:41,377 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:41,381 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 77 transitions. [2022-03-15 19:35:41,381 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:41,724 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [4434#(and (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 4437#(or (not (< 1 ~M~0)) (<= 0 ~counter~0)), 4436#(and (or (not (< 1 ~M~0)) (<= 0 ~counter~0)) (or (not (< 1 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 4435#(< thread2Thread1of1ForFork1_~i~1 ~M~0), 4432#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 4433#(and (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 4431#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 1 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)))] [2022-03-15 19:35:41,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:35:41,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:41,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:35:41,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2022-03-15 19:35:41,725 INFO L87 Difference]: Start difference. First operand 120 states and 313 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:42,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:42,381 INFO L93 Difference]: Finished difference Result 230 states and 531 transitions. [2022-03-15 19:35:42,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:35:42,382 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 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:35:42,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:42,383 INFO L225 Difference]: With dead ends: 230 [2022-03-15 19:35:42,383 INFO L226 Difference]: Without dead ends: 224 [2022-03-15 19:35:42,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=667, Invalid=2195, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:35:42,384 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 121 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:42,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 21 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:35:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-03-15 19:35:42,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 118. [2022-03-15 19:35:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.52991452991453) internal successors, (296), 117 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:42,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 296 transitions. [2022-03-15 19:35:42,387 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 296 transitions. Word has length 18 [2022-03-15 19:35:42,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:42,388 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 296 transitions. [2022-03-15 19:35:42,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:42,388 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 296 transitions. [2022-03-15 19:35:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:35:42,388 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:42,388 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:42,411 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:35:42,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 19:35:42,605 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:42,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:42,605 INFO L85 PathProgramCache]: Analyzing trace with hash 86561402, now seen corresponding path program 10 times [2022-03-15 19:35:42,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:42,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761631180] [2022-03-15 19:35:42,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:42,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:42,671 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:35:42,671 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:42,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761631180] [2022-03-15 19:35:42,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761631180] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:42,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997175555] [2022-03-15 19:35:42,672 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:35:42,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:42,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:42,673 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:35:42,674 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:35:42,722 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:35:42,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:42,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:35:42,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:42,775 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:35:42,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:42,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:42,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997175555] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:42,882 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:42,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 6] total 10 [2022-03-15 19:35:42,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [636778101] [2022-03-15 19:35:42,882 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:42,883 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:42,889 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 124 transitions. [2022-03-15 19:35:42,889 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:43,367 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:35:43,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:35:43,368 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:43,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:35:43,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:35:43,368 INFO L87 Difference]: Start difference. First operand 118 states and 296 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:43,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:43,440 INFO L93 Difference]: Finished difference Result 223 states and 533 transitions. [2022-03-15 19:35:43,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:35:43,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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:35:43,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:43,441 INFO L225 Difference]: With dead ends: 223 [2022-03-15 19:35:43,441 INFO L226 Difference]: Without dead ends: 196 [2022-03-15 19:35:43,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:35:43,442 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:43,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 20 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:35:43,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-03-15 19:35:43,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 150. [2022-03-15 19:35:43,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.577181208053691) internal successors, (384), 149 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 384 transitions. [2022-03-15 19:35:43,451 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 384 transitions. Word has length 19 [2022-03-15 19:35:43,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:43,452 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 384 transitions. [2022-03-15 19:35:43,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 384 transitions. [2022-03-15 19:35:43,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:35:43,452 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:43,452 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:43,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-03-15 19:35:43,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 19:35:43,667 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:43,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:43,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1142987246, now seen corresponding path program 11 times [2022-03-15 19:35:43,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:43,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683290774] [2022-03-15 19:35:43,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:43,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:35:43,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:43,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683290774] [2022-03-15 19:35:43,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683290774] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:43,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346390201] [2022-03-15 19:35:43,719 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:35:43,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:43,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:43,721 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:35:43,723 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:35:43,769 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:35:43,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:43,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:35:43,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:35:43,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:35:43,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346390201] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:43,909 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:43,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-03-15 19:35:43,910 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [373763584] [2022-03-15 19:35:43,910 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:43,911 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:43,916 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 80 transitions. [2022-03-15 19:35:43,916 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:44,066 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:35:44,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:35:44,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:44,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:35:44,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-03-15 19:35:44,067 INFO L87 Difference]: Start difference. First operand 150 states and 384 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:44,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:44,155 INFO L93 Difference]: Finished difference Result 232 states and 560 transitions. [2022-03-15 19:35:44,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:35:44,156 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:35:44,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:44,157 INFO L225 Difference]: With dead ends: 232 [2022-03-15 19:35:44,157 INFO L226 Difference]: Without dead ends: 228 [2022-03-15 19:35:44,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:35:44,158 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:44,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 16 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:35:44,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-03-15 19:35:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 148. [2022-03-15 19:35:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 2.6054421768707483) internal successors, (383), 147 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 383 transitions. [2022-03-15 19:35:44,162 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 383 transitions. Word has length 19 [2022-03-15 19:35:44,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:44,162 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 383 transitions. [2022-03-15 19:35:44,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 383 transitions. [2022-03-15 19:35:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:35:44,163 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:44,163 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:44,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-15 19:35:44,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 19:35:44,379 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:44,380 INFO L85 PathProgramCache]: Analyzing trace with hash -709742918, now seen corresponding path program 12 times [2022-03-15 19:35:44,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:44,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741680330] [2022-03-15 19:35:44,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:44,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:44,480 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:44,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741680330] [2022-03-15 19:35:44,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741680330] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:44,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380757147] [2022-03-15 19:35:44,480 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:35:44,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:44,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:44,481 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:35:44,482 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:35:44,538 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:35:44,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:44,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:35:44,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:44,705 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:44,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:44,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380757147] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:44,932 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:44,932 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-03-15 19:35:44,932 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2063262589] [2022-03-15 19:35:44,932 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:44,935 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:44,939 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 75 transitions. [2022-03-15 19:35:44,939 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:45,360 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [6384#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 6385#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 6387#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 0))), 6386#(and (or (not (< 0 ~M~0)) (<= ~counter~0 0)) (or (not (< 0 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 0 ~M~0)) (<= 0 ~counter~0))), 6383#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 6388#(and (or (not (< 0 ~M~0)) (<= ~counter~0 0)) (or (not (< 0 ~M~0)) (<= 0 ~counter~0)))] [2022-03-15 19:35:45,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:35:45,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:45,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:35:45,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:35:45,361 INFO L87 Difference]: Start difference. First operand 148 states and 383 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:45,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:45,912 INFO L93 Difference]: Finished difference Result 358 states and 861 transitions. [2022-03-15 19:35:45,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:35:45,913 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 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:35:45,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:45,914 INFO L225 Difference]: With dead ends: 358 [2022-03-15 19:35:45,914 INFO L226 Difference]: Without dead ends: 342 [2022-03-15 19:35:45,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=347, Invalid=1723, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:35:45,915 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 87 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:45,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 18 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:35:45,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-03-15 19:35:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 182. [2022-03-15 19:35:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 2.7403314917127073) internal successors, (496), 181 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 496 transitions. [2022-03-15 19:35:45,923 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 496 transitions. Word has length 19 [2022-03-15 19:35:45,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:45,924 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 496 transitions. [2022-03-15 19:35:45,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 496 transitions. [2022-03-15 19:35:45,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:35:45,924 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:45,924 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:45,941 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:35:46,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 19:35:46,135 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:46,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:46,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1512277306, now seen corresponding path program 13 times [2022-03-15 19:35:46,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:46,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280591576] [2022-03-15 19:35:46,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:46,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:46,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:46,214 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:46,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280591576] [2022-03-15 19:35:46,214 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280591576] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:46,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959659963] [2022-03-15 19:35:46,214 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:35:46,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:46,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:46,215 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:35:46,216 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:35:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:46,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:35:46,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:46,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:46,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959659963] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:46,674 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:46,674 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 21 [2022-03-15 19:35:46,674 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [733172179] [2022-03-15 19:35:46,674 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:46,675 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:46,679 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 71 transitions. [2022-03-15 19:35:46,679 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:47,022 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [7276#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 7278#(and (or (not (< 0 ~M~0)) (<= ~counter~0 0)) (or (not (< 0 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 0 ~M~0)) (<= 0 ~counter~0))), 7277#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 0))), 7275#(< thread2Thread1of1ForFork1_~i~1 ~M~0), 7279#(and (or (not (< 0 ~M~0)) (<= ~counter~0 0)) (or (not (< 0 ~M~0)) (<= 0 ~counter~0)))] [2022-03-15 19:35:47,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:35:47,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:47,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:35:47,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:35:47,024 INFO L87 Difference]: Start difference. First operand 182 states and 496 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:47,391 INFO L93 Difference]: Finished difference Result 270 states and 684 transitions. [2022-03-15 19:35:47,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:35:47,392 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:35:47,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:47,393 INFO L225 Difference]: With dead ends: 270 [2022-03-15 19:35:47,393 INFO L226 Difference]: Without dead ends: 268 [2022-03-15 19:35:47,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=1281, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:35:47,394 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 63 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:47,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 20 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:35:47,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-03-15 19:35:47,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 180. [2022-03-15 19:35:47,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.7318435754189943) internal successors, (489), 179 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 489 transitions. [2022-03-15 19:35:47,398 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 489 transitions. Word has length 19 [2022-03-15 19:35:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:47,399 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 489 transitions. [2022-03-15 19:35:47,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:47,399 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 489 transitions. [2022-03-15 19:35:47,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:35:47,399 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:47,399 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:47,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 19:35:47,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:47,606 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:47,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:47,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1463183743, now seen corresponding path program 14 times [2022-03-15 19:35:47,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:47,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731980731] [2022-03-15 19:35:47,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:47,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:47,731 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:35:47,731 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:47,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731980731] [2022-03-15 19:35:47,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731980731] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:47,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732634725] [2022-03-15 19:35:47,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:35:47,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:47,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:47,733 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:35:47,734 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:35:47,797 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:35:47,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:47,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 19:35:47,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:47,911 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:35:47,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:48,283 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:35:48,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732634725] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:48,284 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:48,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2022-03-15 19:35:48,284 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1863602030] [2022-03-15 19:35:48,284 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:48,285 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:48,292 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 136 transitions. [2022-03-15 19:35:48,293 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:49,292 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [8085#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 8087#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (<= ~M~0 3)) (or (<= 0 ~counter~0) (<= ~M~0 3))), 8080#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 8082#(and (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 3 ~counter~0)) (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 4 ~M~0))), 8076#(and (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 3 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0))), 8077#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))) (or (<= 2 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)))), 8086#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0))) (or (<= 0 ~counter~0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)))), 8081#(and (or (<= 1 ~counter~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0)))), 8089#(or (<= 0 ~counter~0) (<= ~M~0 3)), 8079#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 8084#(and (or (<= 1 ~counter~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= 4 ~M~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0)))), 8078#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 8083#(and (or (<= 2 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))) (or (<= 4 ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)))), 8088#(and (or (<= 4 ~M~0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0))) (or (<= 0 ~counter~0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0))))] [2022-03-15 19:35:49,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:35:49,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:49,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:35:49,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1309, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:35:49,293 INFO L87 Difference]: Start difference. First operand 180 states and 489 transitions. Second operand has 26 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 25 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:35:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:50,568 INFO L93 Difference]: Finished difference Result 504 states and 1168 transitions. [2022-03-15 19:35:50,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 19:35:50,569 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 25 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:35:50,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:50,571 INFO L225 Difference]: With dead ends: 504 [2022-03-15 19:35:50,571 INFO L226 Difference]: Without dead ends: 504 [2022-03-15 19:35:50,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1405, Invalid=5075, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 19:35:50,573 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 220 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:50,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 40 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:35:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-03-15 19:35:50,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 190. [2022-03-15 19:35:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 2.7354497354497354) internal successors, (517), 189 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 517 transitions. [2022-03-15 19:35:50,578 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 517 transitions. Word has length 20 [2022-03-15 19:35:50,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:50,579 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 517 transitions. [2022-03-15 19:35:50,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 25 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:35:50,581 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 517 transitions. [2022-03-15 19:35:50,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:35:50,582 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:50,582 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:50,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 19:35:50,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 19:35:50,795 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:50,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:50,795 INFO L85 PathProgramCache]: Analyzing trace with hash -903124841, now seen corresponding path program 15 times [2022-03-15 19:35:50,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:50,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740351390] [2022-03-15 19:35:50,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:50,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:50,891 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:35:50,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:50,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740351390] [2022-03-15 19:35:50,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740351390] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:50,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676692904] [2022-03-15 19:35:50,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:35:50,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:50,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:50,892 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:35:50,893 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:35:50,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:35:50,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:50,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 19:35:50,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:51,130 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:35:51,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:51,366 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:35:51,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676692904] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:51,367 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:51,367 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2022-03-15 19:35:51,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [305374527] [2022-03-15 19:35:51,367 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:51,368 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:51,374 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 105 transitions. [2022-03-15 19:35:51,374 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:52,068 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [9201#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 9204#(and (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 9199#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 9207#(or (<= 0 ~counter~0) (not (< 2 ~M~0))), 9197#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 9206#(and (or (<= 0 ~counter~0) (not (< 2 ~M~0))) (or (not (< 2 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 9205#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 9202#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 9198#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 9200#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 9203#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)))] [2022-03-15 19:35:52,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:35:52,069 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:52,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:35:52,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1204, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:35:52,070 INFO L87 Difference]: Start difference. First operand 190 states and 517 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 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:35:53,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:53,020 INFO L93 Difference]: Finished difference Result 596 states and 1414 transitions. [2022-03-15 19:35:53,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 19:35:53,020 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 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 20 [2022-03-15 19:35:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:53,022 INFO L225 Difference]: With dead ends: 596 [2022-03-15 19:35:53,022 INFO L226 Difference]: Without dead ends: 572 [2022-03-15 19:35:53,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1254 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=883, Invalid=3539, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 19:35:53,023 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 211 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:53,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 25 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:35:53,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-03-15 19:35:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 218. [2022-03-15 19:35:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.8433179723502304) internal successors, (617), 217 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 617 transitions. [2022-03-15 19:35:53,030 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 617 transitions. Word has length 20 [2022-03-15 19:35:53,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:53,030 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 617 transitions. [2022-03-15 19:35:53,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 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:35:53,030 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 617 transitions. [2022-03-15 19:35:53,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:35:53,039 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:53,039 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:53,056 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:35:53,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 19:35:53,240 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:53,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1988385129, now seen corresponding path program 16 times [2022-03-15 19:35:53,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:53,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846732920] [2022-03-15 19:35:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:53,318 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:35:53,318 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:53,318 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846732920] [2022-03-15 19:35:53,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846732920] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:53,318 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818838773] [2022-03-15 19:35:53,318 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:35:53,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:53,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:53,319 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:35:53,320 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:35:53,361 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:35:53,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:53,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:35:53,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:53,578 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:35:53,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:53,761 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:35:53,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818838773] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:53,761 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:53,761 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2022-03-15 19:35:53,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1528194141] [2022-03-15 19:35:53,762 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:53,763 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:53,770 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 96 transitions. [2022-03-15 19:35:53,770 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:54,359 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [10438#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 10444#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 10441#(and (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 10447#(or (<= 0 ~counter~0) (not (< 2 ~M~0))), 10445#(and (or (<= 0 ~counter~0) (not (< 2 ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 2 ~M~0)))), 10446#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 10440#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 10439#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 10443#(and (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 10442#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)))] [2022-03-15 19:35:54,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:35:54,359 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:54,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:35:54,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1068, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:35:54,360 INFO L87 Difference]: Start difference. First operand 218 states and 617 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:55,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:55,503 INFO L93 Difference]: Finished difference Result 528 states and 1285 transitions. [2022-03-15 19:35:55,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 19:35:55,503 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 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:35:55,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:55,505 INFO L225 Difference]: With dead ends: 528 [2022-03-15 19:35:55,505 INFO L226 Difference]: Without dead ends: 516 [2022-03-15 19:35:55,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=977, Invalid=3715, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 19:35:55,507 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 148 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:55,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 38 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:35:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-03-15 19:35:55,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 226. [2022-03-15 19:35:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 2.848888888888889) internal successors, (641), 225 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 641 transitions. [2022-03-15 19:35:55,514 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 641 transitions. Word has length 20 [2022-03-15 19:35:55,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:55,514 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 641 transitions. [2022-03-15 19:35:55,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:55,514 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 641 transitions. [2022-03-15 19:35:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:35:55,514 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:55,514 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:55,534 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:35:55,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 19:35:55,732 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:55,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:55,732 INFO L85 PathProgramCache]: Analyzing trace with hash 233635095, now seen corresponding path program 17 times [2022-03-15 19:35:55,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:55,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838401682] [2022-03-15 19:35:55,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:55,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:55,835 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:55,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838401682] [2022-03-15 19:35:55,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838401682] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:55,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335197280] [2022-03-15 19:35:55,835 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:35:55,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:55,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:55,836 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:35:55,837 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:35:55,885 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:35:55,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:55,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:35:55,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:56,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:56,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335197280] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:56,238 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:56,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-03-15 19:35:56,238 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [762603491] [2022-03-15 19:35:56,239 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:56,240 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:56,245 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 92 transitions. [2022-03-15 19:35:56,245 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:56,686 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [11639#(and (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 11636#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 11641#(or (<= 0 ~counter~0) (not (< 2 ~M~0))), 11638#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 11640#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 11634#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 11635#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 11637#(and (or (<= 0 ~counter~0) (not (< 2 ~M~0))) (or (not (< 2 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 11633#(< thread2Thread1of1ForFork1_~i~1 ~M~0)] [2022-03-15 19:35:56,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:35:56,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:56,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:35:56,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=925, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:35:56,687 INFO L87 Difference]: Start difference. First operand 226 states and 641 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 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:35:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:57,841 INFO L93 Difference]: Finished difference Result 522 states and 1289 transitions. [2022-03-15 19:35:57,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 19:35:57,841 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 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 20 [2022-03-15 19:35:57,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:57,843 INFO L225 Difference]: With dead ends: 522 [2022-03-15 19:35:57,843 INFO L226 Difference]: Without dead ends: 516 [2022-03-15 19:35:57,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1396, Invalid=4924, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 19:35:57,845 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 137 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:57,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 29 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:35:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-03-15 19:35:57,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 226. [2022-03-15 19:35:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 2.8844444444444446) internal successors, (649), 225 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:57,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 649 transitions. [2022-03-15 19:35:57,852 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 649 transitions. Word has length 20 [2022-03-15 19:35:57,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:57,852 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 649 transitions. [2022-03-15 19:35:57,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 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:35:57,853 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 649 transitions. [2022-03-15 19:35:57,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:35:57,853 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:57,853 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:57,876 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:35:58,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:58,063 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:58,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:58,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1886949315, now seen corresponding path program 18 times [2022-03-15 19:35:58,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:58,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662450845] [2022-03-15 19:35:58,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:58,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:58,123 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:35:58,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:58,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662450845] [2022-03-15 19:35:58,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662450845] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:58,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883281400] [2022-03-15 19:35:58,124 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:35:58,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:58,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:58,125 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:35:58,159 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:35:58,191 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:35:58,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:58,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 19:35:58,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:58,251 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:35:58,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:58,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883281400] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:58,574 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:58,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 9] total 13 [2022-03-15 19:35:58,575 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1888669654] [2022-03-15 19:35:58,575 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:58,576 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:58,584 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 148 transitions. [2022-03-15 19:35:58,584 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:59,270 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:35:59,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:35:59,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:59,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:35:59,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:35:59,271 INFO L87 Difference]: Start difference. First operand 226 states and 649 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 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:35:59,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:59,381 INFO L93 Difference]: Finished difference Result 397 states and 1074 transitions. [2022-03-15 19:35:59,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:35:59,381 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 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 21 [2022-03-15 19:35:59,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:59,382 INFO L225 Difference]: With dead ends: 397 [2022-03-15 19:35:59,383 INFO L226 Difference]: Without dead ends: 366 [2022-03-15 19:35:59,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 88 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:35:59,383 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:59,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 30 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:35:59,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-03-15 19:35:59,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 294. [2022-03-15 19:35:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 2.955631399317406) internal successors, (866), 293 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 866 transitions. [2022-03-15 19:35:59,389 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 866 transitions. Word has length 21 [2022-03-15 19:35:59,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:59,389 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 866 transitions. [2022-03-15 19:35:59,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 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:35:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 866 transitions. [2022-03-15 19:35:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:35:59,390 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:59,390 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:59,406 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:35:59,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:59,603 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:59,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:59,603 INFO L85 PathProgramCache]: Analyzing trace with hash -374642011, now seen corresponding path program 19 times [2022-03-15 19:35:59,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:59,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107965198] [2022-03-15 19:35:59,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:59,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:35:59,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:59,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107965198] [2022-03-15 19:35:59,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107965198] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:59,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009618892] [2022-03-15 19:35:59,658 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:35:59,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:59,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:59,659 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:35:59,660 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:35:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:59,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 19:35:59,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:59,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:00,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009618892] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:00,460 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:00,460 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 27 [2022-03-15 19:36:00,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [633848371] [2022-03-15 19:36:00,460 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:00,461 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:00,475 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 95 transitions. [2022-03-15 19:36:00,475 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:00,674 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:36:00,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:36:00,675 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:00,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:36:00,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2022-03-15 19:36:00,675 INFO L87 Difference]: Start difference. First operand 294 states and 866 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:00,825 INFO L93 Difference]: Finished difference Result 446 states and 1189 transitions. [2022-03-15 19:36:00,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:36:00,825 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 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:36:00,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:00,827 INFO L225 Difference]: With dead ends: 446 [2022-03-15 19:36:00,827 INFO L226 Difference]: Without dead ends: 442 [2022-03-15 19:36:00,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:36:00,828 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 35 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:00,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 25 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:36:00,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-03-15 19:36:00,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 296. [2022-03-15 19:36:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 2.9661016949152543) internal successors, (875), 295 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:00,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 875 transitions. [2022-03-15 19:36:00,834 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 875 transitions. Word has length 21 [2022-03-15 19:36:00,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:00,834 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 875 transitions. [2022-03-15 19:36:00,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:00,834 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 875 transitions. [2022-03-15 19:36:00,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:36:00,835 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:00,835 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36: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:36:01,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-03-15 19:36:01,064 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:01,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:01,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1368364601, now seen corresponding path program 20 times [2022-03-15 19:36:01,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:01,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447526082] [2022-03-15 19:36:01,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:01,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:01,178 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:01,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:01,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447526082] [2022-03-15 19:36:01,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447526082] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:01,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651699616] [2022-03-15 19:36:01,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:36:01,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:01,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:01,180 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:36:01,181 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:36:01,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:36:01,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:01,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:36:01,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:01,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:01,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651699616] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:01,809 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:01,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2022-03-15 19:36:01,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [272495935] [2022-03-15 19:36:01,809 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:01,811 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:01,825 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 90 transitions. [2022-03-15 19:36:01,825 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:02,357 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [15176#(and (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 15178#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 1 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 1)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 15173#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 15175#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 1 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 1)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 15179#(and (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 15180#(and (or (not (< 1 ~M~0)) (<= ~counter~0 0)) (or (not (< 1 ~M~0)) (<= 0 ~counter~0))), 15174#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 15177#(and (or (not (< 1 ~M~0)) (<= ~counter~0 0)) (or (not (< 1 ~M~0)) (<= 0 ~counter~0)) (or (not (< 1 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:36:02,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:36:02,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:02,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:36:02,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1275, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:36:02,358 INFO L87 Difference]: Start difference. First operand 296 states and 875 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 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:36:03,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:03,425 INFO L93 Difference]: Finished difference Result 656 states and 1652 transitions. [2022-03-15 19:36:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 19:36:03,426 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 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 21 [2022-03-15 19:36:03,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:03,428 INFO L225 Difference]: With dead ends: 656 [2022-03-15 19:36:03,428 INFO L226 Difference]: Without dead ends: 638 [2022-03-15 19:36:03,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=678, Invalid=3744, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 19:36:03,430 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 127 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:03,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 41 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:36:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-03-15 19:36:03,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 324. [2022-03-15 19:36:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 3.0) internal successors, (969), 323 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 969 transitions. [2022-03-15 19:36:03,438 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 969 transitions. Word has length 21 [2022-03-15 19:36:03,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:03,438 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 969 transitions. [2022-03-15 19:36:03,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 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:36:03,438 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 969 transitions. [2022-03-15 19:36:03,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:36:03,439 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:03,439 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:03,456 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:36:03,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-03-15 19:36:03,656 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:03,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash -303918811, now seen corresponding path program 21 times [2022-03-15 19:36:03,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:03,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405229272] [2022-03-15 19:36:03,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:03,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:03,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:03,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405229272] [2022-03-15 19:36:03,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405229272] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:03,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277818128] [2022-03-15 19:36:03,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:36:03,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:03,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:03,782 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:36:03,783 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:36:03,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:36:03,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:03,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 19:36:03,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:03,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:04,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277818128] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:04,273 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:04,273 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 27 [2022-03-15 19:36:04,273 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [601068556] [2022-03-15 19:36:04,273 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:04,275 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:04,280 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 90 transitions. [2022-03-15 19:36:04,280 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:04,862 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [16689#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 16691#(or (<= ~counter~0 0) (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)), 16692#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 16690#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 16693#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 0))), 16695#(and (or (not (< 0 ~M~0)) (<= ~counter~0 0)) (or (not (< 0 ~M~0)) (<= 0 ~counter~0))), 16694#(and (or (not (< 0 ~M~0)) (<= ~counter~0 0)) (or (not (< 0 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 0 ~M~0)) (<= 0 ~counter~0)))] [2022-03-15 19:36:04,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:36:04,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:04,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:36:04,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:36:04,863 INFO L87 Difference]: Start difference. First operand 324 states and 969 transitions. Second operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:05,582 INFO L93 Difference]: Finished difference Result 704 states and 1856 transitions. [2022-03-15 19:36:05,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:36:05,583 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 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:36:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:05,586 INFO L225 Difference]: With dead ends: 704 [2022-03-15 19:36:05,586 INFO L226 Difference]: Without dead ends: 688 [2022-03-15 19:36:05,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=527, Invalid=2553, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 19:36:05,587 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 116 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:05,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 25 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:36:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-03-15 19:36:05,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 338. [2022-03-15 19:36:05,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 2.9970326409495547) internal successors, (1010), 337 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:05,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1010 transitions. [2022-03-15 19:36:05,595 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1010 transitions. Word has length 21 [2022-03-15 19:36:05,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:05,596 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 1010 transitions. [2022-03-15 19:36:05,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:05,596 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1010 transitions. [2022-03-15 19:36:05,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:36:05,597 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:05,597 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:05,619 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:36:05,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:05,811 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:05,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:05,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1802806782, now seen corresponding path program 22 times [2022-03-15 19:36:05,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:05,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714441025] [2022-03-15 19:36:05,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:05,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:05,930 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:36:05,931 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:05,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714441025] [2022-03-15 19:36:05,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714441025] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:05,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984265188] [2022-03-15 19:36:05,931 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:36:05,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:05,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:05,940 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:36:05,942 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:36:05,988 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:36:05,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:05,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:36:05,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:06,279 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:36:06,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:06,474 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:36:06,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984265188] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:06,474 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:06,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2022-03-15 19:36:06,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1021406602] [2022-03-15 19:36:06,474 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:06,476 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:06,484 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 160 transitions. [2022-03-15 19:36:06,484 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:07,691 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [18287#(and (or (<= 5 ~M~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= 2 ~counter~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0)))), 18278#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 18281#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 18288#(and (or (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)) (<= 5 ~M~0)) (or (<= 1 ~counter~0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)))), 18280#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 18284#(and (or (<= 0 ~counter~0) (<= ~M~0 4)) (or (<= ~M~0 4) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0))), 18274#(and (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 4 ~counter~0)) (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0))), 18282#(and (or (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 1 ~counter~0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)))), 18279#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 18290#(or (<= 0 ~counter~0) (<= ~M~0 4)), 18283#(and (or (<= 0 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4))) (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0))), 18289#(and (or (<= 0 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4))) (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)) (<= 5 ~M~0))), 18276#(and (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (<= 3 ~counter~0))), 18275#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 18286#(and (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (<= 5 ~M~0)) (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (<= 3 ~counter~0))), 18277#(and (or (<= 2 ~counter~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0))), 18285#(and (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 4 ~counter~0)) (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 5 ~M~0)))] [2022-03-15 19:36:07,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 19:36:07,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:07,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 19:36:07,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1883, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:36:07,692 INFO L87 Difference]: Start difference. First operand 338 states and 1010 transitions. Second operand has 31 states, 31 states have (on average 3.161290322580645) internal successors, (98), 30 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:36:09,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:09,542 INFO L93 Difference]: Finished difference Result 966 states and 2420 transitions. [2022-03-15 19:36:09,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-03-15 19:36:09,543 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.161290322580645) internal successors, (98), 30 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:36:09,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:09,546 INFO L225 Difference]: With dead ends: 966 [2022-03-15 19:36:09,546 INFO L226 Difference]: Without dead ends: 966 [2022-03-15 19:36:09,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3221 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2383, Invalid=8959, Unknown=0, NotChecked=0, Total=11342 [2022-03-15 19:36:09,548 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 266 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:09,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 35 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:36:09,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-03-15 19:36:09,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 358. [2022-03-15 19:36:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 3.0056022408963585) internal successors, (1073), 357 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1073 transitions. [2022-03-15 19:36:09,575 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 1073 transitions. Word has length 22 [2022-03-15 19:36:09,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:09,575 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 1073 transitions. [2022-03-15 19:36:09,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.161290322580645) internal successors, (98), 30 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:36:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 1073 transitions. [2022-03-15 19:36:09,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:36:09,576 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:09,576 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:09,594 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:36:09,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:09,792 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:09,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:09,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2143928854, now seen corresponding path program 23 times [2022-03-15 19:36:09,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:09,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503798913] [2022-03-15 19:36:09,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:09,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:09,890 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:36:09,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:09,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503798913] [2022-03-15 19:36:09,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503798913] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:09,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579034128] [2022-03-15 19:36:09,891 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:36:09,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:09,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:09,892 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:36:09,893 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:36:09,948 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:36:09,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:09,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:36:09,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:10,091 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:36:10,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:10,454 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:36:10,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579034128] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:10,454 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:10,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2022-03-15 19:36:10,455 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1435883925] [2022-03-15 19:36:10,455 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:10,456 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:10,464 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 129 transitions. [2022-03-15 19:36:10,464 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:11,437 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [20259#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 20257#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 20254#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 20264#(or (<= 0 ~counter~0) (not (< 3 ~M~0))), 20262#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 20256#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 20261#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 20253#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 20252#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 20255#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 20260#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 20263#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 20258#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 20251#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0)))] [2022-03-15 19:36:11,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 19:36:11,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:11,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 19:36:11,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1744, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:36:11,438 INFO L87 Difference]: Start difference. First operand 358 states and 1073 transitions. Second operand has 28 states, 28 states have (on average 3.0) internal successors, (84), 27 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:36:12,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:12,709 INFO L93 Difference]: Finished difference Result 1048 states and 2532 transitions. [2022-03-15 19:36:12,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 19:36:12,710 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0) internal successors, (84), 27 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 22 [2022-03-15 19:36:12,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:12,713 INFO L225 Difference]: With dead ends: 1048 [2022-03-15 19:36:12,713 INFO L226 Difference]: Without dead ends: 1016 [2022-03-15 19:36:12,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2610 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1734, Invalid=6638, Unknown=0, NotChecked=0, Total=8372 [2022-03-15 19:36:12,714 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 247 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:12,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 26 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:36:12,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2022-03-15 19:36:12,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 364. [2022-03-15 19:36:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 2.997245179063361) internal successors, (1088), 363 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 1088 transitions. [2022-03-15 19:36:12,723 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 1088 transitions. Word has length 22 [2022-03-15 19:36:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:12,723 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 1088 transitions. [2022-03-15 19:36:12,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0) internal successors, (84), 27 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:36:12,723 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 1088 transitions. [2022-03-15 19:36:12,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:36:12,724 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:12,724 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:12,740 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:36:12,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-15 19:36:12,939 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:12,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:12,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1427259414, now seen corresponding path program 24 times [2022-03-15 19:36:12,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:12,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694448805] [2022-03-15 19:36:12,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:12,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:13,034 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:36:13,034 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:13,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694448805] [2022-03-15 19:36:13,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694448805] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:13,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558901333] [2022-03-15 19:36:13,034 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:36:13,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:13,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:13,035 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:36:13,036 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:36:13,092 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:36:13,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:13,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:36:13,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:13,285 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:36:13,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:13,588 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:36:13,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558901333] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:13,588 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:13,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2022-03-15 19:36:13,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [542025609] [2022-03-15 19:36:13,588 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:13,590 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:13,597 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 120 transitions. [2022-03-15 19:36:13,597 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:14,381 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [22297#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 22299#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 22293#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 22303#(or (<= 0 ~counter~0) (not (< 3 ~M~0))), 22295#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 22298#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 22294#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 22302#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 22292#(and (or (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 22300#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 22291#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 22301#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 22296#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))))] [2022-03-15 19:36:14,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:36:14,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:14,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:36:14,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1693, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:36:14,382 INFO L87 Difference]: Start difference. First operand 364 states and 1088 transitions. Second operand has 27 states, 27 states have (on average 2.925925925925926) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:15,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:15,954 INFO L93 Difference]: Finished difference Result 1128 states and 2728 transitions. [2022-03-15 19:36:15,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 19:36:15,955 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.925925925925926) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 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:36:15,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:15,958 INFO L225 Difference]: With dead ends: 1128 [2022-03-15 19:36:15,958 INFO L226 Difference]: Without dead ends: 1088 [2022-03-15 19:36:15,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2594 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1890, Invalid=6852, Unknown=0, NotChecked=0, Total=8742 [2022-03-15 19:36:15,959 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 325 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:15,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 42 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:36:15,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2022-03-15 19:36:15,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 392. [2022-03-15 19:36:15,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 3.0485933503836318) internal successors, (1192), 391 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1192 transitions. [2022-03-15 19:36:15,971 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1192 transitions. Word has length 22 [2022-03-15 19:36:15,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:15,971 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 1192 transitions. [2022-03-15 19:36:15,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.925925925925926) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:15,971 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1192 transitions. [2022-03-15 19:36:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:36:15,972 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:15,972 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:15,990 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:36:16,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 19:36:16,195 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:16,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:16,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1782447594, now seen corresponding path program 25 times [2022-03-15 19:36:16,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:16,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409552852] [2022-03-15 19:36:16,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:16,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:16,328 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:36:16,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:16,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409552852] [2022-03-15 19:36:16,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409552852] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:16,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848392588] [2022-03-15 19:36:16,328 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:36:16,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:16,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:16,329 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:36:16,330 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:36:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:16,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:36:16,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:16,526 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:16,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:16,867 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:36:16,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848392588] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:16,867 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:16,867 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2022-03-15 19:36:16,867 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [875625945] [2022-03-15 19:36:16,867 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:16,869 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:16,875 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 111 transitions. [2022-03-15 19:36:16,875 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:17,493 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [24472#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 24479#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 24474#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 24477#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 24481#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 24482#(or (<= 0 ~counter~0) (not (< 3 ~M~0))), 24480#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 24483#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 24473#(and (or (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 24475#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 24478#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 24476#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:36:17,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:36:17,494 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:17,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:36:17,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1572, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:36:17,494 INFO L87 Difference]: Start difference. First operand 392 states and 1192 transitions. Second operand has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:19,067 INFO L93 Difference]: Finished difference Result 1054 states and 2546 transitions. [2022-03-15 19:36:19,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 19:36:19,068 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 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:36:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:19,071 INFO L225 Difference]: With dead ends: 1054 [2022-03-15 19:36:19,071 INFO L226 Difference]: Without dead ends: 1038 [2022-03-15 19:36:19,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2784 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2034, Invalid=6896, Unknown=0, NotChecked=0, Total=8930 [2022-03-15 19:36:19,072 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 292 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:19,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 34 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:36:19,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2022-03-15 19:36:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 410. [2022-03-15 19:36:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 3.0) internal successors, (1227), 409 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1227 transitions. [2022-03-15 19:36:19,082 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1227 transitions. Word has length 22 [2022-03-15 19:36:19,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:19,082 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 1227 transitions. [2022-03-15 19:36:19,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:19,082 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1227 transitions. [2022-03-15 19:36:19,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:36:19,083 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:19,083 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:19,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-03-15 19:36:19,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 19:36:19,299 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:19,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:19,300 INFO L85 PathProgramCache]: Analyzing trace with hash -290499478, now seen corresponding path program 26 times [2022-03-15 19:36:19,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:19,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306440609] [2022-03-15 19:36:19,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:19,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:19,398 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:19,399 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:19,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306440609] [2022-03-15 19:36:19,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306440609] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:19,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479816470] [2022-03-15 19:36:19,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:36:19,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:19,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:19,404 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:36:19,405 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:36:19,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:36:19,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:19,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:36:19,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:19,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:20,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479816470] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:20,037 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:20,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2022-03-15 19:36:20,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1758050246] [2022-03-15 19:36:20,038 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:20,039 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:20,068 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 107 transitions. [2022-03-15 19:36:20,068 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:20,682 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [26619#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 26626#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 26617#(< thread2Thread1of1ForFork1_~i~1 ~M~0), 26627#(or (<= 0 ~counter~0) (not (< 3 ~M~0))), 26620#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 26623#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 26621#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 26624#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 26622#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 26618#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 26625#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:36:20,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:36:20,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:20,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:36:20,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1374, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:36:20,684 INFO L87 Difference]: Start difference. First operand 410 states and 1227 transitions. Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 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:36:22,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:22,358 INFO L93 Difference]: Finished difference Result 1062 states and 2776 transitions. [2022-03-15 19:36:22,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-03-15 19:36:22,359 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 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 22 [2022-03-15 19:36:22,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:22,362 INFO L225 Difference]: With dead ends: 1062 [2022-03-15 19:36:22,362 INFO L226 Difference]: Without dead ends: 1056 [2022-03-15 19:36:22,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3736 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2781, Invalid=9651, Unknown=0, NotChecked=0, Total=12432 [2022-03-15 19:36:22,364 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 198 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:22,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 45 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:36:22,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2022-03-15 19:36:22,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 580. [2022-03-15 19:36:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 3.0500863557858375) internal successors, (1766), 579 states have internal predecessors, (1766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:22,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1766 transitions. [2022-03-15 19:36:22,376 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1766 transitions. Word has length 22 [2022-03-15 19:36:22,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:22,377 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 1766 transitions. [2022-03-15 19:36:22,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 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:36:22,377 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1766 transitions. [2022-03-15 19:36:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:36:22,378 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:22,378 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:22,399 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:36:22,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 19:36:22,587 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:22,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:22,588 INFO L85 PathProgramCache]: Analyzing trace with hash -358966708, now seen corresponding path program 27 times [2022-03-15 19:36:22,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:22,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708626047] [2022-03-15 19:36:22,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:22,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:22,696 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:36:22,696 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:22,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708626047] [2022-03-15 19:36:22,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708626047] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:22,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162014680] [2022-03-15 19:36:22,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:36:22,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:22,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:22,704 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:36:22,705 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:36:22,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:36:22,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:22,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:36:22,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:22,979 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:36:22,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:23,221 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:36:23,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162014680] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:23,221 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:23,222 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2022-03-15 19:36:23,222 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1955516246] [2022-03-15 19:36:23,222 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:23,223 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:23,230 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 120 transitions. [2022-03-15 19:36:23,230 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:24,125 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [29153#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 29156#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 29155#(and (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 29149#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 29152#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 29160#(or (<= 0 ~counter~0) (not (< 2 ~M~0))), 29159#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 29154#(and (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 29151#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 29158#(and (or (<= 0 ~counter~0) (not (< 2 ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 2 ~M~0)))), 29150#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 29157#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:36:24,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:36:24,125 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:24,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:36:24,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1707, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:36:24,126 INFO L87 Difference]: Start difference. First operand 580 states and 1766 transitions. Second operand has 26 states, 26 states have (on average 3.0) internal successors, (78), 25 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:25,273 INFO L93 Difference]: Finished difference Result 1346 states and 3608 transitions. [2022-03-15 19:36:25,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 19:36:25,287 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.0) internal successors, (78), 25 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:36:25,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:25,291 INFO L225 Difference]: With dead ends: 1346 [2022-03-15 19:36:25,292 INFO L226 Difference]: Without dead ends: 1314 [2022-03-15 19:36:25,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1876 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1258, Invalid=5222, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 19:36:25,296 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 168 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:25,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 25 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:36:25,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2022-03-15 19:36:25,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 610. [2022-03-15 19:36:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 609 states have (on average 3.045977011494253) internal successors, (1855), 609 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:25,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1855 transitions. [2022-03-15 19:36:25,314 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1855 transitions. Word has length 22 [2022-03-15 19:36:25,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:25,314 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 1855 transitions. [2022-03-15 19:36:25,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.0) internal successors, (78), 25 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:25,314 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1855 transitions. [2022-03-15 19:36:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:36:25,315 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:25,315 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:25,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-03-15 19:36:25,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 19:36:25,519 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:25,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:25,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1284222068, now seen corresponding path program 28 times [2022-03-15 19:36:25,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:25,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341596675] [2022-03-15 19:36:25,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:25,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:25,623 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:36:25,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:25,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341596675] [2022-03-15 19:36:25,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341596675] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:25,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025531422] [2022-03-15 19:36:25,624 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:36:25,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:25,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:25,625 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:36:25,625 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:36:25,674 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:36:25,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:25,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:36:25,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:25,905 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:36:25,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:26,112 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:36:26,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025531422] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:26,112 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:26,112 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 30 [2022-03-15 19:36:26,112 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2143702435] [2022-03-15 19:36:26,112 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:26,114 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:26,120 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 102 transitions. [2022-03-15 19:36:26,120 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:26,624 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [31961#(and (or (<= 0 ~counter~0) (not (< 2 ~M~0))) (or (not (< 2 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 31955#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 31959#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 31960#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 31963#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 31957#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 31964#(or (<= 0 ~counter~0) (not (< 2 ~M~0))), 31958#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 31956#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 31962#(and (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))))] [2022-03-15 19:36:26,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:36:26,624 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:26,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:36:26,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1346, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:36:26,624 INFO L87 Difference]: Start difference. First operand 610 states and 1855 transitions. Second operand has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 22 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:36:27,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:27,935 INFO L93 Difference]: Finished difference Result 1192 states and 3064 transitions. [2022-03-15 19:36:27,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 19:36:27,935 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 22 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 22 [2022-03-15 19:36:27,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:27,939 INFO L225 Difference]: With dead ends: 1192 [2022-03-15 19:36:27,939 INFO L226 Difference]: Without dead ends: 1164 [2022-03-15 19:36:27,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2262 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1404, Invalid=5736, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 19:36:27,939 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 203 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:27,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 41 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:36:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2022-03-15 19:36:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 564. [2022-03-15 19:36:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 563 states have (on average 3.040852575488455) internal successors, (1712), 563 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1712 transitions. [2022-03-15 19:36:27,950 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1712 transitions. Word has length 22 [2022-03-15 19:36:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:27,950 INFO L470 AbstractCegarLoop]: Abstraction has 564 states and 1712 transitions. [2022-03-15 19:36:27,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 22 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:36:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1712 transitions. [2022-03-15 19:36:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:36:27,952 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:27,952 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:27,970 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:36:28,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:28,167 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:28,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:28,168 INFO L85 PathProgramCache]: Analyzing trace with hash 937798156, now seen corresponding path program 29 times [2022-03-15 19:36:28,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:28,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26670545] [2022-03-15 19:36:28,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:28,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:36:28,264 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:28,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26670545] [2022-03-15 19:36:28,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26670545] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:28,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609479569] [2022-03-15 19:36:28,264 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:36:28,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:28,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:28,265 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:36:28,266 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:36:28,331 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:36:28,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:28,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:36:28,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:28,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:28,795 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:28,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609479569] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:28,796 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:28,796 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 30 [2022-03-15 19:36:28,796 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1205178001] [2022-03-15 19:36:28,796 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:28,798 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:28,803 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 98 transitions. [2022-03-15 19:36:28,804 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:29,291 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [34537#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 34539#(or (<= 0 ~counter~0) (not (< 2 ~M~0))), 34534#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 34531#(< thread2Thread1of1ForFork1_~i~1 ~M~0), 34538#(and (or (<= 0 ~counter~0) (not (< 2 ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 2 ~M~0)))), 34532#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 34536#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 34535#(and (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 34533#(and (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))))] [2022-03-15 19:36:29,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:36:29,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:29,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:36:29,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1196, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:36:29,292 INFO L87 Difference]: Start difference. First operand 564 states and 1712 transitions. Second operand has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:30,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:30,399 INFO L93 Difference]: Finished difference Result 1024 states and 2789 transitions. [2022-03-15 19:36:30,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 19:36:30,399 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 0 states have call successors, (0), 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:36:30,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:30,403 INFO L225 Difference]: With dead ends: 1024 [2022-03-15 19:36:30,403 INFO L226 Difference]: Without dead ends: 1022 [2022-03-15 19:36:30,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2214 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1623, Invalid=5859, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 19:36:30,404 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 234 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:30,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 32 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:36:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2022-03-15 19:36:30,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 584. [2022-03-15 19:36:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 583 states have (on average 3.0222984562607205) internal successors, (1762), 583 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1762 transitions. [2022-03-15 19:36:30,414 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1762 transitions. Word has length 22 [2022-03-15 19:36:30,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:30,414 INFO L470 AbstractCegarLoop]: Abstraction has 584 states and 1762 transitions. [2022-03-15 19:36:30,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:30,415 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1762 transitions. [2022-03-15 19:36:30,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:36:30,416 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:30,416 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:30,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-03-15 19:36:30,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-03-15 19:36:30,623 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:30,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:30,624 INFO L85 PathProgramCache]: Analyzing trace with hash -859715030, now seen corresponding path program 30 times [2022-03-15 19:36:30,624 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:30,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007000324] [2022-03-15 19:36:30,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:30,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:30,724 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:36:30,725 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:30,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007000324] [2022-03-15 19:36:30,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007000324] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:30,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501036860] [2022-03-15 19:36:30,725 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:36:30,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:30,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:30,726 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:36:30,727 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:36:30,788 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:36:30,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:30,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:36:30,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:30,945 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:36:30,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:31,306 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:36:31,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501036860] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:31,306 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:31,306 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 33 [2022-03-15 19:36:31,306 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [977703556] [2022-03-15 19:36:31,307 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:31,309 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:31,316 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 111 transitions. [2022-03-15 19:36:31,317 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:32,037 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [36992#(and (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 36990#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 36991#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 1 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 36995#(and (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 36993#(and (or (not (< 1 ~M~0)) (<= 0 ~counter~0)) (or (not (< 1 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 36996#(or (not (< 1 ~M~0)) (<= 0 ~counter~0)), 36994#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 36989#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 36988#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 36987#(< thread1Thread1of1ForFork0_~i~0 ~M~0)] [2022-03-15 19:36:32,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:36:32,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:32,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:36:32,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1509, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:36:32,038 INFO L87 Difference]: Start difference. First operand 584 states and 1762 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:32,860 INFO L93 Difference]: Finished difference Result 1386 states and 3820 transitions. [2022-03-15 19:36:32,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 19:36:32,860 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 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:36:32,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:32,864 INFO L225 Difference]: With dead ends: 1386 [2022-03-15 19:36:32,864 INFO L226 Difference]: Without dead ends: 1358 [2022-03-15 19:36:32,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1005, Invalid=3825, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 19:36:32,865 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 145 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:32,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 25 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:36:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2022-03-15 19:36:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 796. [2022-03-15 19:36:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 3.066666666666667) internal successors, (2438), 795 states have internal predecessors, (2438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2438 transitions. [2022-03-15 19:36:32,881 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 2438 transitions. Word has length 22 [2022-03-15 19:36:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:32,881 INFO L470 AbstractCegarLoop]: Abstraction has 796 states and 2438 transitions. [2022-03-15 19:36:32,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:32,881 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 2438 transitions. [2022-03-15 19:36:32,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:36:32,882 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:32,883 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:32,901 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:36:33,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:33,092 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:33,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:33,093 INFO L85 PathProgramCache]: Analyzing trace with hash -53440486, now seen corresponding path program 31 times [2022-03-15 19:36:33,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:33,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828822250] [2022-03-15 19:36:33,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:33,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:33,157 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:36:33,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:33,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828822250] [2022-03-15 19:36:33,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828822250] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:33,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744212461] [2022-03-15 19:36:33,158 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:36:33,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:33,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:33,159 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:36:33,159 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:36:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:33,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 19:36:33,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:33,272 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:36:33,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:33,625 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:33,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744212461] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:33,625 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:33,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 11] total 16 [2022-03-15 19:36:33,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [34288856] [2022-03-15 19:36:33,625 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:33,627 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:33,637 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 172 transitions. [2022-03-15 19:36:33,637 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:34,435 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:36:34,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:36:34,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:34,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:36:34,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:36:34,436 INFO L87 Difference]: Start difference. First operand 796 states and 2438 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:34,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:34,579 INFO L93 Difference]: Finished difference Result 1189 states and 3590 transitions. [2022-03-15 19:36:34,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:36:34,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:36:34,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:34,594 INFO L225 Difference]: With dead ends: 1189 [2022-03-15 19:36:34,595 INFO L226 Difference]: Without dead ends: 1154 [2022-03-15 19:36:34,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 101 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:36:34,595 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:34,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 42 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:36:34,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2022-03-15 19:36:34,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1046. [2022-03-15 19:36:34,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 1045 states have (on average 3.1511961722488038) internal successors, (3293), 1045 states have internal predecessors, (3293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 3293 transitions. [2022-03-15 19:36:34,611 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 3293 transitions. Word has length 23 [2022-03-15 19:36:34,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:34,611 INFO L470 AbstractCegarLoop]: Abstraction has 1046 states and 3293 transitions. [2022-03-15 19:36:34,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:34,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 3293 transitions. [2022-03-15 19:36:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:36:34,613 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:34,613 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:34,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-03-15 19:36:34,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:34,815 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:34,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:34,815 INFO L85 PathProgramCache]: Analyzing trace with hash 557055410, now seen corresponding path program 32 times [2022-03-15 19:36:34,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:34,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805694908] [2022-03-15 19:36:34,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:34,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:34,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805694908] [2022-03-15 19:36:34,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805694908] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:34,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895882806] [2022-03-15 19:36:34,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:36:34,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:34,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:34,952 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:36:34,952 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:36:35,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:36:35,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:35,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:36:35,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:35,202 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:35,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:36,119 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:36,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895882806] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:36,119 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:36,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 33 [2022-03-15 19:36:36,119 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1618317013] [2022-03-15 19:36:36,120 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:36,121 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:36,128 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 110 transitions. [2022-03-15 19:36:36,129 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:36,900 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [43627#(and (or (<= ~counter~0 3) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 43634#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 1) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 43632#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (<= ~counter~0 3) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 43635#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 43636#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (<= ~counter~0 0))), 43630#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 43628#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= ~counter~0 2)) (or (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 43626#(< thread2Thread1of1ForFork1_~i~1 ~M~0), 43633#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= ~counter~0 2)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 43631#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (<= ~counter~0 0)) (or (not (< 3 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 43629#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)) (or (<= ~counter~0 1) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:36:36,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:36:36,900 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:36,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:36:36,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1682, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:36:36,901 INFO L87 Difference]: Start difference. First operand 1046 states and 3293 transitions. Second operand has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:38,912 INFO L93 Difference]: Finished difference Result 1616 states and 4603 transitions. [2022-03-15 19:36:38,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 19:36:38,912 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:36:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:38,916 INFO L225 Difference]: With dead ends: 1616 [2022-03-15 19:36:38,916 INFO L226 Difference]: Without dead ends: 1610 [2022-03-15 19:36:38,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2671 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1413, Invalid=8687, Unknown=0, NotChecked=0, Total=10100 [2022-03-15 19:36:38,917 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 135 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1868 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:38,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 54 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1868 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:36:38,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2022-03-15 19:36:38,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1086. [2022-03-15 19:36:38,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 3.1511520737327188) internal successors, (3419), 1085 states have internal predecessors, (3419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:38,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 3419 transitions. [2022-03-15 19:36:38,938 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 3419 transitions. Word has length 23 [2022-03-15 19:36:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:38,938 INFO L470 AbstractCegarLoop]: Abstraction has 1086 states and 3419 transitions. [2022-03-15 19:36:38,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 3419 transitions. [2022-03-15 19:36:38,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:36:38,940 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:38,940 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:38,958 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:36:39,156 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,SelfDestructingSolverStorable33 [2022-03-15 19:36:39,156 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:39,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:39,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1722968678, now seen corresponding path program 33 times [2022-03-15 19:36:39,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:39,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187955112] [2022-03-15 19:36:39,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:39,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:39,297 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:39,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187955112] [2022-03-15 19:36:39,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187955112] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:39,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657908007] [2022-03-15 19:36:39,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:36:39,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:39,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:39,299 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:36:39,300 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:36:39,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:36:39,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:39,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 19:36:39,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:39,577 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:39,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:40,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657908007] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:40,247 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:40,247 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 35 [2022-03-15 19:36:40,247 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1541500150] [2022-03-15 19:36:40,247 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:40,249 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:40,256 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 105 transitions. [2022-03-15 19:36:40,256 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:40,974 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [47709#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 1) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 47706#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 47712#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 0))), 47707#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 2)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 47713#(and (or (<= ~counter~0 0) (not (< 2 ~M~0))) (or (<= 0 ~counter~0) (not (< 2 ~M~0))) (or (not (< 2 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 47710#(and (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 1) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 47714#(and (or (<= ~counter~0 0) (not (< 2 ~M~0))) (or (<= 0 ~counter~0) (not (< 2 ~M~0)))), 47711#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 0))), 47705#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 47708#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 2)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)))] [2022-03-15 19:36:40,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:36:40,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:40,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:36:40,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1798, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:36:40,982 INFO L87 Difference]: Start difference. First operand 1086 states and 3419 transitions. Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 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:36:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:43,214 INFO L93 Difference]: Finished difference Result 1906 states and 5267 transitions. [2022-03-15 19:36:43,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-15 19:36:43,214 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 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 23 [2022-03-15 19:36:43,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:43,218 INFO L225 Difference]: With dead ends: 1906 [2022-03-15 19:36:43,218 INFO L226 Difference]: Without dead ends: 1872 [2022-03-15 19:36:43,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2674 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1443, Invalid=8457, Unknown=0, NotChecked=0, Total=9900 [2022-03-15 19:36:43,219 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 171 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:43,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 55 Invalid, 1893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:36:43,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2022-03-15 19:36:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 978. [2022-03-15 19:36:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.178096212896622) internal successors, (3105), 977 states have internal predecessors, (3105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3105 transitions. [2022-03-15 19:36:43,238 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3105 transitions. Word has length 23 [2022-03-15 19:36:43,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:43,238 INFO L470 AbstractCegarLoop]: Abstraction has 978 states and 3105 transitions. [2022-03-15 19:36:43,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 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:36:43,238 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3105 transitions. [2022-03-15 19:36:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:36:43,240 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:43,240 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:43,258 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:36:43,453 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,SelfDestructingSolverStorable34 [2022-03-15 19:36:43,454 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:43,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:43,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1879163662, now seen corresponding path program 34 times [2022-03-15 19:36:43,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:43,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872562026] [2022-03-15 19:36:43,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:43,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:43,589 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:43,589 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:43,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872562026] [2022-03-15 19:36:43,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872562026] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:43,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975923428] [2022-03-15 19:36:43,589 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:36:43,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:43,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:43,591 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:36:43,591 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:36:43,655 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:36:43,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:43,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 19:36:43,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:43,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:44,399 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:44,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975923428] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:44,400 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:44,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 36 [2022-03-15 19:36:44,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [360253974] [2022-03-15 19:36:44,400 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:44,402 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:44,408 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 105 transitions. [2022-03-15 19:36:44,408 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:45,107 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [51857#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 1 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 1)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 51861#(and (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 51854#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 51858#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 1 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 1)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 51859#(and (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 51862#(and (or (not (< 1 ~M~0)) (<= ~counter~0 0)) (or (not (< 1 ~M~0)) (<= 0 ~counter~0))), 51860#(and (or (not (< 1 ~M~0)) (<= ~counter~0 0)) (or (not (< 1 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 1 ~M~0)) (<= 0 ~counter~0))), 51856#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 51855#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))] [2022-03-15 19:36:45,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:36:45,108 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:45,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:36:45,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1802, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:36:45,108 INFO L87 Difference]: Start difference. First operand 978 states and 3105 transitions. Second operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 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:36:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:46,199 INFO L93 Difference]: Finished difference Result 1662 states and 4743 transitions. [2022-03-15 19:36:46,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 19:36:46,200 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 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 23 [2022-03-15 19:36:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:46,203 INFO L225 Difference]: With dead ends: 1662 [2022-03-15 19:36:46,203 INFO L226 Difference]: Without dead ends: 1646 [2022-03-15 19:36:46,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=778, Invalid=4772, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 19:36:46,204 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 96 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:46,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 30 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:36:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2022-03-15 19:36:46,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 982. [2022-03-15 19:36:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 3.1753312945973495) internal successors, (3115), 981 states have internal predecessors, (3115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 3115 transitions. [2022-03-15 19:36:46,223 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 3115 transitions. Word has length 23 [2022-03-15 19:36:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:46,223 INFO L470 AbstractCegarLoop]: Abstraction has 982 states and 3115 transitions. [2022-03-15 19:36:46,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 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:36:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 3115 transitions. [2022-03-15 19:36:46,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:36:46,226 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:46,226 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:46,244 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:36:46,442 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,SelfDestructingSolverStorable35 [2022-03-15 19:36:46,442 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:46,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:46,442 INFO L85 PathProgramCache]: Analyzing trace with hash -47589542, now seen corresponding path program 35 times [2022-03-15 19:36:46,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:46,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548028610] [2022-03-15 19:36:46,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:46,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:46,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:46,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548028610] [2022-03-15 19:36:46,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548028610] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:46,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707231794] [2022-03-15 19:36:46,574 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:36:46,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:46,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:46,575 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:36:46,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:36:46,640 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:36:46,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:46,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 19:36:46,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:46,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:47,312 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:47,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707231794] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:47,313 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:47,313 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 36 [2022-03-15 19:36:47,313 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [562202697] [2022-03-15 19:36:47,313 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:47,315 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:47,321 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 105 transitions. [2022-03-15 19:36:47,322 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:48,055 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [55718#(or (<= ~counter~0 0) (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)), 55719#(or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)), 55717#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 55721#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 0))), 55722#(and (or (not (< 0 ~M~0)) (<= ~counter~0 0)) (or (not (< 0 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 0 ~M~0)) (<= 0 ~counter~0))), 55720#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 55723#(and (or (not (< 0 ~M~0)) (<= ~counter~0 0)) (or (not (< 0 ~M~0)) (<= 0 ~counter~0))), 55716#(< thread1Thread1of1ForFork0_~i~0 ~M~0)] [2022-03-15 19:36:48,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:36:48,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:48,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:36:48,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1689, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:36:48,056 INFO L87 Difference]: Start difference. First operand 982 states and 3115 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 22 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:36:48,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:48,867 INFO L93 Difference]: Finished difference Result 1828 states and 5288 transitions. [2022-03-15 19:36:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 19:36:48,867 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 22 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 23 [2022-03-15 19:36:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:48,871 INFO L225 Difference]: With dead ends: 1828 [2022-03-15 19:36:48,871 INFO L226 Difference]: Without dead ends: 1780 [2022-03-15 19:36:48,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=801, Invalid=4169, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 19:36:48,872 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 134 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:48,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 20 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:36:48,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2022-03-15 19:36:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1056. [2022-03-15 19:36:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 1055 states have (on average 3.171563981042654) internal successors, (3346), 1055 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:48,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 3346 transitions. [2022-03-15 19:36:48,893 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 3346 transitions. Word has length 23 [2022-03-15 19:36:48,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:48,893 INFO L470 AbstractCegarLoop]: Abstraction has 1056 states and 3346 transitions. [2022-03-15 19:36:48,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 22 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:36:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 3346 transitions. [2022-03-15 19:36:48,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:36:48,895 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:48,895 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:48,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-03-15 19:36:49,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:49,111 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:49,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:49,111 INFO L85 PathProgramCache]: Analyzing trace with hash -796844897, now seen corresponding path program 36 times [2022-03-15 19:36:49,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:49,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591864922] [2022-03-15 19:36:49,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:49,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:49,225 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:36:49,226 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:49,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591864922] [2022-03-15 19:36:49,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591864922] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:49,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056659734] [2022-03-15 19:36:49,226 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:36:49,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:49,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:49,228 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:36:49,229 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:36:49,298 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:36:49,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:49,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 19:36:49,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:49,456 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:36:49,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:50,070 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:36:50,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056659734] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:50,070 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:50,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 36 [2022-03-15 19:36:50,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [316893094] [2022-03-15 19:36:50,070 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:50,072 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:50,085 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 184 transitions. [2022-03-15 19:36:50,085 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:51,663 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [59895#(and (or (<= 6 ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))) (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (<= 4 ~counter~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)))), 59907#(and (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)) (<= 6 ~M~0)) (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)) (<= 1 ~counter~0))), 59909#(or (<= ~M~0 5) (<= 0 ~counter~0)), 59890#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 59905#(and (or (<= 6 ~M~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0)) (<= 3 ~counter~0))), 59897#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0))) (or (<= 2 ~counter~0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0))) (or (<= 6 ~M~0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)))), 59900#(and (or (<= ~M~0 5) (<= 0 ~counter~0)) (or (<= ~M~0 5) (= thread2Thread1of1ForFork1_~i~1 0))), 59898#(and (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)) (<= 6 ~M~0)) (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)) (<= 1 ~counter~0))), 59908#(and (or (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)) (<= 6 ~M~0)) (or (<= 0 ~counter~0) (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)))), 59902#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 59899#(and (or (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)) (<= 6 ~M~0)) (or (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)))), 59893#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 59892#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 59903#(and (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 5 ~counter~0)) (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 6 ~M~0))), 59896#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= 6 ~M~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0)) (<= 3 ~counter~0))), 59906#(and (or (<= 2 ~counter~0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0))) (or (<= 6 ~M~0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)))), 59901#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 59894#(and (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 5 ~counter~0)) (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 6 ~M~0)) (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (= thread2Thread1of1ForFork1_~i~1 0))), 59891#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 59904#(and (or (<= 6 ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))) (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (<= 4 ~counter~0)))] [2022-03-15 19:36:51,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 19:36:51,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:51,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 19:36:51,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=2590, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 19:36:51,665 INFO L87 Difference]: Start difference. First operand 1056 states and 3346 transitions. Second operand has 36 states, 36 states have (on average 3.138888888888889) internal successors, (113), 35 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:54,655 INFO L93 Difference]: Finished difference Result 2344 states and 6485 transitions. [2022-03-15 19:36:54,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-03-15 19:36:54,656 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.138888888888889) internal successors, (113), 35 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:36:54,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:54,661 INFO L225 Difference]: With dead ends: 2344 [2022-03-15 19:36:54,661 INFO L226 Difference]: Without dead ends: 2344 [2022-03-15 19:36:54,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6293 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4446, Invalid=15294, Unknown=0, NotChecked=0, Total=19740 [2022-03-15 19:36:54,663 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 325 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 2432 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 2541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:54,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 53 Invalid, 2541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2432 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:36:54,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states. [2022-03-15 19:36:54,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 1114. [2022-03-15 19:36:54,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 1113 states have (on average 3.1823899371069184) internal successors, (3542), 1113 states have internal predecessors, (3542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 3542 transitions. [2022-03-15 19:36:54,690 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 3542 transitions. Word has length 24 [2022-03-15 19:36:54,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:54,690 INFO L470 AbstractCegarLoop]: Abstraction has 1114 states and 3542 transitions. [2022-03-15 19:36:54,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.138888888888889) internal successors, (113), 35 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 3542 transitions. [2022-03-15 19:36:54,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:36:54,692 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:54,692 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:54,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-03-15 19:36:54,907 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,SelfDestructingSolverStorable37 [2022-03-15 19:36:54,907 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:54,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:54,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1513272759, now seen corresponding path program 37 times [2022-03-15 19:36:54,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:54,909 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33902498] [2022-03-15 19:36:54,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:54,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:55,031 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:36:55,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:55,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33902498] [2022-03-15 19:36:55,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33902498] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:55,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948165387] [2022-03-15 19:36:55,032 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:36:55,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:55,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:55,033 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:36:55,033 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:36:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:55,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 19:36:55,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:55,276 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:36:55,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:55,827 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:36:55,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948165387] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:55,827 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:55,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2022-03-15 19:36:55,827 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [721009179] [2022-03-15 19:36:55,827 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:55,830 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:55,840 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 153 transitions. [2022-03-15 19:36:55,841 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:57,213 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [64827#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 64832#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 64843#(or (<= 0 ~counter~0) (not (< 4 ~M~0))), 64828#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 64835#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 64840#(and (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 64837#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 4 ~M~0)))), 64829#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 64842#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0))), 64831#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 64841#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 64834#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 64833#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 64836#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 64839#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 64838#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 64830#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0)))] [2022-03-15 19:36:57,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:36:57,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:57,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:36:57,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=2429, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:36:57,217 INFO L87 Difference]: Start difference. First operand 1114 states and 3542 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 32 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:36:59,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:59,260 INFO L93 Difference]: Finished difference Result 2472 states and 6599 transitions. [2022-03-15 19:36:59,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-03-15 19:36:59,260 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 32 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:36:59,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:59,279 INFO L225 Difference]: With dead ends: 2472 [2022-03-15 19:36:59,279 INFO L226 Difference]: Without dead ends: 2424 [2022-03-15 19:36:59,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4521 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2950, Invalid=11092, Unknown=0, NotChecked=0, Total=14042 [2022-03-15 19:36:59,281 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 238 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:59,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 41 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:36:59,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2022-03-15 19:36:59,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 1138. [2022-03-15 19:36:59,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1137 states have (on average 3.173262972735268) internal successors, (3608), 1137 states have internal predecessors, (3608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 3608 transitions. [2022-03-15 19:36:59,309 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 3608 transitions. Word has length 24 [2022-03-15 19:36:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:59,309 INFO L470 AbstractCegarLoop]: Abstraction has 1138 states and 3608 transitions. [2022-03-15 19:36:59,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 32 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:36:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 3608 transitions. [2022-03-15 19:36:59,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:36:59,311 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:59,311 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:59,327 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:36:59,527 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,SelfDestructingSolverStorable38 [2022-03-15 19:36:59,527 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:59,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:59,527 INFO L85 PathProgramCache]: Analyzing trace with hash -2039778377, now seen corresponding path program 38 times [2022-03-15 19:36:59,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:59,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279153254] [2022-03-15 19:36:59,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:59,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:59,646 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:36:59,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:59,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279153254] [2022-03-15 19:36:59,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279153254] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:59,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630378224] [2022-03-15 19:36:59,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:36:59,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:59,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:59,647 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:36:59,650 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:36:59,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:36:59,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:59,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 19:36:59,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:59,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:00,314 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:37:00,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630378224] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:00,314 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:00,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2022-03-15 19:37:00,314 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [23453198] [2022-03-15 19:37:00,314 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:00,316 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:00,325 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 144 transitions. [2022-03-15 19:37:00,325 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:01,387 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [69907#(and (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 69910#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0))), 69908#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 69900#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 69898#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 69899#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 69906#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 69903#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 69902#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0))), 69904#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 69897#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 69912#(or (<= 0 ~counter~0) (not (< 4 ~M~0))), 69901#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 69909#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 69905#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 69911#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (not (< 4 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:37:01,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 19:37:01,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:01,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 19:37:01,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=2347, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:37:01,388 INFO L87 Difference]: Start difference. First operand 1138 states and 3608 transitions. Second operand has 32 states, 32 states have (on average 2.9375) internal successors, (94), 31 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:37:03,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:03,597 INFO L93 Difference]: Finished difference Result 2724 states and 7289 transitions. [2022-03-15 19:37:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-03-15 19:37:03,597 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.9375) internal successors, (94), 31 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 24 [2022-03-15 19:37:03,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:03,603 INFO L225 Difference]: With dead ends: 2724 [2022-03-15 19:37:03,603 INFO L226 Difference]: Without dead ends: 2660 [2022-03-15 19:37:03,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4806 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3204, Invalid=11316, Unknown=0, NotChecked=0, Total=14520 [2022-03-15 19:37:03,604 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 398 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:03,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [398 Valid, 35 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:37:03,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2022-03-15 19:37:03,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 836. [2022-03-15 19:37:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 835 states have (on average 3.076646706586826) internal successors, (2569), 835 states have internal predecessors, (2569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 2569 transitions. [2022-03-15 19:37:03,625 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 2569 transitions. Word has length 24 [2022-03-15 19:37:03,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:03,625 INFO L470 AbstractCegarLoop]: Abstraction has 836 states and 2569 transitions. [2022-03-15 19:37:03,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.9375) internal successors, (94), 31 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:37:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 2569 transitions. [2022-03-15 19:37:03,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:37:03,626 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:03,627 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:03,645 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:37:03,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 19:37:03,835 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:03,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:03,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1323108937, now seen corresponding path program 39 times [2022-03-15 19:37:03,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:03,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592181549] [2022-03-15 19:37:03,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:03,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:03,952 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:37:03,952 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:03,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592181549] [2022-03-15 19:37:03,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592181549] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:03,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951971076] [2022-03-15 19:37:03,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:37:03,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:03,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:03,954 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:37:03,954 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:37:04,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:37:04,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:04,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 19:37:04,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:04,243 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:37:04,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:04,627 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:37:04,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951971076] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:04,627 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:04,627 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2022-03-15 19:37:04,628 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1983041220] [2022-03-15 19:37:04,628 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:04,629 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:04,639 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 135 transitions. [2022-03-15 19:37:04,639 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:05,598 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [74621#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 74628#(and (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 74632#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0))), 74624#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 74625#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 74620#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 74631#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 74630#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 74626#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 74627#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 74634#(or (<= 0 ~counter~0) (not (< 4 ~M~0))), 74623#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 74633#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 4 ~M~0)))), 74622#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 74629#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:37:05,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 19:37:05,599 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:05,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 19:37:05,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=2253, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:37:05,599 INFO L87 Difference]: Start difference. First operand 836 states and 2569 transitions. Second operand has 31 states, 31 states have (on average 2.870967741935484) internal successors, (89), 30 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:37:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:07,993 INFO L93 Difference]: Finished difference Result 1930 states and 4880 transitions. [2022-03-15 19:37:07,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-15 19:37:07,993 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.870967741935484) internal successors, (89), 30 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 24 [2022-03-15 19:37:07,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:08,010 INFO L225 Difference]: With dead ends: 1930 [2022-03-15 19:37:08,010 INFO L226 Difference]: Without dead ends: 1906 [2022-03-15 19:37:08,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3634, Invalid=13136, Unknown=0, NotChecked=0, Total=16770 [2022-03-15 19:37:08,014 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 338 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:08,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 39 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:37:08,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2022-03-15 19:37:08,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 828. [2022-03-15 19:37:08,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 3.065296251511487) internal successors, (2535), 827 states have internal predecessors, (2535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 2535 transitions. [2022-03-15 19:37:08,029 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 2535 transitions. Word has length 24 [2022-03-15 19:37:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:08,029 INFO L470 AbstractCegarLoop]: Abstraction has 828 states and 2535 transitions. [2022-03-15 19:37:08,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.870967741935484) internal successors, (89), 30 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:37:08,030 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 2535 transitions. [2022-03-15 19:37:08,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:37:08,031 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:08,031 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:08,050 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:37:08,247 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,SelfDestructingSolverStorable40 [2022-03-15 19:37:08,247 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:08,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:08,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1886598071, now seen corresponding path program 40 times [2022-03-15 19:37:08,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:08,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011504805] [2022-03-15 19:37:08,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:08,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:08,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:37:08,359 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:08,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011504805] [2022-03-15 19:37:08,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011504805] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:08,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126196500] [2022-03-15 19:37:08,359 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:37:08,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:08,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:08,360 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:37:08,361 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:37:08,420 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:37:08,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:08,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 19:37:08,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:08,755 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:37:08,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:09,005 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:37:09,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126196500] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:09,005 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:09,005 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 36 [2022-03-15 19:37:09,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [843999359] [2022-03-15 19:37:09,006 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:09,008 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:09,016 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 126 transitions. [2022-03-15 19:37:09,016 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:09,769 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [78557#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 78560#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 78558#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 78553#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 78555#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 78552#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 78561#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 78559#(and (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 78564#(or (<= 0 ~counter~0) (not (< 4 ~M~0))), 78562#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0))), 78563#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (not (< 4 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 78551#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 78556#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 78554#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)))] [2022-03-15 19:37:09,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 19:37:09,769 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:09,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 19:37:09,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=2122, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 19:37:09,770 INFO L87 Difference]: Start difference. First operand 828 states and 2535 transitions. Second operand has 30 states, 30 states have (on average 2.8) internal successors, (84), 29 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:37:12,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:12,005 INFO L93 Difference]: Finished difference Result 2020 states and 5056 transitions. [2022-03-15 19:37:12,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-03-15 19:37:12,006 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.8) internal successors, (84), 29 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 24 [2022-03-15 19:37:12,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:12,009 INFO L225 Difference]: With dead ends: 2020 [2022-03-15 19:37:12,009 INFO L226 Difference]: Without dead ends: 2004 [2022-03-15 19:37:12,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4636 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3074, Invalid=11446, Unknown=0, NotChecked=0, Total=14520 [2022-03-15 19:37:12,011 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 349 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:12,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 38 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1501 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:37:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2022-03-15 19:37:12,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 758. [2022-03-15 19:37:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 757 states have (on average 3.0171730515191544) internal successors, (2284), 757 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:12,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 2284 transitions. [2022-03-15 19:37:12,028 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 2284 transitions. Word has length 24 [2022-03-15 19:37:12,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:12,028 INFO L470 AbstractCegarLoop]: Abstraction has 758 states and 2284 transitions. [2022-03-15 19:37:12,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.8) internal successors, (84), 29 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:37:12,028 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 2284 transitions. [2022-03-15 19:37:12,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:37:12,029 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:12,030 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:12,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-15 19:37:12,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:12,240 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:12,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:12,240 INFO L85 PathProgramCache]: Analyzing trace with hash -186349001, now seen corresponding path program 41 times [2022-03-15 19:37:12,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:12,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514548239] [2022-03-15 19:37:12,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:12,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:12,367 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:37:12,367 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:12,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514548239] [2022-03-15 19:37:12,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514548239] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:12,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464940246] [2022-03-15 19:37:12,367 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:37:12,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:12,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:12,368 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:37:12,370 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:37:12,435 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:37:12,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:12,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 19:37:12,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:12,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:12,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464940246] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:12,960 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:12,960 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 35 [2022-03-15 19:37:12,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1971015235] [2022-03-15 19:37:12,961 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:12,963 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:12,970 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 122 transitions. [2022-03-15 19:37:12,970 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:13,639 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [82421#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 82425#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 82422#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 82427#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (not (< 4 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 82420#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 82428#(or (<= 0 ~counter~0) (not (< 4 ~M~0))), 82419#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0))), 82417#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 82424#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 82416#(< thread2Thread1of1ForFork1_~i~1 ~M~0), 82426#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0))), 82423#(and (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 82418#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0)))] [2022-03-15 19:37:13,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:37:13,639 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:13,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:37:13,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=1890, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:37:13,640 INFO L87 Difference]: Start difference. First operand 758 states and 2284 transitions. Second operand has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 28 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:15,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:15,615 INFO L93 Difference]: Finished difference Result 1456 states and 3816 transitions. [2022-03-15 19:37:15,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-03-15 19:37:15,616 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 28 states have internal predecessors, (80), 0 states have call successors, (0), 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:37:15,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:15,618 INFO L225 Difference]: With dead ends: 1456 [2022-03-15 19:37:15,618 INFO L226 Difference]: Without dead ends: 1450 [2022-03-15 19:37:15,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4852 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3265, Invalid=12235, Unknown=0, NotChecked=0, Total=15500 [2022-03-15 19:37:15,619 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 262 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:15,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 49 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:37:15,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2022-03-15 19:37:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 562. [2022-03-15 19:37:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 3.0124777183600715) internal successors, (1690), 561 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1690 transitions. [2022-03-15 19:37:15,629 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1690 transitions. Word has length 24 [2022-03-15 19:37:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:15,630 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 1690 transitions. [2022-03-15 19:37:15,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 28 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1690 transitions. [2022-03-15 19:37:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:37:15,631 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:15,631 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:15,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-03-15 19:37:15,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:15,835 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:15,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:15,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1012524437, now seen corresponding path program 42 times [2022-03-15 19:37:15,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:15,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712476984] [2022-03-15 19:37:15,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:15,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:15,948 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:37:15,948 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:15,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712476984] [2022-03-15 19:37:15,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712476984] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:15,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018507523] [2022-03-15 19:37:15,948 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:37:15,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:15,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:15,950 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:37:15,950 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:37:16,017 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:37:16,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:16,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 19:37:16,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:16,190 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:37:16,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:16,643 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:37:16,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018507523] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:16,643 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:16,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 37 [2022-03-15 19:37:16,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1887775322] [2022-03-15 19:37:16,644 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:16,646 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:16,654 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 144 transitions. [2022-03-15 19:37:16,654 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:17,788 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [85343#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 85346#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 85345#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 85348#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 85351#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 85338#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 85344#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 85347#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 85340#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 85342#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 85349#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 85339#(and (or (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 85341#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 85352#(or (<= 0 ~counter~0) (not (< 3 ~M~0))), 85350#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:37:17,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 19:37:17,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:17,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 19:37:17,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=2253, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:37:17,789 INFO L87 Difference]: Start difference. First operand 562 states and 1690 transitions. Second operand has 30 states, 30 states have (on average 3.066666666666667) internal successors, (92), 29 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:19,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:19,574 INFO L93 Difference]: Finished difference Result 1918 states and 4840 transitions. [2022-03-15 19:37:19,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-15 19:37:19,574 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.066666666666667) internal successors, (92), 29 states have internal predecessors, (92), 0 states have call successors, (0), 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:37:19,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:19,577 INFO L225 Difference]: With dead ends: 1918 [2022-03-15 19:37:19,577 INFO L226 Difference]: Without dead ends: 1870 [2022-03-15 19:37:19,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3833 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=8927, Unknown=0, NotChecked=0, Total=11342 [2022-03-15 19:37:19,577 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 256 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:19,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 36 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:37:19,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2022-03-15 19:37:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 586. [2022-03-15 19:37:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 585 states have (on average 3.0700854700854703) internal successors, (1796), 585 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:19,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1796 transitions. [2022-03-15 19:37:19,589 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 1796 transitions. Word has length 24 [2022-03-15 19:37:19,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:19,589 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 1796 transitions. [2022-03-15 19:37:19,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.066666666666667) internal successors, (92), 29 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:19,589 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 1796 transitions. [2022-03-15 19:37:19,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:37:19,590 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:19,590 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:19,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-03-15 19:37:19,790 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,SelfDestructingSolverStorable43 [2022-03-15 19:37:19,791 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:19,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:19,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1900587947, now seen corresponding path program 43 times [2022-03-15 19:37:19,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:19,792 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320760818] [2022-03-15 19:37:19,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:19,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:19,907 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:37:19,907 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:19,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320760818] [2022-03-15 19:37:19,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320760818] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:19,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229779583] [2022-03-15 19:37:19,907 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:37:19,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:19,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:19,908 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:37:19,909 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:37:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:19,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 19:37:19,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:20,147 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:37:20,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:20,587 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:37:20,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229779583] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:20,587 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:20,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 37 [2022-03-15 19:37:20,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1318239160] [2022-03-15 19:37:20,588 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:20,590 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:20,598 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 126 transitions. [2022-03-15 19:37:20,598 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:21,460 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [88734#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 88737#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 88733#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 88738#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 88736#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 88735#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 88732#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 88729#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 88731#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 88730#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 88728#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 88739#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 88740#(or (<= 0 ~counter~0) (not (< 3 ~M~0)))] [2022-03-15 19:37:21,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 19:37:21,461 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:21,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 19:37:21,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=2060, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 19:37:21,461 INFO L87 Difference]: Start difference. First operand 586 states and 1796 transitions. Second operand has 28 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 27 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:23,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:23,169 INFO L93 Difference]: Finished difference Result 1436 states and 3675 transitions. [2022-03-15 19:37:23,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 19:37:23,170 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 27 states have internal predecessors, (82), 0 states have call successors, (0), 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:37:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:23,172 INFO L225 Difference]: With dead ends: 1436 [2022-03-15 19:37:23,172 INFO L226 Difference]: Without dead ends: 1412 [2022-03-15 19:37:23,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3177 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2053, Invalid=7847, Unknown=0, NotChecked=0, Total=9900 [2022-03-15 19:37:23,172 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 214 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:23,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 35 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:37:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2022-03-15 19:37:23,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 592. [2022-03-15 19:37:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 3.0642978003384096) internal successors, (1811), 591 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:23,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1811 transitions. [2022-03-15 19:37:23,183 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1811 transitions. Word has length 24 [2022-03-15 19:37:23,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:23,183 INFO L470 AbstractCegarLoop]: Abstraction has 592 states and 1811 transitions. [2022-03-15 19:37:23,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 27 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:23,183 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1811 transitions. [2022-03-15 19:37:23,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:37:23,184 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:23,184 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:23,200 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:37:23,385 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,SelfDestructingSolverStorable44 [2022-03-15 19:37:23,385 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:23,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:23,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1828594207, now seen corresponding path program 44 times [2022-03-15 19:37:23,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:23,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929930034] [2022-03-15 19:37:23,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:23,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:23,521 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:37:23,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:23,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929930034] [2022-03-15 19:37:23,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929930034] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:23,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584401929] [2022-03-15 19:37:23,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:37:23,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:23,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:23,525 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:37:23,526 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:37:23,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:37:23,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:23,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 19:37:23,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:23,775 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:37:23,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:24,268 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:37:24,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584401929] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:24,269 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:24,269 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 37 [2022-03-15 19:37:24,269 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1372259613] [2022-03-15 19:37:24,269 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:24,271 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:24,279 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 117 transitions. [2022-03-15 19:37:24,279 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:24,975 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [91640#(and (or (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 91637#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 91636#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 91641#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 91645#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 91644#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 91639#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 91643#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 91642#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 91638#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 91647#(or (<= 0 ~counter~0) (not (< 3 ~M~0))), 91646#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:37:24,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:37:24,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:24,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:37:24,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1953, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:37:24,976 INFO L87 Difference]: Start difference. First operand 592 states and 1811 transitions. Second operand has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 26 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:37:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:27,258 INFO L93 Difference]: Finished difference Result 1768 states and 4308 transitions. [2022-03-15 19:37:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-03-15 19:37:27,258 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 26 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 24 [2022-03-15 19:37:27,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:27,261 INFO L225 Difference]: With dead ends: 1768 [2022-03-15 19:37:27,261 INFO L226 Difference]: Without dead ends: 1756 [2022-03-15 19:37:27,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4959 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3246, Invalid=11760, Unknown=0, NotChecked=0, Total=15006 [2022-03-15 19:37:27,262 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 309 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:27,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 24 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:37:27,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2022-03-15 19:37:27,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 582. [2022-03-15 19:37:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 3.053356282271945) internal successors, (1774), 581 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:27,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1774 transitions. [2022-03-15 19:37:27,275 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1774 transitions. Word has length 24 [2022-03-15 19:37:27,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:27,275 INFO L470 AbstractCegarLoop]: Abstraction has 582 states and 1774 transitions. [2022-03-15 19:37:27,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 26 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:37:27,275 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1774 transitions. [2022-03-15 19:37:27,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:37:27,276 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:27,276 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:27,293 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:37:27,493 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,SelfDestructingSolverStorable45 [2022-03-15 19:37:27,493 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:27,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:27,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1066606877, now seen corresponding path program 45 times [2022-03-15 19:37:27,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:27,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961924565] [2022-03-15 19:37:27,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:27,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:27,599 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:37:27,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:27,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961924565] [2022-03-15 19:37:27,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961924565] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:27,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120378339] [2022-03-15 19:37:27,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:37:27,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:27,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:27,601 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:37:27,601 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:37:27,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:37:27,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:27,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:37:27,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:27,752 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:37:27,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:27,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120378339] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:27,967 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:27,967 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 16 [2022-03-15 19:37:27,967 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1003470743] [2022-03-15 19:37:27,967 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:27,969 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:27,982 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 196 transitions. [2022-03-15 19:37:27,983 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:28,919 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:37:28,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:37:28,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:28,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:37:28,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:37:28,920 INFO L87 Difference]: Start difference. First operand 582 states and 1774 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 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:37:29,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:29,107 INFO L93 Difference]: Finished difference Result 931 states and 2703 transitions. [2022-03-15 19:37:29,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:37:29,107 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 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 25 [2022-03-15 19:37:29,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:29,109 INFO L225 Difference]: With dead ends: 931 [2022-03-15 19:37:29,109 INFO L226 Difference]: Without dead ends: 892 [2022-03-15 19:37:29,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 117 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:37:29,109 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:29,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 56 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:37:29,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2022-03-15 19:37:29,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 752. [2022-03-15 19:37:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 751 states have (on average 3.1211717709720372) internal successors, (2344), 751 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 2344 transitions. [2022-03-15 19:37:29,119 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 2344 transitions. Word has length 25 [2022-03-15 19:37:29,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:29,119 INFO L470 AbstractCegarLoop]: Abstraction has 752 states and 2344 transitions. [2022-03-15 19:37:29,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 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:37:29,119 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 2344 transitions. [2022-03-15 19:37:29,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:37:29,120 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:29,121 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:29,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-03-15 19:37:29,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:29,321 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:29,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:29,322 INFO L85 PathProgramCache]: Analyzing trace with hash -509247099, now seen corresponding path program 46 times [2022-03-15 19:37:29,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:29,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880392218] [2022-03-15 19:37:29,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:29,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:29,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:29,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880392218] [2022-03-15 19:37:29,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880392218] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:29,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652925955] [2022-03-15 19:37:29,494 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:37:29,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:29,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:29,495 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:37:29,496 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:37:29,568 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:37:29,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:29,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 19:37:29,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:37:29,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:30,084 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:37:30,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652925955] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:30,084 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:30,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 36 [2022-03-15 19:37:30,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1322140559] [2022-03-15 19:37:30,084 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:30,086 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:30,095 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 125 transitions. [2022-03-15 19:37:30,095 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:31,080 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [97514#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 1) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 97516#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (<= ~counter~0 0) (not (< 4 ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 4 ~M~0)))), 97507#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 3) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 97517#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (<= ~counter~0 0) (not (< 4 ~M~0)))), 97508#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 2))), 97512#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 3) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 97506#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 4)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 97515#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= ~counter~0 0))), 97511#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 4)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 97513#(and (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 2))), 97405#(< thread2Thread1of1ForFork1_~i~1 ~M~0), 97510#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= ~counter~0 0))), 97509#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 1) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:37:31,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 19:37:31,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:31,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 19:37:31,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=2065, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:37:31,081 INFO L87 Difference]: Start difference. First operand 752 states and 2344 transitions. Second operand has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:34,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:34,032 INFO L93 Difference]: Finished difference Result 1788 states and 4800 transitions. [2022-03-15 19:37:34,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-03-15 19:37:34,036 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 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:37:34,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:34,039 INFO L225 Difference]: With dead ends: 1788 [2022-03-15 19:37:34,039 INFO L226 Difference]: Without dead ends: 1778 [2022-03-15 19:37:34,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3856 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1702, Invalid=13550, Unknown=0, NotChecked=0, Total=15252 [2022-03-15 19:37:34,040 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 197 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 3595 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 3595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:34,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 98 Invalid, 3749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 3595 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:37:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2022-03-15 19:37:34,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 816. [2022-03-15 19:37:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 815 states have (on average 3.1705521472392637) internal successors, (2584), 815 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 2584 transitions. [2022-03-15 19:37:34,054 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 2584 transitions. Word has length 25 [2022-03-15 19:37:34,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:34,054 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 2584 transitions. [2022-03-15 19:37:34,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:34,054 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 2584 transitions. [2022-03-15 19:37:34,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:37:34,056 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:34,056 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:34,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-03-15 19:37:34,256 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,SelfDestructingSolverStorable47 [2022-03-15 19:37:34,256 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:34,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:34,257 INFO L85 PathProgramCache]: Analyzing trace with hash 285055335, now seen corresponding path program 47 times [2022-03-15 19:37:34,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:34,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34484300] [2022-03-15 19:37:34,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:34,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:34,419 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:34,420 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:34,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34484300] [2022-03-15 19:37:34,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34484300] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:34,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766573392] [2022-03-15 19:37:34,420 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:37:34,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:34,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:34,421 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:37:34,422 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:37:34,490 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:37:34,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:34,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:37:34,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:34,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:35,678 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:35,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766573392] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:35,679 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:35,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 37 [2022-03-15 19:37:35,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [632724426] [2022-03-15 19:37:35,679 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:35,681 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:35,689 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 120 transitions. [2022-03-15 19:37:35,689 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:36,560 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [101273#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 101271#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= ~counter~0 2)) (or (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 101272#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)) (or (<= ~counter~0 1) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 101274#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (<= ~counter~0 0)) (or (not (< 3 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 101277#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (<= ~counter~0 3) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 101280#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 101281#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (<= ~counter~0 0))), 101276#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 101279#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 1) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 101275#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 101278#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= ~counter~0 2)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 101270#(and (or (<= ~counter~0 3) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0)))] [2022-03-15 19:37:36,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:37:36,560 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:36,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:37:36,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=2141, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 19:37:36,560 INFO L87 Difference]: Start difference. First operand 816 states and 2584 transitions. Second operand has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 28 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:39,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:39,925 INFO L93 Difference]: Finished difference Result 1876 states and 4926 transitions. [2022-03-15 19:37:39,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-03-15 19:37:39,926 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 28 states have internal predecessors, (80), 0 states have call successors, (0), 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:37:39,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:39,928 INFO L225 Difference]: With dead ends: 1876 [2022-03-15 19:37:39,929 INFO L226 Difference]: Without dead ends: 1860 [2022-03-15 19:37:39,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3901 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1970, Invalid=12310, Unknown=0, NotChecked=0, Total=14280 [2022-03-15 19:37:39,930 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 237 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 2581 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 2766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 2581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:39,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 59 Invalid, 2766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 2581 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:37:39,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-03-15 19:37:39,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 814. [2022-03-15 19:37:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 3.169741697416974) internal successors, (2577), 813 states have internal predecessors, (2577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 2577 transitions. [2022-03-15 19:37:39,945 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 2577 transitions. Word has length 25 [2022-03-15 19:37:39,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:39,946 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 2577 transitions. [2022-03-15 19:37:39,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 28 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 2577 transitions. [2022-03-15 19:37:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:37:39,947 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:39,947 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:39,967 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:37:40,163 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,SelfDestructingSolverStorable48 [2022-03-15 19:37:40,164 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:40,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:40,164 INFO L85 PathProgramCache]: Analyzing trace with hash 943702021, now seen corresponding path program 48 times [2022-03-15 19:37:40,165 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:40,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027161448] [2022-03-15 19:37:40,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:40,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:40,334 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:40,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:40,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027161448] [2022-03-15 19:37:40,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027161448] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:40,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89809929] [2022-03-15 19:37:40,335 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:37:40,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:40,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:40,336 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:37:40,337 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:37:40,422 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:37:40,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:40,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:37:40,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:40,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:41,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89809929] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:41,415 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:41,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 41 [2022-03-15 19:37:41,415 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [618485055] [2022-03-15 19:37:41,415 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:41,417 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:41,425 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 120 transitions. [2022-03-15 19:37:41,426 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:42,305 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [105116#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 105121#(and (or (<= ~counter~0 0) (not (< 2 ~M~0))) (or (<= 0 ~counter~0) (not (< 2 ~M~0))) (or (not (< 2 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 105118#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 105114#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 2)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 105117#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 105120#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 0))), 105119#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 0))), 105113#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 1) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 105112#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 2)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 105122#(and (or (<= ~counter~0 0) (not (< 2 ~M~0))) (or (<= 0 ~counter~0) (not (< 2 ~M~0)))), 105115#(and (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 1) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))))] [2022-03-15 19:37:42,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 19:37:42,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:42,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 19:37:42,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=2419, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:37:42,305 INFO L87 Difference]: Start difference. First operand 814 states and 2577 transitions. Second operand has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 27 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:44,406 INFO L93 Difference]: Finished difference Result 1862 states and 4906 transitions. [2022-03-15 19:37:44,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 19:37:44,407 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 27 states have internal predecessors, (79), 0 states have call successors, (0), 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:37:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:44,410 INFO L225 Difference]: With dead ends: 1862 [2022-03-15 19:37:44,410 INFO L226 Difference]: Without dead ends: 1846 [2022-03-15 19:37:44,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2990 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1354, Invalid=8948, Unknown=0, NotChecked=0, Total=10302 [2022-03-15 19:37:44,411 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 178 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:44,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 47 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:37:44,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2022-03-15 19:37:44,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 792. [2022-03-15 19:37:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 3.1782553729456384) internal successors, (2514), 791 states have internal predecessors, (2514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2514 transitions. [2022-03-15 19:37:44,425 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 2514 transitions. Word has length 25 [2022-03-15 19:37:44,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:44,425 INFO L470 AbstractCegarLoop]: Abstraction has 792 states and 2514 transitions. [2022-03-15 19:37:44,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 27 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:44,425 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 2514 transitions. [2022-03-15 19:37:44,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:37:44,426 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:44,426 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:44,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-15 19:37:44,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-03-15 19:37:44,637 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:44,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:44,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2029403161, now seen corresponding path program 49 times [2022-03-15 19:37:44,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:44,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692696253] [2022-03-15 19:37:44,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:44,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:44,793 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:44,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:44,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692696253] [2022-03-15 19:37:44,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692696253] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:44,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77752017] [2022-03-15 19:37:44,794 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:37:44,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:44,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:44,795 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:37:44,796 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:37:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:44,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 19:37:44,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:45,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:45,707 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:45,707 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77752017] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:45,707 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:45,708 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2022-03-15 19:37:45,708 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [314070587] [2022-03-15 19:37:45,708 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:45,710 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:45,718 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 120 transitions. [2022-03-15 19:37:45,718 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:46,593 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [108859#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 108854#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 1 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 1)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 108860#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 108858#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 108862#(and (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 108857#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 108855#(and (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 108861#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 1 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 1)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 108856#(and (or (not (< 1 ~M~0)) (<= ~counter~0 0)) (or (not (< 1 ~M~0)) (<= 0 ~counter~0)) (or (not (< 1 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 108863#(and (or (not (< 1 ~M~0)) (<= ~counter~0 0)) (or (not (< 1 ~M~0)) (<= 0 ~counter~0)))] [2022-03-15 19:37:46,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:37:46,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:46,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:37:46,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=2418, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:37:46,594 INFO L87 Difference]: Start difference. First operand 792 states and 2514 transitions. Second operand has 27 states, 27 states have (on average 2.888888888888889) internal successors, (78), 26 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:47,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:47,800 INFO L93 Difference]: Finished difference Result 1690 states and 4685 transitions. [2022-03-15 19:37:47,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 19:37:47,801 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.888888888888889) internal successors, (78), 26 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 19:37:47,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:47,803 INFO L225 Difference]: With dead ends: 1690 [2022-03-15 19:37:47,803 INFO L226 Difference]: Without dead ends: 1670 [2022-03-15 19:37:47,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2215 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=938, Invalid=6034, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 19:37:47,804 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 135 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:47,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 36 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:37:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2022-03-15 19:37:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 796. [2022-03-15 19:37:47,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 3.1748427672955977) internal successors, (2524), 795 states have internal predecessors, (2524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:47,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2524 transitions. [2022-03-15 19:37:47,817 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 2524 transitions. Word has length 25 [2022-03-15 19:37:47,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:47,817 INFO L470 AbstractCegarLoop]: Abstraction has 796 states and 2524 transitions. [2022-03-15 19:37:47,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.888888888888889) internal successors, (78), 26 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:47,818 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 2524 transitions. [2022-03-15 19:37:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:37:47,819 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:47,819 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:47,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-03-15 19:37:48,023 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,SelfDestructingSolverStorable50 [2022-03-15 19:37:48,023 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:48,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:48,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1254941445, now seen corresponding path program 50 times [2022-03-15 19:37:48,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:48,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136329672] [2022-03-15 19:37:48,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:48,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:48,178 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:48,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136329672] [2022-03-15 19:37:48,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136329672] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:48,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872453424] [2022-03-15 19:37:48,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:37:48,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:48,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:48,180 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:37:48,181 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:37:48,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:37:48,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:48,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:37:48,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:48,505 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:48,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:49,067 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:49,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872453424] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:49,068 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:49,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 42 [2022-03-15 19:37:49,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1274550942] [2022-03-15 19:37:49,068 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:49,070 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:49,078 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 120 transitions. [2022-03-15 19:37:49,079 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:50,057 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [112395#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 112400#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 112399#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 112396#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 112397#(or (<= ~counter~0 0) (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)), 112403#(and (or (not (< 0 ~M~0)) (<= ~counter~0 0)) (or (not (< 0 ~M~0)) (<= 0 ~counter~0))), 112401#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 0))), 112402#(and (or (not (< 0 ~M~0)) (<= ~counter~0 0)) (or (not (< 0 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 0 ~M~0)) (<= 0 ~counter~0))), 112398#(and (or (<= ~counter~0 0) (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0)) (or (<= ~counter~0 0) (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)))] [2022-03-15 19:37:50,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:37:50,057 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:50,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:37:50,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=2264, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:37:50,058 INFO L87 Difference]: Start difference. First operand 796 states and 2524 transitions. Second operand has 26 states, 26 states have (on average 2.9615384615384617) 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:37:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:50,973 INFO L93 Difference]: Finished difference Result 1626 states and 4600 transitions. [2022-03-15 19:37:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 19:37:50,973 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.9615384615384617) 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 25 [2022-03-15 19:37:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:50,976 INFO L225 Difference]: With dead ends: 1626 [2022-03-15 19:37:50,976 INFO L226 Difference]: Without dead ends: 1570 [2022-03-15 19:37:50,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2364 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=999, Invalid=5321, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 19:37:50,977 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 183 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:50,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 22 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:37:50,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2022-03-15 19:37:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1068. [2022-03-15 19:37:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1067 states have (on average 3.169634489222118) internal successors, (3382), 1067 states have internal predecessors, (3382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 3382 transitions. [2022-03-15 19:37:50,993 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 3382 transitions. Word has length 25 [2022-03-15 19:37:50,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:50,993 INFO L470 AbstractCegarLoop]: Abstraction has 1068 states and 3382 transitions. [2022-03-15 19:37:50,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.9615384615384617) 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:37:50,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 3382 transitions. [2022-03-15 19:37:50,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:37:50,995 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:50,995 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:51,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-03-15 19:37:51,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:51,210 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:51,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:51,210 INFO L85 PathProgramCache]: Analyzing trace with hash -380460958, now seen corresponding path program 51 times [2022-03-15 19:37:51,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:51,211 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651936753] [2022-03-15 19:37:51,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:51,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:51,374 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:37:51,374 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:51,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651936753] [2022-03-15 19:37:51,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651936753] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:51,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835187434] [2022-03-15 19:37:51,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:37:51,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:51,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:51,376 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:37:51,399 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:37:51,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:37:51,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:51,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:37:51,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:51,832 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:37:51,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:52,106 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:37:52,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835187434] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:52,107 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:52,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 39 [2022-03-15 19:37:52,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [252758860] [2022-03-15 19:37:52,107 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:52,109 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:52,123 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 208 transitions. [2022-03-15 19:37:52,124 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:53,894 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [116416#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 116430#(and (or (<= 2 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4))) (or (<= 7 ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)))), 116433#(or (<= ~M~0 6) (<= 0 ~counter~0)), 116429#(and (or (<= 7 ~M~0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0))) (or (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)) (<= 3 ~counter~0))), 116414#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 116417#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 116427#(and (or (<= 7 ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))) (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (<= 5 ~counter~0))), 116422#(and (or (<= 2 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4))) (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) ~M~0))), 116420#(and (or (<= 4 ~counter~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= (+ 7 thread2Thread1of1ForFork1_~i~1) ~M~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0)))), 116418#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 116423#(and (or (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)) (<= 1 ~counter~0)) (or (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) ~M~0))), 116431#(and (or (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)) (<= 1 ~counter~0)) (or (<= 7 ~M~0) (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)))), 116426#(and (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 6 ~counter~0)) (or (<= 7 ~M~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0))), 116428#(and (or (<= 7 ~M~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= 4 ~counter~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0)))), 116421#(and (or (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)) (<= 3 ~counter~0))), 116419#(and (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (<= 5 ~counter~0))), 116411#(and (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 6 ~counter~0)) (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) ~M~0))), 116415#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 116432#(and (or (<= ~M~0 (+ 6 thread1Thread1of1ForFork0_~i~0)) (<= 7 ~M~0)) (or (<= ~M~0 (+ 6 thread1Thread1of1ForFork0_~i~0)) (<= 0 ~counter~0))), 116425#(and (or (<= ~M~0 6) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= ~M~0 6) (<= 0 ~counter~0))), 116412#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 116413#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 116424#(and (or (<= ~M~0 (+ 6 thread1Thread1of1ForFork0_~i~0)) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= ~M~0 (+ 6 thread1Thread1of1ForFork0_~i~0)) (<= 0 ~counter~0)))] [2022-03-15 19:37:53,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:37:53,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:53,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:37:53,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=3331, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:37:53,895 INFO L87 Difference]: Start difference. First operand 1068 states and 3382 transitions. Second operand has 41 states, 41 states have (on average 3.1219512195121952) internal successors, (128), 40 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:57,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:57,865 INFO L93 Difference]: Finished difference Result 2994 states and 7979 transitions. [2022-03-15 19:37:57,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-03-15 19:37:57,865 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.1219512195121952) internal successors, (128), 40 states have internal predecessors, (128), 0 states have call successors, (0), 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:37:57,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:57,870 INFO L225 Difference]: With dead ends: 2994 [2022-03-15 19:37:57,870 INFO L226 Difference]: Without dead ends: 2994 [2022-03-15 19:37:57,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 82 SyntacticMatches, 8 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10588 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=7043, Invalid=24819, Unknown=0, NotChecked=0, Total=31862 [2022-03-15 19:37:57,871 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 531 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 2569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:57,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [531 Valid, 47 Invalid, 2569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:37:57,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2022-03-15 19:37:57,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 1128. [2022-03-15 19:37:57,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1127 states have (on average 3.181011535048802) internal successors, (3585), 1127 states have internal predecessors, (3585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 3585 transitions. [2022-03-15 19:37:57,893 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 3585 transitions. Word has length 26 [2022-03-15 19:37:57,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:57,894 INFO L470 AbstractCegarLoop]: Abstraction has 1128 states and 3585 transitions. [2022-03-15 19:37:57,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.1219512195121952) internal successors, (128), 40 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:57,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 3585 transitions. [2022-03-15 19:37:57,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:37:57,896 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:57,896 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:57,914 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:37:58,096 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,SelfDestructingSolverStorable52 [2022-03-15 19:37:58,096 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:58,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:58,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1781257654, now seen corresponding path program 52 times [2022-03-15 19:37:58,097 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:58,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936446431] [2022-03-15 19:37:58,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:58,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:58,246 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:37:58,247 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:58,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936446431] [2022-03-15 19:37:58,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936446431] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:58,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795991285] [2022-03-15 19:37:58,247 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:37:58,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:58,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:58,260 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:37:58,261 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:37:58,329 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:37:58,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:58,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:37:58,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:58,745 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:37:58,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:59,086 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:37:59,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795991285] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:59,086 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:59,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 41 [2022-03-15 19:37:59,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [819740909] [2022-03-15 19:37:59,086 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:59,088 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:59,100 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 177 transitions. [2022-03-15 19:37:59,101 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:00,549 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [122110#(and (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 122118#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 122113#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 122127#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 122119#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 122111#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 122123#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 122124#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 122126#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 122116#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 122117#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 122109#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 122121#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 122112#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 122125#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 122128#(or (not (< 5 ~M~0)) (<= 0 ~counter~0)), 122114#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 122115#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 122120#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 122122#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:38:00,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 19:38:00,549 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:00,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 19:38:00,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=3235, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:38:00,550 INFO L87 Difference]: Start difference. First operand 1128 states and 3585 transitions. Second operand has 38 states, 38 states have (on average 3.0) internal successors, (114), 37 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:38:03,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:03,831 INFO L93 Difference]: Finished difference Result 3746 states and 9568 transitions. [2022-03-15 19:38:03,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-03-15 19:38:03,832 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.0) internal successors, (114), 37 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) Word has length 26 [2022-03-15 19:38:03,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:03,838 INFO L225 Difference]: With dead ends: 3746 [2022-03-15 19:38:03,838 INFO L226 Difference]: Without dead ends: 3610 [2022-03-15 19:38:03,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6996 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4461, Invalid=17295, Unknown=0, NotChecked=0, Total=21756 [2022-03-15 19:38:03,840 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 394 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 2267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:03,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 61 Invalid, 2267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 2107 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:38:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3610 states. [2022-03-15 19:38:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3610 to 1130. [2022-03-15 19:38:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1129 states have (on average 3.1727192205491583) internal successors, (3582), 1129 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:03,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 3582 transitions. [2022-03-15 19:38:03,876 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 3582 transitions. Word has length 26 [2022-03-15 19:38:03,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:03,876 INFO L470 AbstractCegarLoop]: Abstraction has 1130 states and 3582 transitions. [2022-03-15 19:38:03,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.0) internal successors, (114), 37 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:38:03,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 3582 transitions. [2022-03-15 19:38:03,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:38:03,878 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:03,878 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:03,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-03-15 19:38:04,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:04,085 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:04,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:04,086 INFO L85 PathProgramCache]: Analyzing trace with hash -256693174, now seen corresponding path program 53 times [2022-03-15 19:38:04,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:04,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920643619] [2022-03-15 19:38:04,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:04,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:04,235 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:38:04,235 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:04,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920643619] [2022-03-15 19:38:04,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920643619] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:04,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087421881] [2022-03-15 19:38:04,235 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:38:04,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:04,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:04,236 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:38:04,263 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:38:04,313 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:38:04,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:04,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:38:04,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 20 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:04,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:04,907 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:38:04,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087421881] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:04,908 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:04,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 42 [2022-03-15 19:38:04,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2083417888] [2022-03-15 19:38:04,908 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:04,910 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:04,921 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 168 transitions. [2022-03-15 19:38:04,922 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:06,297 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [128505#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 128511#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 128516#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 128509#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 128507#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 128514#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 128503#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 128502#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 128504#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 128515#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 128508#(and (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 128510#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 128519#(or (not (< 5 ~M~0)) (<= 0 ~counter~0)), 128501#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 128506#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 128517#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 128512#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 128518#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 128513#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:38:06,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 19:38:06,297 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:06,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 19:38:06,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=3144, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:38:06,298 INFO L87 Difference]: Start difference. First operand 1130 states and 3582 transitions. Second operand has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 36 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:38:09,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:09,656 INFO L93 Difference]: Finished difference Result 3584 states and 9050 transitions. [2022-03-15 19:38:09,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-03-15 19:38:09,657 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 36 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 26 [2022-03-15 19:38:09,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:09,662 INFO L225 Difference]: With dead ends: 3584 [2022-03-15 19:38:09,662 INFO L226 Difference]: Without dead ends: 3444 [2022-03-15 19:38:09,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7707 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5268, Invalid=18294, Unknown=0, NotChecked=0, Total=23562 [2022-03-15 19:38:09,663 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 479 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 1732 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:09,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [479 Valid, 41 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1732 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:38:09,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states. [2022-03-15 19:38:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 1104. [2022-03-15 19:38:09,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1103 states have (on average 3.155938349954669) internal successors, (3481), 1103 states have internal predecessors, (3481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:09,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 3481 transitions. [2022-03-15 19:38:09,687 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 3481 transitions. Word has length 26 [2022-03-15 19:38:09,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:09,687 INFO L470 AbstractCegarLoop]: Abstraction has 1104 states and 3481 transitions. [2022-03-15 19:38:09,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 36 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:38:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 3481 transitions. [2022-03-15 19:38:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:38:09,689 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:09,689 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:09,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-03-15 19:38:09,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:09,890 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:09,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:09,890 INFO L85 PathProgramCache]: Analyzing trace with hash 485222986, now seen corresponding path program 54 times [2022-03-15 19:38:09,891 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:09,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113410901] [2022-03-15 19:38:09,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:09,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:10,039 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:38:10,039 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:10,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113410901] [2022-03-15 19:38:10,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113410901] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:10,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878170802] [2022-03-15 19:38:10,040 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:38:10,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:10,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:10,041 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:38:10,041 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:38:10,117 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:38:10,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:10,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:38:10,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 19 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:10,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:10,773 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:38:10,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878170802] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:10,773 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:10,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 42 [2022-03-15 19:38:10,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [230107466] [2022-03-15 19:38:10,773 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:10,790 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:10,801 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 159 transitions. [2022-03-15 19:38:10,801 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:12,007 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [134693#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 134694#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 134702#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 134707#(or (not (< 5 ~M~0)) (<= 0 ~counter~0)), 134701#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 134699#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 134703#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 134704#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 134690#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 134695#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 134700#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 134692#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 134698#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 134705#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 134696#(and (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 134697#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 134706#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 134691#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0)))] [2022-03-15 19:38:12,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 19:38:12,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:12,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 19:38:12,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=520, Invalid=3020, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:38:12,008 INFO L87 Difference]: Start difference. First operand 1104 states and 3481 transitions. Second operand has 36 states, 36 states have (on average 2.888888888888889) internal successors, (104), 35 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:38:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:15,574 INFO L93 Difference]: Finished difference Result 3442 states and 8684 transitions. [2022-03-15 19:38:15,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-03-15 19:38:15,574 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.888888888888889) internal successors, (104), 35 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 26 [2022-03-15 19:38:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:15,579 INFO L225 Difference]: With dead ends: 3442 [2022-03-15 19:38:15,579 INFO L226 Difference]: Without dead ends: 3362 [2022-03-15 19:38:15,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8650 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5934, Invalid=20148, Unknown=0, NotChecked=0, Total=26082 [2022-03-15 19:38:15,583 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 548 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 1830 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:15,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 47 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1830 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:38:15,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2022-03-15 19:38:15,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 1070. [2022-03-15 19:38:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 1069 states have (on average 3.1506080449017775) internal successors, (3368), 1069 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:15,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 3368 transitions. [2022-03-15 19:38:15,607 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 3368 transitions. Word has length 26 [2022-03-15 19:38:15,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:15,607 INFO L470 AbstractCegarLoop]: Abstraction has 1070 states and 3368 transitions. [2022-03-15 19:38:15,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.888888888888889) internal successors, (104), 35 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:38:15,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 3368 transitions. [2022-03-15 19:38:15,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:38:15,609 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:15,609 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:15,625 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:38:15,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:15,809 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:15,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:15,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1201892426, now seen corresponding path program 55 times [2022-03-15 19:38:15,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:15,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238816979] [2022-03-15 19:38:15,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:15,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:15,965 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:38:15,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:15,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238816979] [2022-03-15 19:38:15,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238816979] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:15,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489372471] [2022-03-15 19:38:15,965 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:38:15,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:15,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:15,966 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:38:15,967 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:38:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:16,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:38:16,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:16,274 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:38:16,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:16,875 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:38:16,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489372471] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:16,875 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:16,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 42 [2022-03-15 19:38:16,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [648998610] [2022-03-15 19:38:16,875 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:16,877 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:16,888 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 150 transitions. [2022-03-15 19:38:16,888 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:17,929 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [140689#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 140696#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 140688#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 140687#(and (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 140690#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 140692#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 140693#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 140697#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 140702#(or (not (< 5 ~M~0)) (<= 0 ~counter~0)), 140691#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 140695#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 140699#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 140694#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 140700#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 140701#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 140698#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 140686#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0)))] [2022-03-15 19:38:17,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 19:38:17,930 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:17,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 19:38:17,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=2887, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:38:17,930 INFO L87 Difference]: Start difference. First operand 1070 states and 3368 transitions. Second operand has 35 states, 35 states have (on average 2.8285714285714287) internal successors, (99), 34 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:38:21,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:21,283 INFO L93 Difference]: Finished difference Result 3112 states and 7777 transitions. [2022-03-15 19:38:21,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-03-15 19:38:21,283 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8285714285714287) internal successors, (99), 34 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 26 [2022-03-15 19:38:21,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:21,287 INFO L225 Difference]: With dead ends: 3112 [2022-03-15 19:38:21,287 INFO L226 Difference]: Without dead ends: 3072 [2022-03-15 19:38:21,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8552 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5784, Invalid=19656, Unknown=0, NotChecked=0, Total=25440 [2022-03-15 19:38:21,289 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 492 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 2154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:21,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [492 Valid, 60 Invalid, 2154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:38:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2022-03-15 19:38:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 1044. [2022-03-15 19:38:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 1043 states have (on average 3.12464046021093) internal successors, (3259), 1043 states have internal predecessors, (3259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 3259 transitions. [2022-03-15 19:38:21,311 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 3259 transitions. Word has length 26 [2022-03-15 19:38:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:21,311 INFO L470 AbstractCegarLoop]: Abstraction has 1044 states and 3259 transitions. [2022-03-15 19:38:21,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.8285714285714287) internal successors, (99), 34 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:38:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 3259 transitions. [2022-03-15 19:38:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:38:21,313 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:21,313 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:21,328 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:38:21,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:21,513 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:21,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:21,514 INFO L85 PathProgramCache]: Analyzing trace with hash 116632138, now seen corresponding path program 56 times [2022-03-15 19:38:21,514 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:21,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122662642] [2022-03-15 19:38:21,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:21,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:21,658 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:38:21,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:21,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122662642] [2022-03-15 19:38:21,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122662642] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:21,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899125467] [2022-03-15 19:38:21,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:38:21,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:21,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:21,660 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:38:21,691 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:38:21,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:38:21,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:21,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:38:21,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:21,937 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:38:21,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:22,586 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:38:22,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899125467] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:22,587 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:22,587 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 42 [2022-03-15 19:38:22,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [320200686] [2022-03-15 19:38:22,587 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:22,589 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:22,599 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 141 transitions. [2022-03-15 19:38:22,599 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:23,546 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [146309#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 146312#(or (not (< 5 ~M~0)) (<= 0 ~counter~0)), 146304#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 146310#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 146303#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 146300#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 146305#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 146306#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 146308#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 146297#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 146298#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 146311#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 146301#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 146302#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 146299#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 146307#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0)))] [2022-03-15 19:38:23,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:38:23,547 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:23,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:38:23,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=558, Invalid=2748, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 19:38:23,547 INFO L87 Difference]: Start difference. First operand 1044 states and 3259 transitions. Second operand has 34 states, 34 states have (on average 2.764705882352941) internal successors, (94), 33 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:38:27,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:27,331 INFO L93 Difference]: Finished difference Result 3248 states and 8109 transitions. [2022-03-15 19:38:27,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-03-15 19:38:27,332 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.764705882352941) internal successors, (94), 33 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 26 [2022-03-15 19:38:27,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:27,336 INFO L225 Difference]: With dead ends: 3248 [2022-03-15 19:38:27,336 INFO L226 Difference]: Without dead ends: 3232 [2022-03-15 19:38:27,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9086 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=6107, Invalid=20953, Unknown=0, NotChecked=0, Total=27060 [2022-03-15 19:38:27,338 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 361 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:27,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 51 Invalid, 2299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:38:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2022-03-15 19:38:27,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1148. [2022-03-15 19:38:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 3.1621621621621623) internal successors, (3627), 1147 states have internal predecessors, (3627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 3627 transitions. [2022-03-15 19:38:27,358 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 3627 transitions. Word has length 26 [2022-03-15 19:38:27,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:27,358 INFO L470 AbstractCegarLoop]: Abstraction has 1148 states and 3627 transitions. [2022-03-15 19:38:27,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.764705882352941) internal successors, (94), 33 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:38:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 3627 transitions. [2022-03-15 19:38:27,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:38:27,360 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:27,360 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:27,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-03-15 19:38:27,560 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,SelfDestructingSolverStorable57 [2022-03-15 19:38:27,560 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:27,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:27,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1956314934, now seen corresponding path program 57 times [2022-03-15 19:38:27,561 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:27,561 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732266367] [2022-03-15 19:38:27,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:27,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:27,715 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:38:27,715 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:27,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732266367] [2022-03-15 19:38:27,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732266367] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:27,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996040079] [2022-03-15 19:38:27,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:38:27,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:27,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:27,732 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:38:27,733 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:38:27,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:38:27,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:27,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:38:27,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:28,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:28,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996040079] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:28,330 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:28,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 42 [2022-03-15 19:38:28,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2083432173] [2022-03-15 19:38:28,330 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:28,332 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:28,342 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 137 transitions. [2022-03-15 19:38:28,342 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:29,183 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [152269#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 152276#(or (not (< 5 ~M~0)) (<= 0 ~counter~0)), 152266#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 152270#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 152265#(and (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 152267#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 152263#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 152274#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 152264#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 152273#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 152272#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 152275#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 152277#(< thread2Thread1of1ForFork1_~i~1 ~M~0), 152271#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 152268#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)))] [2022-03-15 19:38:29,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:38:29,183 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:29,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:38:29,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=2587, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:38:29,187 INFO L87 Difference]: Start difference. First operand 1148 states and 3627 transitions. Second operand has 33 states, 33 states have (on average 2.727272727272727) internal successors, (90), 32 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:38:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:31,913 INFO L93 Difference]: Finished difference Result 2382 states and 6427 transitions. [2022-03-15 19:38:31,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-03-15 19:38:31,913 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.727272727272727) internal successors, (90), 32 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 26 [2022-03-15 19:38:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:31,917 INFO L225 Difference]: With dead ends: 2382 [2022-03-15 19:38:31,917 INFO L226 Difference]: Without dead ends: 2376 [2022-03-15 19:38:31,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6229 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4781, Invalid=16975, Unknown=0, NotChecked=0, Total=21756 [2022-03-15 19:38:31,919 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 461 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:31,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [461 Valid, 46 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:38:31,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2022-03-15 19:38:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1072. [2022-03-15 19:38:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 3.1363211951447245) internal successors, (3359), 1071 states have internal predecessors, (3359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 3359 transitions. [2022-03-15 19:38:31,938 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 3359 transitions. Word has length 26 [2022-03-15 19:38:31,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:31,938 INFO L470 AbstractCegarLoop]: Abstraction has 1072 states and 3359 transitions. [2022-03-15 19:38:31,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.727272727272727) internal successors, (90), 32 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:38:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 3359 transitions. [2022-03-15 19:38:31,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:38:31,940 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:31,940 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:31,956 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:38:32,140 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,SelfDestructingSolverStorable58 [2022-03-15 19:38:32,141 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:32,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:32,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1978082270, now seen corresponding path program 58 times [2022-03-15 19:38:32,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:32,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262891173] [2022-03-15 19:38:32,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:32,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:32,301 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:38:32,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:32,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262891173] [2022-03-15 19:38:32,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262891173] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:32,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851102454] [2022-03-15 19:38:32,301 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:38:32,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:32,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:32,302 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:38:32,303 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:38:32,371 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:38:32,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:32,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:38:32,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:32,765 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 20 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:32,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:33,078 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:38:33,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851102454] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:33,078 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:33,078 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 40 [2022-03-15 19:38:33,078 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1143688486] [2022-03-15 19:38:33,078 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:33,080 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:33,092 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 159 transitions. [2022-03-15 19:38:33,092 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:34,403 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [157178#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 157182#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 157187#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 157180#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 157189#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 157183#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 157188#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 157186#(and (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 157192#(or (<= 0 ~counter~0) (not (< 4 ~M~0))), 157191#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 4 ~M~0)))), 157184#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 157185#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 157190#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0))), 157179#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 157176#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 157177#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 157181#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0)))] [2022-03-15 19:38:34,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:38:34,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:34,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:38:34,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=2795, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:38:34,404 INFO L87 Difference]: Start difference. First operand 1072 states and 3359 transitions. Second operand has 34 states, 34 states have (on average 3.0) internal successors, (102), 33 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:38:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:36,809 INFO L93 Difference]: Finished difference Result 2640 states and 6886 transitions. [2022-03-15 19:38:36,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-03-15 19:38:36,809 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.0) internal successors, (102), 33 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 26 [2022-03-15 19:38:36,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:36,813 INFO L225 Difference]: With dead ends: 2640 [2022-03-15 19:38:36,813 INFO L226 Difference]: Without dead ends: 2592 [2022-03-15 19:38:36,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5073 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3199, Invalid=13057, Unknown=0, NotChecked=0, Total=16256 [2022-03-15 19:38:36,815 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 248 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:36,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 44 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:38:36,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2022-03-15 19:38:36,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 1068. [2022-03-15 19:38:36,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1067 states have (on average 3.1387066541705715) internal successors, (3349), 1067 states have internal predecessors, (3349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 3349 transitions. [2022-03-15 19:38:36,835 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 3349 transitions. Word has length 26 [2022-03-15 19:38:36,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:36,835 INFO L470 AbstractCegarLoop]: Abstraction has 1068 states and 3349 transitions. [2022-03-15 19:38:36,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.0) internal successors, (102), 33 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:38:36,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 3349 transitions. [2022-03-15 19:38:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:38:36,837 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:36,837 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:36,853 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:38:37,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-03-15 19:38:37,038 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:37,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:37,038 INFO L85 PathProgramCache]: Analyzing trace with hash -236757140, now seen corresponding path program 59 times [2022-03-15 19:38:37,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:37,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090776881] [2022-03-15 19:38:37,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:37,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:37,179 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:38:37,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:37,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090776881] [2022-03-15 19:38:37,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090776881] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:37,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771501872] [2022-03-15 19:38:37,179 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:38:37,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:37,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:37,193 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:38:37,194 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:38:37,280 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:38:37,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:37,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:38:37,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:37,668 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:38:37,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:38,150 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:38:38,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771501872] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:38,151 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:38,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 42 [2022-03-15 19:38:38,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1315135663] [2022-03-15 19:38:38,151 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:38,153 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:38,164 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 150 transitions. [2022-03-15 19:38:38,164 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:39,335 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [162315#(and (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 162311#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 162305#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 162316#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 162312#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (not (< 4 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 162304#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 162318#(or (<= 0 ~counter~0) (not (< 4 ~M~0))), 162314#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 162310#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 162303#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 162307#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 162306#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 162317#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0))), 162308#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0))), 162313#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 162309#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:38:39,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:38:39,335 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:39,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:38:39,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=2861, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 19:38:39,336 INFO L87 Difference]: Start difference. First operand 1068 states and 3349 transitions. Second operand has 33 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 32 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:38:41,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:41,766 INFO L93 Difference]: Finished difference Result 2698 states and 6936 transitions. [2022-03-15 19:38:41,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-03-15 19:38:41,766 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 32 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 26 [2022-03-15 19:38:41,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:41,770 INFO L225 Difference]: With dead ends: 2698 [2022-03-15 19:38:41,770 INFO L226 Difference]: Without dead ends: 2634 [2022-03-15 19:38:41,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5278 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3478, Invalid=13292, Unknown=0, NotChecked=0, Total=16770 [2022-03-15 19:38:41,771 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 381 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:41,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 37 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:38:41,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2022-03-15 19:38:41,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1032. [2022-03-15 19:38:41,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 1031 states have (on average 3.1416100872938895) internal successors, (3239), 1031 states have internal predecessors, (3239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:41,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 3239 transitions. [2022-03-15 19:38:41,789 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 3239 transitions. Word has length 26 [2022-03-15 19:38:41,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:41,789 INFO L470 AbstractCegarLoop]: Abstraction has 1032 states and 3239 transitions. [2022-03-15 19:38:41,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 32 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:38:41,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 3239 transitions. [2022-03-15 19:38:41,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:38:41,790 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:41,790 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:41,808 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:38:41,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:41,991 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:41,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:41,991 INFO L85 PathProgramCache]: Analyzing trace with hash -596227358, now seen corresponding path program 60 times [2022-03-15 19:38:41,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:41,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693462212] [2022-03-15 19:38:41,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:41,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:42,141 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:38:42,141 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:42,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693462212] [2022-03-15 19:38:42,141 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693462212] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:42,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461817985] [2022-03-15 19:38:42,141 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:38:42,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:42,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:42,142 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:38:42,143 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:38:42,237 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:38:42,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:42,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:38:42,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:42,495 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:38:42,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:43,000 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:38:43,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461817985] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:43,000 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:43,000 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 42 [2022-03-15 19:38:43,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1213815871] [2022-03-15 19:38:43,001 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:43,003 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:43,013 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 141 transitions. [2022-03-15 19:38:43,013 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:44,028 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [167431#(or (<= 0 ~counter~0) (not (< 4 ~M~0))), 167428#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 167418#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 167425#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 167429#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0))), 167421#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 167424#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 167420#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 167427#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 167419#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 167417#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 167423#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 167426#(and (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 167430#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 4 ~M~0)))), 167422#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))))] [2022-03-15 19:38:44,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 19:38:44,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:44,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 19:38:44,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=2720, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:38:44,029 INFO L87 Difference]: Start difference. First operand 1032 states and 3239 transitions. Second operand has 32 states, 32 states have (on average 2.875) internal successors, (92), 31 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:46,874 INFO L93 Difference]: Finished difference Result 2620 states and 6556 transitions. [2022-03-15 19:38:46,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-03-15 19:38:46,875 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.875) internal successors, (92), 31 states have internal predecessors, (92), 0 states have call successors, (0), 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:38:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:46,878 INFO L225 Difference]: With dead ends: 2620 [2022-03-15 19:38:46,878 INFO L226 Difference]: Without dead ends: 2596 [2022-03-15 19:38:46,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5992 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4052, Invalid=14854, Unknown=0, NotChecked=0, Total=18906 [2022-03-15 19:38:46,879 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 285 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 2099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:46,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 46 Invalid, 2099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:38:46,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2022-03-15 19:38:46,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 1044. [2022-03-15 19:38:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 1043 states have (on average 3.1284755512943434) internal successors, (3263), 1043 states have internal predecessors, (3263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 3263 transitions. [2022-03-15 19:38:46,899 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 3263 transitions. Word has length 26 [2022-03-15 19:38:46,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:46,899 INFO L470 AbstractCegarLoop]: Abstraction has 1044 states and 3263 transitions. [2022-03-15 19:38:46,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.875) internal successors, (92), 31 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:46,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 3263 transitions. [2022-03-15 19:38:46,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:38:46,900 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:46,900 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:46,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-03-15 19:38:47,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:47,103 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:47,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:47,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1162012500, now seen corresponding path program 61 times [2022-03-15 19:38:47,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:47,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380605397] [2022-03-15 19:38:47,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:47,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:47,234 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:38:47,234 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:47,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380605397] [2022-03-15 19:38:47,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380605397] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:47,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389023860] [2022-03-15 19:38:47,234 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:38:47,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:47,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:47,235 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:38:47,237 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:38:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:47,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:38:47,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:47,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:48,144 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:38:48,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389023860] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:48,144 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:48,144 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 42 [2022-03-15 19:38:48,144 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1209582280] [2022-03-15 19:38:48,144 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:48,146 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:48,156 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 132 transitions. [2022-03-15 19:38:48,156 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:48,926 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [172499#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 172501#(and (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 172494#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 172495#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 172507#(or (<= 0 ~counter~0) (not (< 4 ~M~0))), 172503#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 172504#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (not (< 4 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 172500#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 172497#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 172502#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 172498#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0))), 172496#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 172505#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 172506#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)))] [2022-03-15 19:38:48,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 19:38:48,927 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:48,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 19:38:48,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=2561, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 19:38:48,927 INFO L87 Difference]: Start difference. First operand 1044 states and 3263 transitions. Second operand has 31 states, 31 states have (on average 2.806451612903226) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:52,309 INFO L93 Difference]: Finished difference Result 3092 states and 7610 transitions. [2022-03-15 19:38:52,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-15 19:38:52,310 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.806451612903226) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:38:52,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:52,315 INFO L225 Difference]: With dead ends: 3092 [2022-03-15 19:38:52,315 INFO L226 Difference]: Without dead ends: 3076 [2022-03-15 19:38:52,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8886 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5484, Invalid=20276, Unknown=0, NotChecked=0, Total=25760 [2022-03-15 19:38:52,317 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 479 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:52,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [479 Valid, 36 Invalid, 1827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:38:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3076 states. [2022-03-15 19:38:52,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3076 to 1152. [2022-03-15 19:38:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 3.152910512597741) internal successors, (3629), 1151 states have internal predecessors, (3629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 3629 transitions. [2022-03-15 19:38:52,345 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 3629 transitions. Word has length 26 [2022-03-15 19:38:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:52,346 INFO L470 AbstractCegarLoop]: Abstraction has 1152 states and 3629 transitions. [2022-03-15 19:38:52,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.806451612903226) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 3629 transitions. [2022-03-15 19:38:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:38:52,348 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:52,348 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:52,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-03-15 19:38:52,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:52,549 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:52,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:52,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1217177738, now seen corresponding path program 62 times [2022-03-15 19:38:52,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:52,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19405607] [2022-03-15 19:38:52,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:52,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:38:52,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:52,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19405607] [2022-03-15 19:38:52,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19405607] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:52,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851784352] [2022-03-15 19:38:52,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:38:52,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:52,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:52,684 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:38:52,684 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:38:52,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:38:52,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:52,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:38:52,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 19 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:52,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:53,465 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:38:53,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851784352] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:53,465 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:53,465 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 16] total 41 [2022-03-15 19:38:53,466 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [737794879] [2022-03-15 19:38:53,466 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:53,478 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:53,490 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 150 transitions. [2022-03-15 19:38:53,491 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:54,737 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [178308#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 178309#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 178305#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 178315#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 178319#(or (<= 0 ~counter~0) (not (< 3 ~M~0))), 178310#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 178311#(and (or (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 178318#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 178317#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 178307#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 178316#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 178314#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 178312#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 178306#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 178313#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:38:54,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 19:38:54,737 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:54,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 19:38:54,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=2603, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 19:38:54,738 INFO L87 Difference]: Start difference. First operand 1152 states and 3629 transitions. Second operand has 31 states, 31 states have (on average 3.064516129032258) internal successors, (95), 30 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:38:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:56,357 INFO L93 Difference]: Finished difference Result 3408 states and 9377 transitions. [2022-03-15 19:38:56,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 19:38:56,358 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.064516129032258) internal successors, (95), 30 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 26 [2022-03-15 19:38:56,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:56,363 INFO L225 Difference]: With dead ends: 3408 [2022-03-15 19:38:56,363 INFO L226 Difference]: Without dead ends: 3360 [2022-03-15 19:38:56,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3690 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2001, Invalid=8099, Unknown=0, NotChecked=0, Total=10100 [2022-03-15 19:38:56,364 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 219 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:56,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 30 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:38:56,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2022-03-15 19:38:56,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 1456. [2022-03-15 19:38:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1455 states have (on average 3.1951890034364263) internal successors, (4649), 1455 states have internal predecessors, (4649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 4649 transitions. [2022-03-15 19:38:56,393 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 4649 transitions. Word has length 26 [2022-03-15 19:38:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:56,393 INFO L470 AbstractCegarLoop]: Abstraction has 1456 states and 4649 transitions. [2022-03-15 19:38:56,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.064516129032258) internal successors, (95), 30 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:38:56,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 4649 transitions. [2022-03-15 19:38:56,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:38:56,395 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:56,395 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:56,412 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:38:56,611 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,SelfDestructingSolverStorable63 [2022-03-15 19:38:56,612 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:56,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:56,612 INFO L85 PathProgramCache]: Analyzing trace with hash -503365814, now seen corresponding path program 63 times [2022-03-15 19:38:56,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:56,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330059808] [2022-03-15 19:38:56,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:56,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:56,743 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:38:56,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:56,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330059808] [2022-03-15 19:38:56,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330059808] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:56,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523943639] [2022-03-15 19:38:56,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:38:56,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:56,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:56,745 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:38:56,745 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:38:56,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 19:38:56,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:56,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 19:38:56,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:57,098 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:38:57,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:57,612 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:38:57,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523943639] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:57,613 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:57,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 42 [2022-03-15 19:38:57,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1418300390] [2022-03-15 19:38:57,613 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:57,615 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:57,624 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 132 transitions. [2022-03-15 19:38:57,624 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:58,567 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [184926#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 184933#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 184924#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 184934#(or (<= 0 ~counter~0) (not (< 3 ~M~0))), 184923#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 184927#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 184922#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 184930#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 184929#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 184931#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 184925#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 184928#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 184932#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:38:58,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:38:58,568 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:58,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:38:58,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=2534, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:38:58,568 INFO L87 Difference]: Start difference. First operand 1456 states and 4649 transitions. Second operand has 29 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:01,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:01,244 INFO L93 Difference]: Finished difference Result 3220 states and 8742 transitions. [2022-03-15 19:39:01,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-03-15 19:39:01,245 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 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:39:01,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:01,250 INFO L225 Difference]: With dead ends: 3220 [2022-03-15 19:39:01,251 INFO L226 Difference]: Without dead ends: 3196 [2022-03-15 19:39:01,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5039 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3151, Invalid=12851, Unknown=0, NotChecked=0, Total=16002 [2022-03-15 19:39:01,252 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 276 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:01,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 37 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:39:01,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states. [2022-03-15 19:39:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 1470. [2022-03-15 19:39:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1469 states have (on average 3.1885636487406397) internal successors, (4684), 1469 states have internal predecessors, (4684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:01,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 4684 transitions. [2022-03-15 19:39:01,283 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 4684 transitions. Word has length 26 [2022-03-15 19:39:01,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:01,283 INFO L470 AbstractCegarLoop]: Abstraction has 1470 states and 4684 transitions. [2022-03-15 19:39:01,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 4684 transitions. [2022-03-15 19:39:01,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:39:01,285 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:01,286 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:01,302 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:39:01,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:01,502 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:01,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:01,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1089607098, now seen corresponding path program 64 times [2022-03-15 19:39:01,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:01,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072107984] [2022-03-15 19:39:01,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:01,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:01,599 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:39:01,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:01,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072107984] [2022-03-15 19:39:01,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072107984] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:01,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981821830] [2022-03-15 19:39:01,600 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:39:01,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:01,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:01,601 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:39:01,602 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:39:01,698 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:39:01,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:01,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:39:01,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:01,792 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:39:01,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:02,067 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 21 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:02,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981821830] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:02,067 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:02,067 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 18 [2022-03-15 19:39:02,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [221081835] [2022-03-15 19:39:02,068 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:02,070 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:02,090 INFO L252 McrAutomatonBuilder]: Finished intersection with 116 states and 220 transitions. [2022-03-15 19:39:02,090 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:03,216 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:39:03,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:39:03,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:03,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:39:03,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:39:03,216 INFO L87 Difference]: Start difference. First operand 1470 states and 4684 transitions. Second operand has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:39:03,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:03,474 INFO L93 Difference]: Finished difference Result 2123 states and 6633 transitions. [2022-03-15 19:39:03,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:39:03,474 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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 27 [2022-03-15 19:39:03,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:03,478 INFO L225 Difference]: With dead ends: 2123 [2022-03-15 19:39:03,478 INFO L226 Difference]: Without dead ends: 2080 [2022-03-15 19:39:03,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 131 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:39:03,480 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 21 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:03,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 72 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:39:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2022-03-15 19:39:03,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 1900. [2022-03-15 19:39:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1899 states have (on average 3.251711427066877) internal successors, (6175), 1899 states have internal predecessors, (6175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 6175 transitions. [2022-03-15 19:39:03,505 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 6175 transitions. Word has length 27 [2022-03-15 19:39:03,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:03,505 INFO L470 AbstractCegarLoop]: Abstraction has 1900 states and 6175 transitions. [2022-03-15 19:39:03,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:39:03,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 6175 transitions. [2022-03-15 19:39:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:39:03,508 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:03,508 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:03,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2022-03-15 19:39:03,708 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,SelfDestructingSolverStorable65 [2022-03-15 19:39:03,708 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:03,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:03,709 INFO L85 PathProgramCache]: Analyzing trace with hash 456383826, now seen corresponding path program 65 times [2022-03-15 19:39:03,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:03,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064895884] [2022-03-15 19:39:03,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:03,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:03,911 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:03,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064895884] [2022-03-15 19:39:03,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064895884] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:03,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112696410] [2022-03-15 19:39:03,912 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:39:03,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:03,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:03,913 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:39:03,913 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:39:03,994 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:39:03,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:03,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:39:03,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:04,203 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:39:04,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 18 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:39:04,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112696410] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:04,537 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:04,537 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 38 [2022-03-15 19:39:04,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1423544923] [2022-03-15 19:39:04,538 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:04,539 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:04,551 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 140 transitions. [2022-03-15 19:39:04,551 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:05,689 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [197542#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 2)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 197540#(and (or (<= ~counter~0 4) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 197534#(and (or (<= ~counter~0 4) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 197541#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (<= ~counter~0 3) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 197543#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= ~counter~0 1)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 197536#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 2)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 197539#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 5)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 197535#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= ~counter~0 3) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 197426#(< thread2Thread1of1ForFork1_~i~1 ~M~0), 197544#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 197545#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 5 ~M~0)) (<= ~counter~0 0))), 197537#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= ~counter~0 1)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 197538#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 0)) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 197533#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 5)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 197546#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (<= ~counter~0 0)))] [2022-03-15 19:39:05,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:39:05,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:05,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:39:05,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2450, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:39:05,690 INFO L87 Difference]: Start difference. First operand 1900 states and 6175 transitions. Second operand has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 33 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:09,617 INFO L93 Difference]: Finished difference Result 3326 states and 9604 transitions. [2022-03-15 19:39:09,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-03-15 19:39:09,618 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 33 states have internal predecessors, (92), 0 states have call successors, (0), 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:39:09,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:09,623 INFO L225 Difference]: With dead ends: 3326 [2022-03-15 19:39:09,623 INFO L226 Difference]: Without dead ends: 3320 [2022-03-15 19:39:09,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4826 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2346, Invalid=17394, Unknown=0, NotChecked=0, Total=19740 [2022-03-15 19:39:09,624 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 316 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 4257 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 4522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 4257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:09,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 99 Invalid, 4522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 4257 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 19:39:09,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3320 states. [2022-03-15 19:39:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3320 to 2096. [2022-03-15 19:39:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 2095 states have (on average 3.212887828162291) internal successors, (6731), 2095 states have internal predecessors, (6731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:09,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 6731 transitions. [2022-03-15 19:39:09,658 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 6731 transitions. Word has length 27 [2022-03-15 19:39:09,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:09,658 INFO L470 AbstractCegarLoop]: Abstraction has 2096 states and 6731 transitions. [2022-03-15 19:39:09,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 33 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:09,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 6731 transitions. [2022-03-15 19:39:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:39:09,661 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:09,661 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:09,677 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:39:09,861 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,SelfDestructingSolverStorable66 [2022-03-15 19:39:09,862 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:09,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:09,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2065527930, now seen corresponding path program 66 times [2022-03-15 19:39:09,863 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:09,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664289809] [2022-03-15 19:39:09,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:09,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:10,061 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:10,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664289809] [2022-03-15 19:39:10,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664289809] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:10,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249291877] [2022-03-15 19:39:10,061 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:39:10,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:10,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:10,062 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:39:10,063 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:39:10,157 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 19:39:10,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:10,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 19:39:10,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:10,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:11,910 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:39:11,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249291877] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:11,910 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:11,910 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 44 [2022-03-15 19:39:11,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [144536688] [2022-03-15 19:39:11,911 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:11,912 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:11,923 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 135 transitions. [2022-03-15 19:39:11,923 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:13,004 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [205445#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 3) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 205442#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 4)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 205450#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 1) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 205454#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (<= ~counter~0 0) (not (< 4 ~M~0)))), 205444#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 3) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 205452#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= ~counter~0 0))), 205446#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 205443#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 4)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 205448#(and (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 2))), 205447#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 2))), 205449#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 1) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 205455#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 205451#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= ~counter~0 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 205453#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (<= ~counter~0 0) (not (< 4 ~M~0))) (or (not (< 4 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:39:13,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:39:13,004 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:13,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:39:13,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=3003, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:39:13,005 INFO L87 Difference]: Start difference. First operand 2096 states and 6731 transitions. Second operand has 33 states, 33 states have (on average 2.727272727272727) internal successors, (90), 32 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:39:17,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:17,906 INFO L93 Difference]: Finished difference Result 3724 states and 10352 transitions. [2022-03-15 19:39:17,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-03-15 19:39:17,907 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.727272727272727) internal successors, (90), 32 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 27 [2022-03-15 19:39:17,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:17,912 INFO L225 Difference]: With dead ends: 3724 [2022-03-15 19:39:17,912 INFO L226 Difference]: Without dead ends: 3698 [2022-03-15 19:39:17,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6146 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3005, Invalid=19047, Unknown=0, NotChecked=0, Total=22052 [2022-03-15 19:39:17,914 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 305 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 4162 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 4397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 4162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:17,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 84 Invalid, 4397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 4162 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:39:17,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2022-03-15 19:39:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 1778. [2022-03-15 19:39:17,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1777 states have (on average 3.232414181204277) internal successors, (5744), 1777 states have internal predecessors, (5744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 5744 transitions. [2022-03-15 19:39:17,944 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 5744 transitions. Word has length 27 [2022-03-15 19:39:17,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:17,944 INFO L470 AbstractCegarLoop]: Abstraction has 1778 states and 5744 transitions. [2022-03-15 19:39:17,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.727272727272727) internal successors, (90), 32 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:39:17,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 5744 transitions. [2022-03-15 19:39:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:39:17,947 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:17,947 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:17,965 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:39:18,159 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,SelfDestructingSolverStorable67 [2022-03-15 19:39:18,159 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:18,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:18,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2080504686, now seen corresponding path program 67 times [2022-03-15 19:39:18,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:18,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296973209] [2022-03-15 19:39:18,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:18,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:18,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:18,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296973209] [2022-03-15 19:39:18,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296973209] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:18,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565354550] [2022-03-15 19:39:18,356 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:39:18,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:18,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:18,357 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:39:18,358 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:39:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:18,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:39:18,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:18,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:19,793 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:19,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565354550] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:19,793 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:19,793 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 46 [2022-03-15 19:39:19,793 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1255134065] [2022-03-15 19:39:19,793 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:19,795 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:19,806 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 135 transitions. [2022-03-15 19:39:19,806 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:20,958 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [213130#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (<= ~counter~0 0)) (or (not (< 3 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 213121#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (<= ~counter~0 3) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 213131#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (<= ~counter~0 0))), 213120#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 213124#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= ~counter~0 2)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 213126#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 1) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 213122#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 213127#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 213128#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 1) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 213129#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 213119#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 213125#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= ~counter~0 2)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 213123#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (<= ~counter~0 3) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0)))] [2022-03-15 19:39:20,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 19:39:20,959 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:20,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 19:39:20,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=3118, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:39:20,959 INFO L87 Difference]: Start difference. First operand 1778 states and 5744 transitions. Second operand has 32 states, 32 states have (on average 2.78125) internal successors, (89), 31 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:39:25,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:25,356 INFO L93 Difference]: Finished difference Result 3850 states and 10365 transitions. [2022-03-15 19:39:25,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-03-15 19:39:25,356 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.78125) internal successors, (89), 31 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 27 [2022-03-15 19:39:25,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:25,362 INFO L225 Difference]: With dead ends: 3850 [2022-03-15 19:39:25,362 INFO L226 Difference]: Without dead ends: 3830 [2022-03-15 19:39:25,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2638, Invalid=19118, Unknown=0, NotChecked=0, Total=21756 [2022-03-15 19:39:25,364 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 221 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 2590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:25,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 63 Invalid, 2590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 2378 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:39:25,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3830 states. [2022-03-15 19:39:25,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3830 to 1764. [2022-03-15 19:39:25,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 3.238230289279637) internal successors, (5709), 1763 states have internal predecessors, (5709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 5709 transitions. [2022-03-15 19:39:25,406 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 5709 transitions. Word has length 27 [2022-03-15 19:39:25,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:25,406 INFO L470 AbstractCegarLoop]: Abstraction has 1764 states and 5709 transitions. [2022-03-15 19:39:25,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.78125) internal successors, (89), 31 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:39:25,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 5709 transitions. [2022-03-15 19:39:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:39:25,408 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:25,408 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:25,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-03-15 19:39:25,618 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,SelfDestructingSolverStorable68 [2022-03-15 19:39:25,618 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:25,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash 620154426, now seen corresponding path program 68 times [2022-03-15 19:39:25,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:25,619 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960675223] [2022-03-15 19:39:25,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:25,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:25,836 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:25,836 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:25,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960675223] [2022-03-15 19:39:25,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960675223] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:25,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041836661] [2022-03-15 19:39:25,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:39:25,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:25,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:25,838 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:39:25,859 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:39:25,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:39:25,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:25,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 19:39:25,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:26,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:26,983 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041836661] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:26,983 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:26,983 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 46 [2022-03-15 19:39:26,983 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [470306858] [2022-03-15 19:39:26,983 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:26,985 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:26,996 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 135 transitions. [2022-03-15 19:39:26,996 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:28,101 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [220893#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 2)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 220900#(and (or (<= ~counter~0 0) (not (< 2 ~M~0))) (or (<= 0 ~counter~0) (not (< 2 ~M~0)))), 220892#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 220894#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 2)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 220898#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 0))), 220891#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 220896#(and (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 1) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 220899#(and (or (<= ~counter~0 0) (not (< 2 ~M~0))) (or (<= 0 ~counter~0) (not (< 2 ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 2 ~M~0)))), 220889#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 220890#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 220895#(and (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 1) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 220897#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 0)))] [2022-03-15 19:39:28,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 19:39:28,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:28,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 19:39:28,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=2986, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:39:28,102 INFO L87 Difference]: Start difference. First operand 1764 states and 5709 transitions. Second operand has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 30 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:39:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:30,213 INFO L93 Difference]: Finished difference Result 3564 states and 10011 transitions. [2022-03-15 19:39:30,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-15 19:39:30,213 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 30 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) Word has length 27 [2022-03-15 19:39:30,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:30,219 INFO L225 Difference]: With dead ends: 3564 [2022-03-15 19:39:30,219 INFO L226 Difference]: Without dead ends: 3544 [2022-03-15 19:39:30,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1565, Invalid=10867, Unknown=0, NotChecked=0, Total=12432 [2022-03-15 19:39:30,232 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 160 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:30,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 42 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:39:30,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2022-03-15 19:39:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 1806. [2022-03-15 19:39:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1805 states have (on average 3.221052631578947) internal successors, (5814), 1805 states have internal predecessors, (5814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:30,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 5814 transitions. [2022-03-15 19:39:30,261 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 5814 transitions. Word has length 27 [2022-03-15 19:39:30,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:30,261 INFO L470 AbstractCegarLoop]: Abstraction has 1806 states and 5814 transitions. [2022-03-15 19:39:30,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 30 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:39:30,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 5814 transitions. [2022-03-15 19:39:30,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:39:30,264 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:30,264 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:30,283 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:39:30,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:30,480 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:30,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash -597434286, now seen corresponding path program 69 times [2022-03-15 19:39:30,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:30,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333384512] [2022-03-15 19:39:30,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:30,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:30,641 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:30,641 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333384512] [2022-03-15 19:39:30,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333384512] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:30,641 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607395273] [2022-03-15 19:39:30,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:39:30,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:30,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:30,642 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:39:30,643 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:39:30,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:39:30,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:30,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:39:30,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:31,108 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:31,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 11 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:31,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607395273] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:31,733 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:31,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 48 [2022-03-15 19:39:31,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [500961650] [2022-03-15 19:39:31,733 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:31,735 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:31,745 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 135 transitions. [2022-03-15 19:39:31,745 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:32,798 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [228388#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 1 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 1)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 228397#(and (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 228394#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 228395#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 228390#(and (or (not (< 1 ~M~0)) (<= ~counter~0 0)) (or (not (< 1 ~M~0)) (<= 0 ~counter~0)) (or (not (< 1 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 228393#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 228389#(and (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 228398#(and (or (not (< 1 ~M~0)) (<= ~counter~0 0)) (or (not (< 1 ~M~0)) (<= 0 ~counter~0))), 228396#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 1 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 1)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 228392#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 228391#(< thread1Thread1of1ForFork0_~i~0 ~M~0)] [2022-03-15 19:39:32,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 19:39:32,799 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:32,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 19:39:32,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=3115, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:39:32,799 INFO L87 Difference]: Start difference. First operand 1806 states and 5814 transitions. Second operand has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:34,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:34,138 INFO L93 Difference]: Finished difference Result 3056 states and 8887 transitions. [2022-03-15 19:39:34,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 19:39:34,138 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:39:34,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:34,143 INFO L225 Difference]: With dead ends: 3056 [2022-03-15 19:39:34,143 INFO L226 Difference]: Without dead ends: 3008 [2022-03-15 19:39:34,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2844 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1164, Invalid=7578, Unknown=0, NotChecked=0, Total=8742 [2022-03-15 19:39:34,144 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 148 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:34,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 35 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:39:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2022-03-15 19:39:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 1786. [2022-03-15 19:39:34,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1785 states have (on average 3.2291316526610645) internal successors, (5764), 1785 states have internal predecessors, (5764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 5764 transitions. [2022-03-15 19:39:34,171 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 5764 transitions. Word has length 27 [2022-03-15 19:39:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:34,171 INFO L470 AbstractCegarLoop]: Abstraction has 1786 states and 5764 transitions. [2022-03-15 19:39:34,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:34,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 5764 transitions. [2022-03-15 19:39:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:39:34,173 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:34,173 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:34,189 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:39:34,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:34,374 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:34,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:34,374 INFO L85 PathProgramCache]: Analyzing trace with hash 727123962, now seen corresponding path program 70 times [2022-03-15 19:39:34,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:34,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524592963] [2022-03-15 19:39:34,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:34,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:34,529 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:34,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524592963] [2022-03-15 19:39:34,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524592963] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:34,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464785490] [2022-03-15 19:39:34,529 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:39:34,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:34,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:34,533 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:39:34,534 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:39:34,615 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:39:34,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:34,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 19:39:34,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:35,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:35,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464785490] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:35,554 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:35,554 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2022-03-15 19:39:35,554 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2112955036] [2022-03-15 19:39:35,555 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:35,556 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:35,567 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 135 transitions. [2022-03-15 19:39:35,567 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:36,658 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [235301#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 235308#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 0))), 235303#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 235302#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 235307#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 235304#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 235310#(and (or (not (< 0 ~M~0)) (<= ~counter~0 0)) (or (not (< 0 ~M~0)) (<= 0 ~counter~0))), 235309#(and (or (not (< 0 ~M~0)) (<= ~counter~0 0)) (or (not (< 0 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 0 ~M~0)) (<= 0 ~counter~0))), 235305#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 235306#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0)))] [2022-03-15 19:39:36,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:39:36,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:36,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:39:36,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=3097, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:39:36,659 INFO L87 Difference]: Start difference. First operand 1786 states and 5764 transitions. Second operand has 29 states, 29 states have (on average 2.9655172413793105) internal successors, (86), 28 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:39:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:37,669 INFO L93 Difference]: Finished difference Result 2908 states and 8712 transitions. [2022-03-15 19:39:37,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 19:39:37,670 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.9655172413793105) internal successors, (86), 28 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 27 [2022-03-15 19:39:37,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:37,675 INFO L225 Difference]: With dead ends: 2908 [2022-03-15 19:39:37,675 INFO L226 Difference]: Without dead ends: 2844 [2022-03-15 19:39:37,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2671 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1163, Invalid=6847, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 19:39:37,676 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 170 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:37,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 24 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:39:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2022-03-15 19:39:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2222. [2022-03-15 19:39:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2222 states, 2221 states have (on average 3.220171094101756) internal successors, (7152), 2221 states have internal predecessors, (7152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 7152 transitions. [2022-03-15 19:39:37,717 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 7152 transitions. Word has length 27 [2022-03-15 19:39:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:37,717 INFO L470 AbstractCegarLoop]: Abstraction has 2222 states and 7152 transitions. [2022-03-15 19:39:37,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.9655172413793105) internal successors, (86), 28 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:39:37,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 7152 transitions. [2022-03-15 19:39:37,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:39:37,722 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:37,722 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:37,738 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:39:37,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:37,923 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:37,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:37,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2026821567, now seen corresponding path program 71 times [2022-03-15 19:39:37,924 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:37,924 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775108908] [2022-03-15 19:39:37,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:37,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:38,099 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:39:38,099 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:38,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775108908] [2022-03-15 19:39:38,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775108908] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:38,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539166118] [2022-03-15 19:39:38,099 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:39:38,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:38,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:38,100 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:39:38,101 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:39:38,202 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:39:38,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:38,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:39:38,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:38,427 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:39:38,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:39,495 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:39:39,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539166118] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:39,496 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:39,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 46 [2022-03-15 19:39:39,496 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1087255963] [2022-03-15 19:39:39,496 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:39,498 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:39,516 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 232 transitions. [2022-03-15 19:39:39,516 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:41,681 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [242940#(and (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 7 ~counter~0)) (or (<= 8 ~M~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0))), 242935#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 242952#(and (or (<= ~M~0 (+ 7 thread1Thread1of1ForFork0_~i~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (<= ~M~0 (+ 7 thread1Thread1of1ForFork0_~i~0))) (or (<= 8 ~M~0) (<= ~M~0 (+ 7 thread1Thread1of1ForFork0_~i~0)))), 242956#(or (<= 0 ~counter~0) (<= ~M~0 7)), 242931#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 242938#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 7 ~counter~0))), 242949#(and (or (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 8 ~M~0) (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0))) (or (<= 2 ~counter~0) (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)))), 242946#(and (or (<= 5 ~counter~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= 8 ~M~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0)))), 242933#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 242939#(and (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 7 ~counter~0)) (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 8 ~M~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0))), 242945#(and (or (<= 6 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))) (or (<= 8 ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)))), 242951#(and (or (<= ~M~0 (+ 6 thread1Thread1of1ForFork0_~i~0)) (<= 8 ~M~0)) (or (<= ~M~0 (+ 6 thread1Thread1of1ForFork0_~i~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M~0 (+ 6 thread1Thread1of1ForFork0_~i~0)) (<= 1 ~counter~0))), 242953#(and (or (<= ~M~0 (+ 6 thread1Thread1of1ForFork0_~i~0)) (<= 8 ~M~0)) (or (<= ~M~0 (+ 6 thread1Thread1of1ForFork0_~i~0)) (<= 1 ~counter~0))), 242937#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 242950#(and (or (<= 8 ~M~0) (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0))) (or (<= 2 ~counter~0) (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)))), 242955#(and (or (<= 0 ~counter~0) (<= ~M~0 (+ 7 thread1Thread1of1ForFork0_~i~0))) (or (<= 8 ~M~0) (<= ~M~0 (+ 7 thread1Thread1of1ForFork0_~i~0)))), 242932#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 242936#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 242934#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 242954#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (<= ~M~0 7)) (or (<= 0 ~counter~0) (<= ~M~0 7))), 242948#(and (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)) (<= 3 ~counter~0)) (or (<= 8 ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)))), 242941#(and (or (<= 6 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))) (or (<= 8 ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))) (or (= thread2Thread1of1ForFork1_~i~1 0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)))), 242942#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= 5 ~counter~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= 8 ~M~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0)))), 242947#(and (or (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)) (<= 4 ~counter~0)) (or (<= 8 ~M~0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)))), 242944#(and (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)) (<= 3 ~counter~0)) (or (<= 8 ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)))), 242943#(and (or (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)) (<= 4 ~counter~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0))) (or (<= 8 ~M~0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0))))] [2022-03-15 19:39:41,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 19:39:41,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:41,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 19:39:41,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=4329, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 19:39:41,682 INFO L87 Difference]: Start difference. First operand 2222 states and 7152 transitions. Second operand has 46 states, 46 states have (on average 3.108695652173913) internal successors, (143), 45 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:39:47,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:47,283 INFO L93 Difference]: Finished difference Result 5642 states and 16021 transitions. [2022-03-15 19:39:47,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2022-03-15 19:39:47,283 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.108695652173913) internal successors, (143), 45 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) Word has length 28 [2022-03-15 19:39:47,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:47,291 INFO L225 Difference]: With dead ends: 5642 [2022-03-15 19:39:47,291 INFO L226 Difference]: Without dead ends: 5642 [2022-03-15 19:39:47,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 89 SyntacticMatches, 7 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18718 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=12211, Invalid=40001, Unknown=0, NotChecked=0, Total=52212 [2022-03-15 19:39:47,294 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 425 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 3337 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 3499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 3337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:47,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 68 Invalid, 3499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 3337 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 19:39:47,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2022-03-15 19:39:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 2352. [2022-03-15 19:39:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 2351 states have (on average 3.232666950233943) internal successors, (7600), 2351 states have internal predecessors, (7600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 7600 transitions. [2022-03-15 19:39:47,341 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 7600 transitions. Word has length 28 [2022-03-15 19:39:47,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:47,341 INFO L470 AbstractCegarLoop]: Abstraction has 2352 states and 7600 transitions. [2022-03-15 19:39:47,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.108695652173913) internal successors, (143), 45 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:39:47,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 7600 transitions. [2022-03-15 19:39:47,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:39:47,344 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:47,344 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:47,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-03-15 19:39:47,561 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,SelfDestructingSolverStorable72 [2022-03-15 19:39:47,561 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:47,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:47,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1551796951, now seen corresponding path program 72 times [2022-03-15 19:39:47,562 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:47,562 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306525397] [2022-03-15 19:39:47,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:47,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:47,746 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:39:47,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:47,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306525397] [2022-03-15 19:39:47,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306525397] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:47,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844092015] [2022-03-15 19:39:47,747 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:39:47,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:47,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:47,748 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:39:47,748 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:39:47,836 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:39:47,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:47,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:39:47,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:48,057 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:39:48,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:48,817 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:39:48,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844092015] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:48,817 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:48,817 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 47 [2022-03-15 19:39:48,817 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1058595577] [2022-03-15 19:39:48,817 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:48,819 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:48,835 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 201 transitions. [2022-03-15 19:39:48,835 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:50,625 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [253831#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 253826#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0))), 253847#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 253844#(and (or (not (< 6 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 6 ~M~0)) (<= 0 ~counter~0))), 253846#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0))), 253848#(or (not (< 6 ~M~0)) (<= 0 ~counter~0)), 253843#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 253836#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 5 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 253840#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 253839#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 253834#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 253828#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 253842#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 253845#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 253827#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 253830#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 253835#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 253837#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 253841#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 253833#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 253829#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 253838#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 253832#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0)))] [2022-03-15 19:39:50,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 19:39:50,625 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:50,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 19:39:50,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=4166, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 19:39:50,626 INFO L87 Difference]: Start difference. First operand 2352 states and 7600 transitions. Second operand has 43 states, 43 states have (on average 3.0) internal successors, (129), 42 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:39:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:55,161 INFO L93 Difference]: Finished difference Result 6972 states and 19056 transitions. [2022-03-15 19:39:55,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-03-15 19:39:55,161 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.0) internal successors, (129), 42 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:39:55,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:55,171 INFO L225 Difference]: With dead ends: 6972 [2022-03-15 19:39:55,171 INFO L226 Difference]: Without dead ends: 6820 [2022-03-15 19:39:55,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12389 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7841, Invalid=27691, Unknown=0, NotChecked=0, Total=35532 [2022-03-15 19:39:55,173 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 571 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 2624 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 2792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 2624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:55,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [571 Valid, 56 Invalid, 2792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 2624 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:39:55,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6820 states. [2022-03-15 19:39:55,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6820 to 2552. [2022-03-15 19:39:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2551 states have (on average 3.235593884751078) internal successors, (8254), 2551 states have internal predecessors, (8254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:55,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 8254 transitions. [2022-03-15 19:39:55,221 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 8254 transitions. Word has length 28 [2022-03-15 19:39:55,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:55,221 INFO L470 AbstractCegarLoop]: Abstraction has 2552 states and 8254 transitions. [2022-03-15 19:39:55,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.0) internal successors, (129), 42 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:39:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 8254 transitions. [2022-03-15 19:39:55,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:39:55,225 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:55,225 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:55,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2022-03-15 19:39:55,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:55,426 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:55,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:55,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1568655575, now seen corresponding path program 73 times [2022-03-15 19:39:55,427 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:55,427 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990853014] [2022-03-15 19:39:55,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:55,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:55,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:39:55,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:55,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990853014] [2022-03-15 19:39:55,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990853014] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:55,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737518691] [2022-03-15 19:39:55,583 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:39:55,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:55,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:55,584 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:39:55,584 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:39:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:55,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:39:55,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 27 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:55,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:56,526 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:39:56,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737518691] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:56,526 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:56,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 47 [2022-03-15 19:39:56,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [848157949] [2022-03-15 19:39:56,526 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:56,528 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:56,543 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 192 transitions. [2022-03-15 19:39:56,543 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:58,258 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [266392#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 266380#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 266389#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 266372#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 266393#(or (not (< 6 ~M~0)) (<= 0 ~counter~0)), 266375#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 266377#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 266381#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 266383#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0))), 266379#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 266390#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0))), 266384#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 266374#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 266376#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 266387#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 266386#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 266391#(and (or (not (< 6 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 6 ~M~0)) (<= 0 ~counter~0))), 266388#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 266373#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 5 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 266382#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 266385#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 5 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 266378#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)))] [2022-03-15 19:39:58,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 19:39:58,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:58,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 19:39:58,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=4022, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 19:39:58,259 INFO L87 Difference]: Start difference. First operand 2552 states and 8254 transitions. Second operand has 42 states, 42 states have (on average 2.9523809523809526) internal successors, (124), 41 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:40:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:02,501 INFO L93 Difference]: Finished difference Result 6362 states and 17655 transitions. [2022-03-15 19:40:02,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-03-15 19:40:02,501 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.9523809523809526) internal successors, (124), 41 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 28 [2022-03-15 19:40:02,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:02,512 INFO L225 Difference]: With dead ends: 6362 [2022-03-15 19:40:02,512 INFO L226 Difference]: Without dead ends: 6278 [2022-03-15 19:40:02,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13375 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=8276, Invalid=29166, Unknown=0, NotChecked=0, Total=37442 [2022-03-15 19:40:02,516 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 454 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 2831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:02,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 49 Invalid, 2831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:40:02,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6278 states. [2022-03-15 19:40:02,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6278 to 2528. [2022-03-15 19:40:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2528 states, 2527 states have (on average 3.2330827067669174) internal successors, (8170), 2527 states have internal predecessors, (8170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:02,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 8170 transitions. [2022-03-15 19:40:02,573 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 8170 transitions. Word has length 28 [2022-03-15 19:40:02,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:02,573 INFO L470 AbstractCegarLoop]: Abstraction has 2528 states and 8170 transitions. [2022-03-15 19:40:02,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.9523809523809526) internal successors, (124), 41 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:40:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 8170 transitions. [2022-03-15 19:40:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:40:02,577 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:02,577 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:02,592 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:40:02,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:02,777 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:40:02,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:02,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1201747241, now seen corresponding path program 74 times [2022-03-15 19:40:02,778 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:02,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899281980] [2022-03-15 19:40:02,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:02,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:02,962 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:40:02,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:02,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899281980] [2022-03-15 19:40:02,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899281980] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:02,963 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628427573] [2022-03-15 19:40:02,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:40:02,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:02,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:02,964 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:40:02,965 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:40:03,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:40:03,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:03,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:40:03,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 26 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:03,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:03,936 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:40:03,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628427573] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:03,936 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:03,936 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 47 [2022-03-15 19:40:03,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1120116325] [2022-03-15 19:40:03,937 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:03,938 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:03,953 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 183 transitions. [2022-03-15 19:40:03,953 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:05,465 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [278280#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 278276#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 278282#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 278275#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 278285#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 278289#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 278274#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 278286#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 278279#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 278273#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0))), 278284#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 278272#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 278291#(or (not (< 6 ~M~0)) (<= 0 ~counter~0)), 278277#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 278271#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 278278#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 278281#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 278290#(and (or (not (< 6 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 6 ~M~0)) (<= 0 ~counter~0))), 278287#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0))), 278288#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 278283#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 5 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))))] [2022-03-15 19:40:05,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:40:05,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:05,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:40:05,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=3909, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 19:40:05,466 INFO L87 Difference]: Start difference. First operand 2528 states and 8170 transitions. Second operand has 41 states, 41 states have (on average 2.902439024390244) internal successors, (119), 40 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:40:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:10,464 INFO L93 Difference]: Finished difference Result 7182 states and 19488 transitions. [2022-03-15 19:40:10,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2022-03-15 19:40:10,464 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.902439024390244) internal successors, (119), 40 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 28 [2022-03-15 19:40:10,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:10,475 INFO L225 Difference]: With dead ends: 7182 [2022-03-15 19:40:10,475 INFO L226 Difference]: Without dead ends: 7042 [2022-03-15 19:40:10,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14670 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=9379, Invalid=31223, Unknown=0, NotChecked=0, Total=40602 [2022-03-15 19:40:10,477 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 596 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:10,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [596 Valid, 58 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:40:10,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7042 states. [2022-03-15 19:40:10,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7042 to 2424. [2022-03-15 19:40:10,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2424 states, 2423 states have (on average 3.2191498142798185) internal successors, (7800), 2423 states have internal predecessors, (7800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:10,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 7800 transitions. [2022-03-15 19:40:10,545 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 7800 transitions. Word has length 28 [2022-03-15 19:40:10,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:10,545 INFO L470 AbstractCegarLoop]: Abstraction has 2424 states and 7800 transitions. [2022-03-15 19:40:10,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.902439024390244) internal successors, (119), 40 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:40:10,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 7800 transitions. [2022-03-15 19:40:10,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:40:10,549 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:10,549 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:10,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2022-03-15 19:40:10,749 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,SelfDestructingSolverStorable75 [2022-03-15 19:40:10,749 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:40:10,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:10,750 INFO L85 PathProgramCache]: Analyzing trace with hash -459831081, now seen corresponding path program 75 times [2022-03-15 19:40:10,750 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:10,750 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823044057] [2022-03-15 19:40:10,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:10,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:10,933 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:40:10,933 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:10,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823044057] [2022-03-15 19:40:10,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823044057] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:10,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820359122] [2022-03-15 19:40:10,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:40:10,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:10,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:10,940 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:40:10,975 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:40:11,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:40:11,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:11,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:40:11,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:11,262 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:40:11,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:11,859 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:40:11,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820359122] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:11,859 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:11,859 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 47 [2022-03-15 19:40:11,859 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [249020602] [2022-03-15 19:40:11,860 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:11,861 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:11,889 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 174 transitions. [2022-03-15 19:40:11,889 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:13,211 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [290815#(and (or (not (< 6 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 6 ~M~0)) (<= 0 ~counter~0))), 290801#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 290814#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 290802#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 290805#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 290804#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 290818#(or (not (< 6 ~M~0)) (<= 0 ~counter~0)), 290810#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 5 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 290799#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 290811#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 290817#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 290813#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 290816#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0))), 290807#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 290806#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 290808#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 290809#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 290812#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 290803#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0))), 290800#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))] [2022-03-15 19:40:13,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 19:40:13,212 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:13,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 19:40:13,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=3770, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 19:40:13,213 INFO L87 Difference]: Start difference. First operand 2424 states and 7800 transitions. Second operand has 40 states, 40 states have (on average 2.85) internal successors, (114), 39 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:40:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:18,174 INFO L93 Difference]: Finished difference Result 6436 states and 17153 transitions. [2022-03-15 19:40:18,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2022-03-15 19:40:18,174 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.85) internal successors, (114), 39 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) Word has length 28 [2022-03-15 19:40:18,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:18,184 INFO L225 Difference]: With dead ends: 6436 [2022-03-15 19:40:18,184 INFO L226 Difference]: Without dead ends: 6356 [2022-03-15 19:40:18,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14533 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=9579, Invalid=32241, Unknown=0, NotChecked=0, Total=41820 [2022-03-15 19:40:18,186 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 626 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 2298 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 2524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 2298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:18,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [626 Valid, 64 Invalid, 2524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 2298 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:40:18,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6356 states. [2022-03-15 19:40:18,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6356 to 2446. [2022-03-15 19:40:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2446 states, 2445 states have (on average 3.207770961145194) internal successors, (7843), 2445 states have internal predecessors, (7843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 7843 transitions. [2022-03-15 19:40:18,233 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 7843 transitions. Word has length 28 [2022-03-15 19:40:18,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:18,233 INFO L470 AbstractCegarLoop]: Abstraction has 2446 states and 7843 transitions. [2022-03-15 19:40:18,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.85) internal successors, (114), 39 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:40:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 7843 transitions. [2022-03-15 19:40:18,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:40:18,236 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:18,236 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:18,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2022-03-15 19:40:18,439 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,SelfDestructingSolverStorable76 [2022-03-15 19:40:18,439 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:40:18,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:18,440 INFO L85 PathProgramCache]: Analyzing trace with hash 256838359, now seen corresponding path program 76 times [2022-03-15 19:40:18,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:18,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205993027] [2022-03-15 19:40:18,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:18,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:18,602 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:40:18,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:18,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205993027] [2022-03-15 19:40:18,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205993027] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:18,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977499519] [2022-03-15 19:40:18,603 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:40:18,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:18,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:18,604 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:40:18,604 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:40:18,684 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:40:18,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:18,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 19:40:18,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:19,146 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:40:19,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:19,458 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:40:19,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977499519] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:19,458 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:19,458 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 45 [2022-03-15 19:40:19,458 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1321567426] [2022-03-15 19:40:19,458 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:19,460 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:19,473 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 165 transitions. [2022-03-15 19:40:19,474 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:20,630 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [302642#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 302633#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 302632#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 302646#(and (or (not (< 6 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 6 ~M~0)) (<= 0 ~counter~0))), 302648#(or (not (< 6 ~M~0)) (<= 0 ~counter~0)), 302639#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 302635#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 302641#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 302644#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 302636#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 302645#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0))), 302638#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 5 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 302647#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 302637#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 302640#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 302643#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 302634#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 302630#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0))), 302631#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))))] [2022-03-15 19:40:20,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 19:40:20,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:20,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 19:40:20,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=3529, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:40:20,631 INFO L87 Difference]: Start difference. First operand 2446 states and 7843 transitions. Second operand has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 38 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:40:25,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:25,151 INFO L93 Difference]: Finished difference Result 5944 states and 15785 transitions. [2022-03-15 19:40:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2022-03-15 19:40:25,152 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 38 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 28 [2022-03-15 19:40:25,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:25,171 INFO L225 Difference]: With dead ends: 5944 [2022-03-15 19:40:25,171 INFO L226 Difference]: Without dead ends: 5904 [2022-03-15 19:40:25,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13022 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=8102, Invalid=29340, Unknown=0, NotChecked=0, Total=37442 [2022-03-15 19:40:25,173 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 612 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:25,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 50 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 2190 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:40:25,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5904 states. [2022-03-15 19:40:25,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5904 to 1932. [2022-03-15 19:40:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1931 states have (on average 3.1372345934748833) internal successors, (6058), 1931 states have internal predecessors, (6058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 6058 transitions. [2022-03-15 19:40:25,213 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 6058 transitions. Word has length 28 [2022-03-15 19:40:25,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:25,213 INFO L470 AbstractCegarLoop]: Abstraction has 1932 states and 6058 transitions. [2022-03-15 19:40:25,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 38 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:40:25,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 6058 transitions. [2022-03-15 19:40:25,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:40:25,215 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:25,215 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:25,233 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:40:25,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:25,416 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:40:25,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:25,416 INFO L85 PathProgramCache]: Analyzing trace with hash -828421929, now seen corresponding path program 77 times [2022-03-15 19:40:25,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:25,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038934901] [2022-03-15 19:40:25,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:25,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:25,605 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:40:25,605 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:25,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038934901] [2022-03-15 19:40:25,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038934901] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:25,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913290971] [2022-03-15 19:40:25,606 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:40:25,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:25,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:25,607 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:40:25,607 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:40:25,695 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:40:25,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:25,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:40:25,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:25,910 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 23 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:25,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:26,746 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:40:26,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913290971] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:26,747 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:26,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 47 [2022-03-15 19:40:26,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [801156477] [2022-03-15 19:40:26,747 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:26,749 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:26,763 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 156 transitions. [2022-03-15 19:40:26,763 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:27,882 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [312935#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 312931#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 312927#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 312940#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0))), 312932#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 312939#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 312930#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 5 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 312929#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 312928#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 312926#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 312941#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 312943#(or (not (< 6 ~M~0)) (<= 0 ~counter~0)), 312936#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 5 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 312933#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 312934#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0))), 312942#(and (or (not (< 6 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 6 ~M~0)) (<= 0 ~counter~0))), 312938#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 312937#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0)))] [2022-03-15 19:40:27,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 19:40:27,882 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:27,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 19:40:27,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=700, Invalid=3460, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 19:40:27,883 INFO L87 Difference]: Start difference. First operand 1932 states and 6058 transitions. Second operand has 38 states, 38 states have (on average 2.736842105263158) internal successors, (104), 37 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:40:32,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:32,836 INFO L93 Difference]: Finished difference Result 5712 states and 14763 transitions. [2022-03-15 19:40:32,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2022-03-15 19:40:32,836 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.736842105263158) internal successors, (104), 37 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 28 [2022-03-15 19:40:32,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:32,846 INFO L225 Difference]: With dead ends: 5712 [2022-03-15 19:40:32,846 INFO L226 Difference]: Without dead ends: 5696 [2022-03-15 19:40:32,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14573 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=9284, Invalid=31722, Unknown=0, NotChecked=0, Total=41006 [2022-03-15 19:40:32,849 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 463 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 2388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:32,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [463 Valid, 57 Invalid, 2388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:40:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5696 states. [2022-03-15 19:40:32,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5696 to 2316. [2022-03-15 19:40:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2316 states, 2315 states have (on average 3.1576673866090714) internal successors, (7310), 2315 states have internal predecessors, (7310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 7310 transitions. [2022-03-15 19:40:32,903 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 7310 transitions. Word has length 28 [2022-03-15 19:40:32,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:32,904 INFO L470 AbstractCegarLoop]: Abstraction has 2316 states and 7310 transitions. [2022-03-15 19:40:32,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.736842105263158) internal successors, (104), 37 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:40:32,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 7310 transitions. [2022-03-15 19:40:32,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:40:32,907 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:32,907 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:32,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2022-03-15 19:40:33,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:33,108 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:40:33,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:33,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1393598295, now seen corresponding path program 78 times [2022-03-15 19:40:33,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:33,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738474894] [2022-03-15 19:40:33,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:33,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 23 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:33,291 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:33,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738474894] [2022-03-15 19:40:33,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738474894] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:33,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518704166] [2022-03-15 19:40:33,291 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:40:33,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:33,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:33,292 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:40:33,292 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:40:33,385 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 19:40:33,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:33,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:40:33,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:33,585 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:33,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:33,963 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:33,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518704166] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:33,964 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:33,964 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 47 [2022-03-15 19:40:33,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1691626267] [2022-03-15 19:40:33,964 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:33,966 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:33,979 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 152 transitions. [2022-03-15 19:40:33,979 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:34,956 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [323780#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 323789#(or (not (< 6 ~M~0)) (<= 0 ~counter~0)), 323775#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 323774#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0))), 323784#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 323788#(and (or (not (< 6 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 6 ~M~0)) (<= 0 ~counter~0))), 323782#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 323773#(< thread2Thread1of1ForFork1_~i~1 ~M~0), 323778#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 323787#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 323783#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 323781#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 5 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 323776#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 323785#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 323777#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 323786#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0))), 323779#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)))] [2022-03-15 19:40:34,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 19:40:34,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:34,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 19:40:34,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=757, Invalid=3275, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:40:34,957 INFO L87 Difference]: Start difference. First operand 2316 states and 7310 transitions. Second operand has 37 states, 37 states have (on average 2.7027027027027026) internal successors, (100), 36 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:38,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:38,321 INFO L93 Difference]: Finished difference Result 3972 states and 11051 transitions. [2022-03-15 19:40:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-03-15 19:40:38,322 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.7027027027027026) internal successors, (100), 36 states have internal predecessors, (100), 0 states have call successors, (0), 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:40:38,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:38,327 INFO L225 Difference]: With dead ends: 3972 [2022-03-15 19:40:38,327 INFO L226 Difference]: Without dead ends: 3966 [2022-03-15 19:40:38,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8068 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=6062, Invalid=21994, Unknown=0, NotChecked=0, Total=28056 [2022-03-15 19:40:38,329 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 380 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1886 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 2175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:38,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 48 Invalid, 2175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1886 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:40:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2022-03-15 19:40:38,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 2192. [2022-03-15 19:40:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2192 states, 2191 states have (on average 3.1364673664993155) internal successors, (6872), 2191 states have internal predecessors, (6872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 6872 transitions. [2022-03-15 19:40:38,360 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 6872 transitions. Word has length 28 [2022-03-15 19:40:38,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:38,360 INFO L470 AbstractCegarLoop]: Abstraction has 2192 states and 6872 transitions. [2022-03-15 19:40:38,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.7027027027027026) internal successors, (100), 36 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 6872 transitions. [2022-03-15 19:40:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:40:38,363 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:38,363 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:38,381 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:40:38,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2022-03-15 19:40:38,564 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:40:38,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:38,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2108294667, now seen corresponding path program 79 times [2022-03-15 19:40:38,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:38,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436888127] [2022-03-15 19:40:38,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:38,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:38,740 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:40:38,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:38,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436888127] [2022-03-15 19:40:38,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436888127] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:38,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669891616] [2022-03-15 19:40:38,741 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:40:38,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:38,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:38,742 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:40:38,742 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:40:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:38,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:40:38,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:39,065 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:40:39,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:39,760 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:40:39,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669891616] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:39,760 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:39,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 47 [2022-03-15 19:40:39,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1254166957] [2022-03-15 19:40:39,760 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:39,762 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:39,776 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 174 transitions. [2022-03-15 19:40:39,776 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:41,142 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [332574#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 332579#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 332564#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 332565#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 332575#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 332577#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 332580#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 332572#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 332578#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 332566#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 332569#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 332568#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 332563#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 332581#(or (not (< 5 ~M~0)) (<= 0 ~counter~0)), 332567#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 332573#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 332571#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 332570#(and (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 332576#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)))] [2022-03-15 19:40:41,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 19:40:41,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:41,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 19:40:41,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=3673, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 19:40:41,143 INFO L87 Difference]: Start difference. First operand 2192 states and 6872 transitions. Second operand has 38 states, 38 states have (on average 2.9473684210526314) internal successors, (112), 37 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:40:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:44,565 INFO L93 Difference]: Finished difference Result 5156 states and 13910 transitions. [2022-03-15 19:40:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-03-15 19:40:44,565 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.9473684210526314) internal successors, (112), 37 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 28 [2022-03-15 19:40:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:44,572 INFO L225 Difference]: With dead ends: 5156 [2022-03-15 19:40:44,572 INFO L226 Difference]: Without dead ends: 5096 [2022-03-15 19:40:44,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9207 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5677, Invalid=20729, Unknown=0, NotChecked=0, Total=26406 [2022-03-15 19:40:44,574 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 524 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 2283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:44,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [524 Valid, 50 Invalid, 2283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 2096 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:40:44,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5096 states. [2022-03-15 19:40:44,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5096 to 2118. [2022-03-15 19:40:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2118 states, 2117 states have (on average 3.1332073689182804) internal successors, (6633), 2117 states have internal predecessors, (6633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 2118 states and 6633 transitions. [2022-03-15 19:40:44,610 INFO L78 Accepts]: Start accepts. Automaton has 2118 states and 6633 transitions. Word has length 28 [2022-03-15 19:40:44,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:44,611 INFO L470 AbstractCegarLoop]: Abstraction has 2118 states and 6633 transitions. [2022-03-15 19:40:44,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.9473684210526314) internal successors, (112), 37 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:40:44,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 6633 transitions. [2022-03-15 19:40:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:40:44,613 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:44,613 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:44,630 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:40:44,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:44,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:40:44,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:44,814 INFO L85 PathProgramCache]: Analyzing trace with hash -366969537, now seen corresponding path program 80 times [2022-03-15 19:40:44,815 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:44,815 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280265437] [2022-03-15 19:40:44,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:44,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:44,965 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:40:44,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:44,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280265437] [2022-03-15 19:40:44,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280265437] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:44,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047005496] [2022-03-15 19:40:44,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:40:44,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:44,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:44,966 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:40:44,967 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:40:45,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:40:45,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:45,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:40:45,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 23 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:45,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:45,973 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:40:45,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047005496] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:45,974 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:45,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 47 [2022-03-15 19:40:45,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1695344410] [2022-03-15 19:40:45,974 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:45,976 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:45,989 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 165 transitions. [2022-03-15 19:40:45,989 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:47,199 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [342388#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 342390#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 342379#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 342385#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 342381#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 342386#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 342391#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 342378#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 342377#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 342392#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 342389#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 342394#(or (not (< 5 ~M~0)) (<= 0 ~counter~0)), 342382#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 342384#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 342393#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 342380#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 342383#(and (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 342387#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:40:47,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 19:40:47,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:47,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 19:40:47,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=3541, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 19:40:47,200 INFO L87 Difference]: Start difference. First operand 2118 states and 6633 transitions. Second operand has 37 states, 37 states have (on average 2.891891891891892) internal successors, (107), 36 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:40:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:50,886 INFO L93 Difference]: Finished difference Result 4958 states and 13035 transitions. [2022-03-15 19:40:50,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-15 19:40:50,886 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.891891891891892) internal successors, (107), 36 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 28 [2022-03-15 19:40:50,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:50,894 INFO L225 Difference]: With dead ends: 4958 [2022-03-15 19:40:50,894 INFO L226 Difference]: Without dead ends: 4918 [2022-03-15 19:40:50,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9819 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=6203, Invalid=22189, Unknown=0, NotChecked=0, Total=28392 [2022-03-15 19:40:50,897 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 496 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 2063 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 2063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:50,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [496 Valid, 45 Invalid, 2255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 2063 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:40:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4918 states. [2022-03-15 19:40:50,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4918 to 2112. [2022-03-15 19:40:50,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2112 states, 2111 states have (on average 3.119848413074372) internal successors, (6586), 2111 states have internal predecessors, (6586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 6586 transitions. [2022-03-15 19:40:50,940 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 6586 transitions. Word has length 28 [2022-03-15 19:40:50,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:50,940 INFO L470 AbstractCegarLoop]: Abstraction has 2112 states and 6586 transitions. [2022-03-15 19:40:50,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.891891891891892) internal successors, (107), 36 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:40:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 6586 transitions. [2022-03-15 19:40:50,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:40:50,943 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:50,943 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:50,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2022-03-15 19:40:51,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:51,143 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:40:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:51,144 INFO L85 PathProgramCache]: Analyzing trace with hash -726439755, now seen corresponding path program 81 times [2022-03-15 19:40:51,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:51,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44490383] [2022-03-15 19:40:51,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:51,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:51,305 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:40:51,305 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:51,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44490383] [2022-03-15 19:40:51,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44490383] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:51,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707533151] [2022-03-15 19:40:51,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:40:51,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:51,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:51,306 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:40:51,307 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:40:51,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:40:51,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:51,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:40:51,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:51,689 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:40:51,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:52,376 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:40:52,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707533151] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:52,377 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:52,377 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 47 [2022-03-15 19:40:52,377 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1779324234] [2022-03-15 19:40:52,377 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:52,379 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:52,392 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 156 transitions. [2022-03-15 19:40:52,392 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:53,469 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [351998#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 352005#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 352010#(or (not (< 5 ~M~0)) (<= 0 ~counter~0)), 352003#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 352007#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 351999#(and (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 352004#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 351994#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 352000#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 352008#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 351997#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 351995#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 352006#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 351996#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 352002#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 352001#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 352009#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0)))] [2022-03-15 19:40:53,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 19:40:53,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:53,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 19:40:53,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=3434, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:40:53,470 INFO L87 Difference]: Start difference. First operand 2112 states and 6586 transitions. Second operand has 36 states, 36 states have (on average 2.8333333333333335) internal successors, (102), 35 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:40:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:57,241 INFO L93 Difference]: Finished difference Result 5088 states and 13140 transitions. [2022-03-15 19:40:57,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-03-15 19:40:57,241 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.8333333333333335) internal successors, (102), 35 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 28 [2022-03-15 19:40:57,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:57,249 INFO L225 Difference]: With dead ends: 5088 [2022-03-15 19:40:57,249 INFO L226 Difference]: Without dead ends: 5052 [2022-03-15 19:40:57,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8838 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5951, Invalid=21109, Unknown=0, NotChecked=0, Total=27060 [2022-03-15 19:40:57,251 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 455 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 2489 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 2671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 2489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:57,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [455 Valid, 60 Invalid, 2671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 2489 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:40:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5052 states. [2022-03-15 19:40:57,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5052 to 1814. [2022-03-15 19:40:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1813 states have (on average 3.1312741312741315) internal successors, (5677), 1813 states have internal predecessors, (5677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:57,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 5677 transitions. [2022-03-15 19:40:57,286 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 5677 transitions. Word has length 28 [2022-03-15 19:40:57,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:57,286 INFO L470 AbstractCegarLoop]: Abstraction has 1814 states and 5677 transitions. [2022-03-15 19:40:57,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.8333333333333335) internal successors, (102), 35 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:40:57,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 5677 transitions. [2022-03-15 19:40:57,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:40:57,288 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:57,288 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:57,305 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:40:57,489 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,SelfDestructingSolverStorable82 [2022-03-15 19:40:57,489 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:40:57,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:57,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1292224897, now seen corresponding path program 82 times [2022-03-15 19:40:57,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:57,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57365835] [2022-03-15 19:40:57,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:57,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:57,657 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:40:57,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:57,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57365835] [2022-03-15 19:40:57,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57365835] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:57,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671937930] [2022-03-15 19:40:57,657 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:40:57,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:57,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:57,659 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:40:57,659 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:40:57,747 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:40:57,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:57,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 19:40:57,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:58,172 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:40:58,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:58,686 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:40:58,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671937930] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:58,687 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:58,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 45 [2022-03-15 19:40:58,687 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1126040037] [2022-03-15 19:40:58,687 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:58,689 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:58,702 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 147 transitions. [2022-03-15 19:40:58,702 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:59,593 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [361139#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 361151#(or (not (< 5 ~M~0)) (<= 0 ~counter~0)), 361150#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 361136#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 361138#(and (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 361143#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 361142#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 361148#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 361147#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 361144#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 361145#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 361146#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 361149#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 361140#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 361137#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 361141#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)))] [2022-03-15 19:40:59,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 19:40:59,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:59,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 19:40:59,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=3170, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:40:59,594 INFO L87 Difference]: Start difference. First operand 1814 states and 5677 transitions. Second operand has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 34 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:41:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:04,193 INFO L93 Difference]: Finished difference Result 4996 states and 12514 transitions. [2022-03-15 19:41:04,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2022-03-15 19:41:04,193 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 34 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 28 [2022-03-15 19:41:04,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:04,201 INFO L225 Difference]: With dead ends: 4996 [2022-03-15 19:41:04,202 INFO L226 Difference]: Without dead ends: 4984 [2022-03-15 19:41:04,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14848 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7851, Invalid=31949, Unknown=0, NotChecked=0, Total=39800 [2022-03-15 19:41:04,219 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 554 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 2328 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 2328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:04,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [554 Valid, 45 Invalid, 2564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 2328 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:41:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2022-03-15 19:41:04,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 1986. [2022-03-15 19:41:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1985 states have (on average 3.1642317380352645) internal successors, (6281), 1985 states have internal predecessors, (6281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:04,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 6281 transitions. [2022-03-15 19:41:04,258 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 6281 transitions. Word has length 28 [2022-03-15 19:41:04,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:04,258 INFO L470 AbstractCegarLoop]: Abstraction has 1986 states and 6281 transitions. [2022-03-15 19:41:04,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 34 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:41:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 6281 transitions. [2022-03-15 19:41:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:41:04,261 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:04,261 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:04,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2022-03-15 19:41:04,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:04,462 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:41:04,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:04,462 INFO L85 PathProgramCache]: Analyzing trace with hash -146493801, now seen corresponding path program 83 times [2022-03-15 19:41:04,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:04,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020175294] [2022-03-15 19:41:04,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:04,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:04,621 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:41:04,622 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:04,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020175294] [2022-03-15 19:41:04,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020175294] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:04,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292796127] [2022-03-15 19:41:04,622 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:41:04,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:04,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:04,623 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:41:04,624 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:41:04,723 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:41:04,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:04,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:41:04,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:04,983 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:41:04,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:05,564 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:41:05,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292796127] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:05,564 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:05,564 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 47 [2022-03-15 19:41:05,565 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2054554801] [2022-03-15 19:41:05,565 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:05,567 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:05,583 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 165 transitions. [2022-03-15 19:41:05,583 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:06,956 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [370609#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 370623#(or (<= 0 ~counter~0) (not (< 4 ~M~0))), 370607#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 370613#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 370620#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 370616#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 370610#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0))), 370611#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 370608#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 370615#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 370614#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 370618#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 370619#(and (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 370621#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0))), 370617#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 370622#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (not (< 4 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 370612#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:41:06,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 19:41:06,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:06,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 19:41:06,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=586, Invalid=3446, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:41:06,957 INFO L87 Difference]: Start difference. First operand 1986 states and 6281 transitions. Second operand has 35 states, 35 states have (on average 3.0) internal successors, (105), 34 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:41:09,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:09,475 INFO L93 Difference]: Finished difference Result 4340 states and 11896 transitions. [2022-03-15 19:41:09,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-03-15 19:41:09,476 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.0) internal successors, (105), 34 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 28 [2022-03-15 19:41:09,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:09,485 INFO L225 Difference]: With dead ends: 4340 [2022-03-15 19:41:09,485 INFO L226 Difference]: Without dead ends: 4296 [2022-03-15 19:41:09,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5639 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3309, Invalid=13461, Unknown=0, NotChecked=0, Total=16770 [2022-03-15 19:41:09,487 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 353 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:09,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 43 Invalid, 1912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:41:09,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2022-03-15 19:41:09,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 1968. [2022-03-15 19:41:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1967 states have (on average 3.1621759023894254) internal successors, (6220), 1967 states have internal predecessors, (6220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 6220 transitions. [2022-03-15 19:41:09,524 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 6220 transitions. Word has length 28 [2022-03-15 19:41:09,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:09,524 INFO L470 AbstractCegarLoop]: Abstraction has 1968 states and 6220 transitions. [2022-03-15 19:41:09,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.0) internal successors, (105), 34 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:41:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 6220 transitions. [2022-03-15 19:41:09,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:41:09,526 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:09,526 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:09,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Ended with exit code 0 [2022-03-15 19:41:09,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:09,727 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:41:09,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:09,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1783228969, now seen corresponding path program 84 times [2022-03-15 19:41:09,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:09,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211795359] [2022-03-15 19:41:09,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:09,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:09,890 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:41:09,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:09,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211795359] [2022-03-15 19:41:09,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211795359] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:09,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2535059] [2022-03-15 19:41:09,891 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:41:09,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:09,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:09,893 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:41:09,894 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:41:09,994 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 19:41:09,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:09,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:41:09,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:10,308 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:41:10,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:10,890 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:41:10,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2535059] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:10,891 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:10,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 47 [2022-03-15 19:41:10,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [365779657] [2022-03-15 19:41:10,891 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:10,893 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:10,906 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 156 transitions. [2022-03-15 19:41:10,906 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:12,032 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [379252#(and (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 379251#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 379241#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 379247#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0))), 379253#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 379245#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 379244#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 379256#(or (<= 0 ~counter~0) (not (< 4 ~M~0))), 379242#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 379254#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0))), 379250#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 379243#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 379246#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 379248#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 379249#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 379255#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (not (< 4 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:41:12,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:41:12,032 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:12,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:41:12,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=527, Invalid=3379, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 19:41:12,033 INFO L87 Difference]: Start difference. First operand 1968 states and 6220 transitions. Second operand has 34 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 33 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:14,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:14,782 INFO L93 Difference]: Finished difference Result 4346 states and 11715 transitions. [2022-03-15 19:41:14,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-03-15 19:41:14,783 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 33 states have internal predecessors, (100), 0 states have call successors, (0), 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:41:14,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:14,789 INFO L225 Difference]: With dead ends: 4346 [2022-03-15 19:41:14,790 INFO L226 Difference]: Without dead ends: 4282 [2022-03-15 19:41:14,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5933 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3686, Invalid=14674, Unknown=0, NotChecked=0, Total=18360 [2022-03-15 19:41:14,791 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 281 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 2168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:14,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 48 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 2168 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:41:14,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2022-03-15 19:41:14,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 1926. [2022-03-15 19:41:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1925 states have (on average 3.1714285714285713) internal successors, (6105), 1925 states have internal predecessors, (6105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 6105 transitions. [2022-03-15 19:41:14,828 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 6105 transitions. Word has length 28 [2022-03-15 19:41:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:14,828 INFO L470 AbstractCegarLoop]: Abstraction has 1926 states and 6105 transitions. [2022-03-15 19:41:14,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 33 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 6105 transitions. [2022-03-15 19:41:14,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:41:14,830 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:14,831 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:14,847 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:41:15,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:15,031 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:41:15,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:15,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1143290217, now seen corresponding path program 85 times [2022-03-15 19:41:15,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:15,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457990662] [2022-03-15 19:41:15,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:15,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:15,173 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:41:15,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:15,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457990662] [2022-03-15 19:41:15,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457990662] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:15,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53909568] [2022-03-15 19:41:15,173 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:41:15,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:15,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:15,174 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:41:15,175 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:41:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:15,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:41:15,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:15,499 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:15,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:16,238 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:41:16,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53909568] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:16,238 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:16,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 47 [2022-03-15 19:41:16,238 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1853171190] [2022-03-15 19:41:16,238 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:16,240 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:16,253 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 147 transitions. [2022-03-15 19:41:16,253 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:17,250 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [387819#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 387822#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0))), 387816#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 387814#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 387818#(and (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 387815#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 387817#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 387811#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0))), 387820#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 387813#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 387812#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 387824#(or (<= 0 ~counter~0) (not (< 4 ~M~0))), 387821#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 387823#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (not (< 4 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 387810#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))))] [2022-03-15 19:41:17,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:41:17,251 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:17,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:41:17,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=596, Invalid=3186, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:41:17,252 INFO L87 Difference]: Start difference. First operand 1926 states and 6105 transitions. Second operand has 33 states, 33 states have (on average 2.878787878787879) internal successors, (95), 32 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:41:20,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:20,926 INFO L93 Difference]: Finished difference Result 4972 states and 12998 transitions. [2022-03-15 19:41:20,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-03-15 19:41:20,926 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.878787878787879) internal successors, (95), 32 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 28 [2022-03-15 19:41:20,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:20,933 INFO L225 Difference]: With dead ends: 4972 [2022-03-15 19:41:20,933 INFO L226 Difference]: Without dead ends: 4948 [2022-03-15 19:41:20,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10128 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5934, Invalid=22796, Unknown=0, NotChecked=0, Total=28730 [2022-03-15 19:41:20,935 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 423 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 1820 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:20,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 36 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1820 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:41:20,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4948 states. [2022-03-15 19:41:20,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4948 to 1800. [2022-03-15 19:41:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1799 states have (on average 3.2062256809338523) internal successors, (5768), 1799 states have internal predecessors, (5768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 5768 transitions. [2022-03-15 19:41:20,971 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 5768 transitions. Word has length 28 [2022-03-15 19:41:20,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:20,971 INFO L470 AbstractCegarLoop]: Abstraction has 1800 states and 5768 transitions. [2022-03-15 19:41:20,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.878787878787879) internal successors, (95), 32 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:41:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 5768 transitions. [2022-03-15 19:41:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:41:20,973 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:20,973 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:20,991 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:41:21,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:21,174 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:41:21,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:21,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1594045955, now seen corresponding path program 86 times [2022-03-15 19:41:21,174 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:21,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071778760] [2022-03-15 19:41:21,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:21,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:21,263 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:21,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071778760] [2022-03-15 19:41:21,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071778760] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:21,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860826934] [2022-03-15 19:41:21,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:41:21,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:21,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:21,265 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:41:21,265 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:41:21,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:41:21,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:21,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 19:41:21,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:21,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:22,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860826934] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:22,080 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:22,080 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 17] total 25 [2022-03-15 19:41:22,080 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [138328286] [2022-03-15 19:41:22,081 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:22,083 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:22,119 INFO L252 McrAutomatonBuilder]: Finished intersection with 128 states and 244 transitions. [2022-03-15 19:41:22,119 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:23,323 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:41:23,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:41:23,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:23,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:41:23,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:41:23,323 INFO L87 Difference]: Start difference. First operand 1800 states and 5768 transitions. Second operand has 11 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:23,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:23,624 INFO L93 Difference]: Finished difference Result 2631 states and 8271 transitions. [2022-03-15 19:41:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:41:23,624 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:41:23,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:23,630 INFO L225 Difference]: With dead ends: 2631 [2022-03-15 19:41:23,630 INFO L226 Difference]: Without dead ends: 2584 [2022-03-15 19:41:23,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 140 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:41:23,630 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:23,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 90 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:41:23,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2584 states. [2022-03-15 19:41:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2584 to 2364. [2022-03-15 19:41:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2364 states, 2363 states have (on average 3.270842149809564) internal successors, (7729), 2363 states have internal predecessors, (7729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:23,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 7729 transitions. [2022-03-15 19:41:23,661 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 7729 transitions. Word has length 29 [2022-03-15 19:41:23,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:23,661 INFO L470 AbstractCegarLoop]: Abstraction has 2364 states and 7729 transitions. [2022-03-15 19:41:23,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 7729 transitions. [2022-03-15 19:41:23,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:41:23,664 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:23,664 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:23,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2022-03-15 19:41:23,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:23,865 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:41:23,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:23,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1224478821, now seen corresponding path program 87 times [2022-03-15 19:41:23,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:23,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597068199] [2022-03-15 19:41:23,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:23,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:24,109 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:24,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597068199] [2022-03-15 19:41:24,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597068199] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:24,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161771179] [2022-03-15 19:41:24,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:41:24,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:24,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:24,111 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:41:24,111 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:41:24,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 19:41:24,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:24,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 19:41:24,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 14 proven. 57 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:41:24,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:41:24,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161771179] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:24,703 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:24,703 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 36 [2022-03-15 19:41:24,703 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [12298352] [2022-03-15 19:41:24,703 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:24,705 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:24,719 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 155 transitions. [2022-03-15 19:41:24,719 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:26,042 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [404378#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 3) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 404380#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 1) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 404374#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 5) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 404387#(and (or (not (< 6 ~M~0)) (<= ~counter~0 0)) (or (not (< 6 ~M~0)) (<= 0 ~counter~0))), 404385#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 1) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 404375#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 4) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 404379#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= ~counter~0 2)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 404373#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (<= ~counter~0 6) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 404382#(and (or (not (< 6 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 6 ~M~0)) (<= ~counter~0 0)) (or (not (< 6 ~M~0)) (<= 0 ~counter~0))), 404383#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (<= ~counter~0 3) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 404372#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= ~counter~0 6) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 404384#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= ~counter~0 2)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 404261#(< thread2Thread1of1ForFork1_~i~1 ~M~0), 404377#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 4) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 404381#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 404386#(and (or (<= ~counter~0 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 404376#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 5) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 5 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))))] [2022-03-15 19:41:26,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 19:41:26,042 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:26,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 19:41:26,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=2464, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:41:26,043 INFO L87 Difference]: Start difference. First operand 2364 states and 7729 transitions. Second operand has 38 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 37 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:41:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:30,718 INFO L93 Difference]: Finished difference Result 4158 states and 12140 transitions. [2022-03-15 19:41:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-03-15 19:41:30,719 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 37 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 29 [2022-03-15 19:41:30,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:30,725 INFO L225 Difference]: With dead ends: 4158 [2022-03-15 19:41:30,725 INFO L226 Difference]: Without dead ends: 4152 [2022-03-15 19:41:30,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5611 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2776, Invalid=21404, Unknown=0, NotChecked=0, Total=24180 [2022-03-15 19:41:30,726 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 368 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 5134 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 5435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 5134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:30,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 135 Invalid, 5435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 5134 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 19:41:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4152 states. [2022-03-15 19:41:30,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4152 to 2338. [2022-03-15 19:41:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2338 states, 2337 states have (on average 3.264013692768507) internal successors, (7628), 2337 states have internal predecessors, (7628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 7628 transitions. [2022-03-15 19:41:30,766 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 7628 transitions. Word has length 29 [2022-03-15 19:41:30,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:30,766 INFO L470 AbstractCegarLoop]: Abstraction has 2338 states and 7628 transitions. [2022-03-15 19:41:30,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 37 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:41:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 7628 transitions. [2022-03-15 19:41:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:41:30,769 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:30,769 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:30,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2022-03-15 19:41:30,970 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,SelfDestructingSolverStorable88 [2022-03-15 19:41:30,970 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:41:30,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:30,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1971056377, now seen corresponding path program 88 times [2022-03-15 19:41:30,971 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:30,971 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20124045] [2022-03-15 19:41:30,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:30,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 1 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:31,180 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:31,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20124045] [2022-03-15 19:41:31,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20124045] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:31,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944051097] [2022-03-15 19:41:31,180 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:41:31,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:31,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:31,181 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:41:31,181 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:41:31,277 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:41:31,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:31,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 19:41:31,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 1 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:31,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:33,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944051097] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:33,804 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:33,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 50 [2022-03-15 19:41:33,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1966019481] [2022-03-15 19:41:33,804 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:33,806 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:33,820 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 150 transitions. [2022-03-15 19:41:33,820 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:35,112 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [413652#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 0)) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 413659#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 413649#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= ~counter~0 3) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 413662#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 413658#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= ~counter~0 1)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 413655#(and (or (<= ~counter~0 4) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 413650#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 2)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 413656#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (<= ~counter~0 3) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 413654#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 5)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 413660#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (<= ~counter~0 0))), 413647#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 5)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 413657#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 2)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 413653#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 5 ~M~0)) (<= ~counter~0 0))), 413648#(and (or (<= ~counter~0 4) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 413661#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 413651#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= ~counter~0 1)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)))] [2022-03-15 19:41:35,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 19:41:35,112 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:35,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 19:41:35,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=3882, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 19:41:35,113 INFO L87 Difference]: Start difference. First operand 2338 states and 7628 transitions. Second operand has 37 states, 37 states have (on average 2.7027027027027026) internal successors, (100), 36 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:41,888 INFO L93 Difference]: Finished difference Result 4522 states and 12538 transitions. [2022-03-15 19:41:41,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-03-15 19:41:41,889 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.7027027027027026) internal successors, (100), 36 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:41:41,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:41,896 INFO L225 Difference]: With dead ends: 4522 [2022-03-15 19:41:41,896 INFO L226 Difference]: Without dead ends: 4506 [2022-03-15 19:41:41,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8310 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=4042, Invalid=26408, Unknown=0, NotChecked=0, Total=30450 [2022-03-15 19:41:41,898 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 370 mSDsluCounter, 2469 mSDsCounter, 0 mSdLazyCounter, 5274 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 5584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 5274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:41,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 97 Invalid, 5584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 5274 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 19:41:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4506 states. [2022-03-15 19:41:41,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4506 to 2336. [2022-03-15 19:41:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 2335 states have (on average 3.263811563169165) internal successors, (7621), 2335 states have internal predecessors, (7621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 7621 transitions. [2022-03-15 19:41:41,934 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 7621 transitions. Word has length 29 [2022-03-15 19:41:41,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:41,934 INFO L470 AbstractCegarLoop]: Abstraction has 2336 states and 7621 transitions. [2022-03-15 19:41:41,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.7027027027027026) internal successors, (100), 36 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 7621 transitions. [2022-03-15 19:41:41,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:41:41,937 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:41,937 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:41,953 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:41:42,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2022-03-15 19:41:42,137 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:41:42,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:42,138 INFO L85 PathProgramCache]: Analyzing trace with hash -443324699, now seen corresponding path program 89 times [2022-03-15 19:41:42,138 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:42,138 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468506574] [2022-03-15 19:41:42,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:42,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:42,354 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:42,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:42,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468506574] [2022-03-15 19:41:42,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468506574] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:42,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377993611] [2022-03-15 19:41:42,355 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:41:42,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:42,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:42,356 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:41:42,356 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:41:42,454 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-03-15 19:41:42,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:42,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 19:41:42,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:42,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 13 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:44,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377993611] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:44,307 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:44,307 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 48 [2022-03-15 19:41:44,307 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1240517287] [2022-03-15 19:41:44,308 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:44,310 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:44,323 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 150 transitions. [2022-03-15 19:41:44,323 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:45,563 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [423300#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= ~counter~0 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 423297#(or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)), 423291#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 423293#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 3) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 423302#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 1) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 423294#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 4)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 423301#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (<= ~counter~0 0) (not (< 4 ~M~0))) (or (not (< 4 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 423290#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 423304#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (<= ~counter~0 0) (not (< 4 ~M~0)))), 423295#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 3) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 423296#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 2))), 423303#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= ~counter~0 0))), 423299#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 1) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 423298#(and (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 2))), 423292#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 4)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))))] [2022-03-15 19:41:45,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 19:41:45,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:45,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 19:41:45,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=3567, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:41:45,564 INFO L87 Difference]: Start difference. First operand 2336 states and 7621 transitions. Second operand has 36 states, 36 states have (on average 2.75) internal successors, (99), 35 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:41:50,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:50,813 INFO L93 Difference]: Finished difference Result 4704 states and 12902 transitions. [2022-03-15 19:41:50,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-03-15 19:41:50,813 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 35 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 29 [2022-03-15 19:41:50,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:50,820 INFO L225 Difference]: With dead ends: 4704 [2022-03-15 19:41:50,820 INFO L226 Difference]: Without dead ends: 4680 [2022-03-15 19:41:50,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7242 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3301, Invalid=21821, Unknown=0, NotChecked=0, Total=25122 [2022-03-15 19:41:50,822 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 310 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 3715 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 3715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:50,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 72 Invalid, 3971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 3715 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:41:50,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2022-03-15 19:41:50,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 2426. [2022-03-15 19:41:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2426 states, 2425 states have (on average 3.2437113402061857) internal successors, (7866), 2425 states have internal predecessors, (7866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 7866 transitions. [2022-03-15 19:41:50,862 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 7866 transitions. Word has length 29 [2022-03-15 19:41:50,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:50,862 INFO L470 AbstractCegarLoop]: Abstraction has 2426 states and 7866 transitions. [2022-03-15 19:41:50,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 35 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:41:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 7866 transitions. [2022-03-15 19:41:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:41:50,865 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:50,865 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:50,881 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:41:51,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:51,066 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:41:51,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:51,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2050368391, now seen corresponding path program 90 times [2022-03-15 19:41:51,067 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:51,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411466217] [2022-03-15 19:41:51,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:51,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:51,278 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:51,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411466217] [2022-03-15 19:41:51,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411466217] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:51,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639473492] [2022-03-15 19:41:51,278 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:41:51,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:51,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:51,279 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:41:51,280 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:41:51,382 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 19:41:51,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:51,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:41:51,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:51,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:52,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639473492] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:52,899 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:52,899 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 52 [2022-03-15 19:41:52,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [637501522] [2022-03-15 19:41:52,899 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:52,901 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:52,915 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 150 transitions. [2022-03-15 19:41:52,915 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:54,285 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [433280#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (<= ~counter~0 0)) (or (not (< 3 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 433276#(and (or (<= ~counter~0 3) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 433272#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 433285#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (<= ~counter~0 0))), 433282#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= ~counter~0 2)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 433279#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 433278#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)) (or (<= ~counter~0 1) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 433275#(or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)), 433274#(and (or (<= ~counter~0 0) (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 433284#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 433273#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 433283#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 1) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 433281#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (<= ~counter~0 3) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 433277#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= ~counter~0 2)) (or (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))))] [2022-03-15 19:41:54,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 19:41:54,286 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:54,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 19:41:54,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=3910, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 19:41:54,286 INFO L87 Difference]: Start difference. First operand 2426 states and 7866 transitions. Second operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 34 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:41:58,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:58,140 INFO L93 Difference]: Finished difference Result 5172 states and 13744 transitions. [2022-03-15 19:41:58,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-03-15 19:41:58,140 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 34 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 29 [2022-03-15 19:41:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:58,147 INFO L225 Difference]: With dead ends: 5172 [2022-03-15 19:41:58,147 INFO L226 Difference]: Without dead ends: 5112 [2022-03-15 19:41:58,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6025 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2607, Invalid=17133, Unknown=0, NotChecked=0, Total=19740 [2022-03-15 19:41:58,149 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 261 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 2419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 2232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:58,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 67 Invalid, 2419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 2232 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:41:58,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5112 states. [2022-03-15 19:41:58,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5112 to 2258. [2022-03-15 19:41:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2258 states, 2257 states have (on average 3.282233052724856) internal successors, (7408), 2257 states have internal predecessors, (7408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 7408 transitions. [2022-03-15 19:41:58,186 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 7408 transitions. Word has length 29 [2022-03-15 19:41:58,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:58,186 INFO L470 AbstractCegarLoop]: Abstraction has 2258 states and 7408 transitions. [2022-03-15 19:41:58,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 34 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:41:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 7408 transitions. [2022-03-15 19:41:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:41:58,189 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:58,189 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:58,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2022-03-15 19:41:58,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:58,389 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:41:58,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:58,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1288199707, now seen corresponding path program 91 times [2022-03-15 19:41:58,390 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:58,390 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385941873] [2022-03-15 19:41:58,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:58,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:58,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:58,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385941873] [2022-03-15 19:41:58,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385941873] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:58,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629627983] [2022-03-15 19:41:58,600 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:41:58,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:58,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:58,601 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:41:58,602 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:41:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:58,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:41:58,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:59,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:42:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 13 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:00,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629627983] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:42:00,016 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:42:00,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 54 [2022-03-15 19:42:00,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [563881184] [2022-03-15 19:42:00,016 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:42:00,018 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:42:00,031 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 150 transitions. [2022-03-15 19:42:00,032 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:42:01,300 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [443353#(and (or (<= ~counter~0 0) (not (< 2 ~M~0))) (or (<= 0 ~counter~0) (not (< 2 ~M~0))) (or (not (< 2 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 443347#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 443346#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 443348#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 443356#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 0))), 443345#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 443357#(and (or (<= ~counter~0 0) (not (< 2 ~M~0))) (or (<= 0 ~counter~0) (not (< 2 ~M~0)))), 443352#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 0))), 443354#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 2)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 443350#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 443351#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 1) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 443355#(and (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 1) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 443349#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 2)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))))] [2022-03-15 19:42:01,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:42:01,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:42:01,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:42:01,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=4024, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 19:42:01,301 INFO L87 Difference]: Start difference. First operand 2258 states and 7408 transitions. Second operand has 34 states, 34 states have (on average 2.8529411764705883) 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:42:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:42:03,607 INFO L93 Difference]: Finished difference Result 4236 states and 12150 transitions. [2022-03-15 19:42:03,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-15 19:42:03,608 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.8529411764705883) 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 29 [2022-03-15 19:42:03,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:42:03,614 INFO L225 Difference]: With dead ends: 4236 [2022-03-15 19:42:03,615 INFO L226 Difference]: Without dead ends: 4212 [2022-03-15 19:42:03,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4496 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1758, Invalid=12522, Unknown=0, NotChecked=0, Total=14280 [2022-03-15 19:42:03,616 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 199 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:42:03,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 44 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:42:03,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4212 states. [2022-03-15 19:42:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4212 to 2264. [2022-03-15 19:42:03,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2264 states, 2263 states have (on average 3.280159080866107) internal successors, (7423), 2263 states have internal predecessors, (7423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 7423 transitions. [2022-03-15 19:42:03,652 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 7423 transitions. Word has length 29 [2022-03-15 19:42:03,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:42:03,652 INFO L470 AbstractCegarLoop]: Abstraction has 2264 states and 7423 transitions. [2022-03-15 19:42:03,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.8529411764705883) 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:42:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 7423 transitions. [2022-03-15 19:42:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:42:03,655 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:42:03,655 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:42:03,672 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:42:03,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:03,855 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:42:03,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:42:03,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1289492985, now seen corresponding path program 92 times [2022-03-15 19:42:03,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:42:03,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216042913] [2022-03-15 19:42:03,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:42:03,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:42:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:42:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:04,048 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:42:04,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216042913] [2022-03-15 19:42:04,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216042913] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:42:04,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769625666] [2022-03-15 19:42:04,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:42:04,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:04,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:42:04,050 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:42:04,050 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:42:04,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:42:04,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:42:04,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 19:42:04,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:42:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:04,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:42:05,396 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:05,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769625666] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:42:05,396 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:42:05,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 53 [2022-03-15 19:42:05,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1029166170] [2022-03-15 19:42:05,396 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:42:05,398 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:42:05,411 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 150 transitions. [2022-03-15 19:42:05,412 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:42:06,667 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [452452#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 452451#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 452448#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 452454#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 1 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 1)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 452453#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 452455#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 1 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 1)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 452450#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 452449#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 452456#(and (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 452458#(and (or (not (< 1 ~M~0)) (<= ~counter~0 0)) (or (not (< 1 ~M~0)) (<= 0 ~counter~0)) (or (not (< 1 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 452457#(and (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 452459#(and (or (not (< 1 ~M~0)) (<= ~counter~0 0)) (or (not (< 1 ~M~0)) (<= 0 ~counter~0)))] [2022-03-15 19:42:06,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:42:06,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:42:06,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:42:06,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=3750, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 19:42:06,668 INFO L87 Difference]: Start difference. First operand 2264 states and 7423 transitions. Second operand has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:42:08,128 INFO L93 Difference]: Finished difference Result 3896 states and 11596 transitions. [2022-03-15 19:42:08,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 19:42:08,128 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:42:08,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:42:08,134 INFO L225 Difference]: With dead ends: 3896 [2022-03-15 19:42:08,134 INFO L226 Difference]: Without dead ends: 3836 [2022-03-15 19:42:08,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3827 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1409, Invalid=9097, Unknown=0, NotChecked=0, Total=10506 [2022-03-15 19:42:08,135 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 172 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:42:08,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 37 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:42:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3836 states. [2022-03-15 19:42:08,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3836 to 2268. [2022-03-15 19:42:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2268 states, 2267 states have (on average 3.278782531980591) internal successors, (7433), 2267 states have internal predecessors, (7433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 7433 transitions. [2022-03-15 19:42:08,168 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 7433 transitions. Word has length 29 [2022-03-15 19:42:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:42:08,168 INFO L470 AbstractCegarLoop]: Abstraction has 2268 states and 7433 transitions. [2022-03-15 19:42:08,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 7433 transitions. [2022-03-15 19:42:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:42:08,170 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:42:08,170 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:42:08,187 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:42:08,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:08,371 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:42:08,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:42:08,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1847890715, now seen corresponding path program 93 times [2022-03-15 19:42:08,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:42:08,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118168121] [2022-03-15 19:42:08,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:42:08,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:42:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:42:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 21 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:08,558 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:42:08,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118168121] [2022-03-15 19:42:08,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118168121] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:42:08,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913229389] [2022-03-15 19:42:08,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:42:08,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:08,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:42:08,560 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:42:08,560 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:42:08,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:42:08,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:42:08,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:42:08,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:42:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 21 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:09,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:42:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 21 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:09,795 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913229389] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:42:09,795 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:42:09,795 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 55 [2022-03-15 19:42:09,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [315797401] [2022-03-15 19:42:09,795 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:42:09,797 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:42:09,811 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 150 transitions. [2022-03-15 19:42:09,811 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:42:11,088 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [461197#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 461200#(and (or (not (< 0 ~M~0)) (<= ~counter~0 0)) (or (not (< 0 ~M~0)) (<= 0 ~counter~0))), 461192#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 461191#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 461194#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 461190#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 461195#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 461196#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 461198#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 461199#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 0))), 461193#(and (or (not (< 0 ~M~0)) (<= ~counter~0 0)) (or (not (< 0 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 0 ~M~0)) (<= 0 ~counter~0)))] [2022-03-15 19:42:11,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 19:42:11,088 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:42:11,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 19:42:11,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=3877, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 19:42:11,089 INFO L87 Difference]: Start difference. First operand 2268 states and 7433 transitions. Second operand has 32 states, 32 states have (on average 2.96875) internal successors, (95), 31 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:42:12,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:42:12,222 INFO L93 Difference]: Finished difference Result 4042 states and 12379 transitions. [2022-03-15 19:42:12,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 19:42:12,222 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.96875) internal successors, (95), 31 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 29 [2022-03-15 19:42:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:42:12,230 INFO L225 Difference]: With dead ends: 4042 [2022-03-15 19:42:12,230 INFO L226 Difference]: Without dead ends: 3958 [2022-03-15 19:42:12,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1436, Invalid=8464, Unknown=0, NotChecked=0, Total=9900 [2022-03-15 19:42:12,231 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 162 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:42:12,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 22 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:42:12,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3958 states. [2022-03-15 19:42:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3958 to 2830. [2022-03-15 19:42:12,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2830 states, 2829 states have (on average 3.2633439377872038) internal successors, (9232), 2829 states have internal predecessors, (9232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 9232 transitions. [2022-03-15 19:42:12,269 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 9232 transitions. Word has length 29 [2022-03-15 19:42:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:42:12,269 INFO L470 AbstractCegarLoop]: Abstraction has 2830 states and 9232 transitions. [2022-03-15 19:42:12,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.96875) internal successors, (95), 31 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:42:12,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 9232 transitions. [2022-03-15 19:42:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:42:12,272 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:42:12,272 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:42:12,290 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:42:12,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:12,473 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:42:12,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:42:12,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1420893890, now seen corresponding path program 94 times [2022-03-15 19:42:12,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:42:12,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953501199] [2022-03-15 19:42:12,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:42:12,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:42:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:42:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:12,662 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:42:12,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953501199] [2022-03-15 19:42:12,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953501199] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:42:12,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122042878] [2022-03-15 19:42:12,662 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:42:12,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:12,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:42:12,663 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:42:12,663 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:42:12,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:42:12,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:42:12,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 19:42:12,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:42:13,261 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:13,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:42:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:13,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122042878] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:42:13,703 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:42:13,703 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 50 [2022-03-15 19:42:13,703 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1328414475] [2022-03-15 19:42:13,703 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:42:13,706 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:42:13,730 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 256 transitions. [2022-03-15 19:42:13,730 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:42:16,322 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [471207#(and (or (<= 9 ~M~0) (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0))) (or (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)) (<= 3 ~counter~0))), 471209#(and (or (<= ~M~0 (+ 7 thread1Thread1of1ForFork0_~i~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 9 ~M~0) (<= ~M~0 (+ 7 thread1Thread1of1ForFork0_~i~0))) (or (<= ~M~0 (+ 7 thread1Thread1of1ForFork0_~i~0)) (<= 1 ~counter~0))), 471201#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 8 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ thread2Thread1of1ForFork1_~i~1 8) ~M~0))), 471213#(and (or (<= 7 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))) (or (<= 9 ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)))), 471206#(and (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)) (<= 4 ~counter~0)) (or (<= 9 ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)))), 471218#(and (or (<= 2 ~counter~0) (<= ~M~0 (+ 6 thread1Thread1of1ForFork0_~i~0))) (or (<= ~M~0 (+ 6 thread1Thread1of1ForFork0_~i~0)) (<= 9 ~M~0))), 471198#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 471221#(or (<= 0 ~counter~0) (<= ~M~0 8)), 471205#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0))) (or (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)) (<= 5 ~counter~0)) (or (<= 9 ~M~0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)))), 471212#(and (or (<= 9 ~M~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)) (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 8 ~counter~0))), 471210#(and (or (<= 9 ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 8))) (or (= thread2Thread1of1ForFork1_~i~1 0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 8))) (or (<= 0 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 8)))), 471217#(and (or (<= 9 ~M~0) (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0))) (or (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)) (<= 3 ~counter~0))), 471195#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 471203#(and (or (<= 7 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))) (or (<= 9 ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))) (or (= thread2Thread1of1ForFork1_~i~1 0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)))), 471200#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 7 ~counter~0))), 471214#(and (or (<= 6 ~counter~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= 9 ~M~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0)))), 471196#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 471220#(and (or (<= 9 ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 8))) (or (<= 0 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 8)))), 471211#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (<= ~M~0 8)) (or (<= 0 ~counter~0) (<= ~M~0 8))), 471199#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 471215#(and (or (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)) (<= 5 ~counter~0)) (or (<= 9 ~M~0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)))), 471216#(and (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)) (<= 4 ~counter~0)) (or (<= 9 ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)))), 471208#(and (or (<= ~M~0 (+ 6 thread1Thread1of1ForFork0_~i~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 2 ~counter~0) (<= ~M~0 (+ 6 thread1Thread1of1ForFork0_~i~0))) (or (<= ~M~0 (+ 6 thread1Thread1of1ForFork0_~i~0)) (<= 9 ~M~0))), 471202#(and (or (<= 9 ~M~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)) (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 8 ~counter~0))), 471197#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 471219#(and (or (<= 9 ~M~0) (<= ~M~0 (+ 7 thread1Thread1of1ForFork0_~i~0))) (or (<= ~M~0 (+ 7 thread1Thread1of1ForFork0_~i~0)) (<= 1 ~counter~0))), 471204#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= 6 ~counter~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= 9 ~M~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0)))), 471194#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 471193#(< thread1Thread1of1ForFork0_~i~0 ~M~0)] [2022-03-15 19:42:16,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 19:42:16,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:42:16,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 19:42:16,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=772, Invalid=5390, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 19:42:16,323 INFO L87 Difference]: Start difference. First operand 2830 states and 9232 transitions. Second operand has 51 states, 51 states have (on average 3.0980392156862746) internal successors, (158), 50 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:24,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:42:24,408 INFO L93 Difference]: Finished difference Result 7844 states and 22278 transitions. [2022-03-15 19:42:24,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2022-03-15 19:42:24,408 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.0980392156862746) internal successors, (158), 50 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:42:24,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:42:24,420 INFO L225 Difference]: With dead ends: 7844 [2022-03-15 19:42:24,420 INFO L226 Difference]: Without dead ends: 7844 [2022-03-15 19:42:24,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 98 SyntacticMatches, 7 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30329 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=18951, Invalid=61989, Unknown=0, NotChecked=0, Total=80940 [2022-03-15 19:42:24,423 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 623 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 4011 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 4273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 4011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:42:24,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [623 Valid, 61 Invalid, 4273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 4011 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:42:24,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7844 states. [2022-03-15 19:42:24,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7844 to 2986. [2022-03-15 19:42:24,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2986 states, 2985 states have (on average 3.2733668341708544) internal successors, (9771), 2985 states have internal predecessors, (9771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:24,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 9771 transitions. [2022-03-15 19:42:24,478 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 9771 transitions. Word has length 30 [2022-03-15 19:42:24,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:42:24,478 INFO L470 AbstractCegarLoop]: Abstraction has 2986 states and 9771 transitions. [2022-03-15 19:42:24,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.0980392156862746) internal successors, (158), 50 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:24,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 9771 transitions. [2022-03-15 19:42:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:42:24,482 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:42:24,482 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:42:24,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2022-03-15 19:42:24,682 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,SelfDestructingSolverStorable95 [2022-03-15 19:42:24,683 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:42:24,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:42:24,683 INFO L85 PathProgramCache]: Analyzing trace with hash -419967318, now seen corresponding path program 95 times [2022-03-15 19:42:24,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:42:24,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200501200] [2022-03-15 19:42:24,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:42:24,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:42:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:42:24,873 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:24,874 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:42:24,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200501200] [2022-03-15 19:42:24,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200501200] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:42:24,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484758892] [2022-03-15 19:42:24,874 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:42:24,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:24,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:42:24,875 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:42:24,878 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:42:24,982 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:42:24,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:42:24,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 19:42:24,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:42:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:25,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:42:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:25,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484758892] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:42:25,772 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:42:25,772 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 52 [2022-03-15 19:42:25,772 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [402302166] [2022-03-15 19:42:25,772 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:42:25,774 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:42:25,793 INFO L252 McrAutomatonBuilder]: Finished intersection with 120 states and 225 transitions. [2022-03-15 19:42:25,794 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:42:27,949 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [485683#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 485678#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 485688#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 ~counter~0))), 485696#(and (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 485681#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 485689#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 485687#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 485700#(and (or (not (< 7 ~M~0)) (<= 0 ~counter~0)) (or (not (< 7 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 485694#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 485677#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 485686#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 7 ~counter~0))), 485697#(and (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 485701#(or (not (< 7 ~M~0)) (<= 0 ~counter~0)), 485695#(and (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 485693#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 485679#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 485692#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0))), 485676#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 485684#(and (or (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 6 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 485690#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 thread1Thread1of1ForFork0_~i~0))), 485698#(and (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 485680#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 485699#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 485682#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 485691#(and (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 6 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 485685#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)))] [2022-03-15 19:42:27,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-15 19:42:27,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:42:27,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-15 19:42:27,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=5216, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 19:42:27,950 INFO L87 Difference]: Start difference. First operand 2986 states and 9771 transitions. Second operand has 48 states, 48 states have (on average 3.0) internal successors, (144), 47 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:42:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:42:34,565 INFO L93 Difference]: Finished difference Result 9974 states and 27046 transitions. [2022-03-15 19:42:34,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2022-03-15 19:42:34,565 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.0) internal successors, (144), 47 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 30 [2022-03-15 19:42:34,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:42:34,580 INFO L225 Difference]: With dead ends: 9974 [2022-03-15 19:42:34,580 INFO L226 Difference]: Without dead ends: 9770 [2022-03-15 19:42:34,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 83 SyntacticMatches, 9 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19432 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=12682, Invalid=43250, Unknown=0, NotChecked=0, Total=55932 [2022-03-15 19:42:34,582 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 641 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 2766 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 2986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 2766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:42:34,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [641 Valid, 46 Invalid, 2986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 2766 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:42:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9770 states. [2022-03-15 19:42:34,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9770 to 3228. [2022-03-15 19:42:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3228 states, 3227 states have (on average 3.27486829872947) internal successors, (10568), 3227 states have internal predecessors, (10568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3228 states to 3228 states and 10568 transitions. [2022-03-15 19:42:34,654 INFO L78 Accepts]: Start accepts. Automaton has 3228 states and 10568 transitions. Word has length 30 [2022-03-15 19:42:34,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:42:34,654 INFO L470 AbstractCegarLoop]: Abstraction has 3228 states and 10568 transitions. [2022-03-15 19:42:34,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.0) internal successors, (144), 47 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:42:34,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3228 states and 10568 transitions. [2022-03-15 19:42:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:42:34,657 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:42:34,658 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:42:34,674 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:42:34,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:34,868 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:42:34,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:42:34,869 INFO L85 PathProgramCache]: Analyzing trace with hash 102650026, now seen corresponding path program 96 times [2022-03-15 19:42:34,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:42:34,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344390515] [2022-03-15 19:42:34,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:42:34,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:42:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:42:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:35,056 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:42:35,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344390515] [2022-03-15 19:42:35,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344390515] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:42:35,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192976105] [2022-03-15 19:42:35,056 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:42:35,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:35,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:42:35,057 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:42:35,058 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:42:35,166 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:42:35,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:42:35,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 19:42:35,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:42:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 35 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:35,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:42:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:35,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192976105] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:42:35,957 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:42:35,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 52 [2022-03-15 19:42:35,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1889915383] [2022-03-15 19:42:35,957 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:42:35,959 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:42:35,977 INFO L252 McrAutomatonBuilder]: Finished intersection with 116 states and 216 transitions. [2022-03-15 19:42:35,977 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:42:37,961 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [502691#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 thread1Thread1of1ForFork0_~i~0))), 502688#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 502697#(and (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 502699#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 502680#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 ~counter~0))), 502684#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 502690#(and (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 502689#(and (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 502692#(and (or (not (< 7 ~M~0)) (<= 0 ~counter~0)) (or (not (< 7 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 502681#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 502693#(and (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 6 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 502677#(and (or (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 6 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 502678#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 502696#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 502694#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0))), 502682#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 502695#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 502686#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 502683#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 502676#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 502700#(or (not (< 7 ~M~0)) (<= 0 ~counter~0)), 502698#(and (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 502687#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 502679#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 502685#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)))] [2022-03-15 19:42:37,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 19:42:37,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:42:37,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 19:42:37,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=5074, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 19:42:37,962 INFO L87 Difference]: Start difference. First operand 3228 states and 10568 transitions. Second operand has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 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:42:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:42:45,132 INFO L93 Difference]: Finished difference Result 11472 states and 31429 transitions. [2022-03-15 19:42:45,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2022-03-15 19:42:45,132 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 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 30 [2022-03-15 19:42:45,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:42:45,150 INFO L225 Difference]: With dead ends: 11472 [2022-03-15 19:42:45,150 INFO L226 Difference]: Without dead ends: 11136 [2022-03-15 19:42:45,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 82 SyntacticMatches, 7 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20997 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=13542, Invalid=44780, Unknown=0, NotChecked=0, Total=58322 [2022-03-15 19:42:45,152 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 680 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 3903 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 4133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 3903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:42:45,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [680 Valid, 70 Invalid, 4133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 3903 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:42:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11136 states. [2022-03-15 19:42:45,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11136 to 3180. [2022-03-15 19:42:45,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3180 states, 3179 states have (on average 3.271469015413652) internal successors, (10400), 3179 states have internal predecessors, (10400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 3180 states and 10400 transitions. [2022-03-15 19:42:45,230 INFO L78 Accepts]: Start accepts. Automaton has 3180 states and 10400 transitions. Word has length 30 [2022-03-15 19:42:45,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:42:45,230 INFO L470 AbstractCegarLoop]: Abstraction has 3180 states and 10400 transitions. [2022-03-15 19:42:45,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 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:42:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 10400 transitions. [2022-03-15 19:42:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:42:45,234 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:42:45,234 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:42:45,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Ended with exit code 0 [2022-03-15 19:42:45,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:45,435 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:42:45,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:42:45,435 INFO L85 PathProgramCache]: Analyzing trace with hash 119508650, now seen corresponding path program 97 times [2022-03-15 19:42:45,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:42:45,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762461944] [2022-03-15 19:42:45,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:42:45,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:42:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:42:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:45,620 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:42:45,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762461944] [2022-03-15 19:42:45,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762461944] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:42:45,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869046304] [2022-03-15 19:42:45,621 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:42:45,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:45,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:42:45,622 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:42:45,622 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:42:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:42:45,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:42:45,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:42:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 34 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:45,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:42:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:46,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869046304] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:42:46,787 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:42:46,787 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 52 [2022-03-15 19:42:46,787 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1204854321] [2022-03-15 19:42:46,787 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:42:46,789 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:42:46,807 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 207 transitions. [2022-03-15 19:42:46,807 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:42:48,593 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [521112#(or (not (< 7 ~M~0)) (<= 0 ~counter~0)), 521100#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 521104#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0))), 521108#(and (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 521093#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 521090#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 thread1Thread1of1ForFork0_~i~0))), 521095#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 521106#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 521092#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 521109#(and (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 521110#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 521094#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 ~counter~0))), 521091#(and (or (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 6 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 521097#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 521089#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 521111#(and (or (not (< 7 ~M~0)) (<= 0 ~counter~0)) (or (not (< 7 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 521096#(and (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 521098#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 521107#(and (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 521101#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 521102#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 521105#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 521099#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 521103#(and (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 6 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))))] [2022-03-15 19:42:48,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 19:42:48,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:42:48,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 19:42:48,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=786, Invalid=4914, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 19:42:48,594 INFO L87 Difference]: Start difference. First operand 3180 states and 10400 transitions. Second operand has 46 states, 46 states have (on average 2.9130434782608696) internal successors, (134), 45 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:42:55,633 INFO L93 Difference]: Finished difference Result 10842 states and 29466 transitions. [2022-03-15 19:42:55,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2022-03-15 19:42:55,633 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.9130434782608696) internal successors, (134), 45 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:42:55,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:42:55,650 INFO L225 Difference]: With dead ends: 10842 [2022-03-15 19:42:55,650 INFO L226 Difference]: Without dead ends: 10618 [2022-03-15 19:42:55,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23641 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=14631, Invalid=47619, Unknown=0, NotChecked=0, Total=62250 [2022-03-15 19:42:55,652 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 731 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 3392 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 3650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 3392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:42:55,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [731 Valid, 60 Invalid, 3650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 3392 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:42:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10618 states. [2022-03-15 19:42:55,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10618 to 3172. [2022-03-15 19:42:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3172 states, 3171 states have (on average 3.2563859981078522) internal successors, (10326), 3171 states have internal predecessors, (10326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 10326 transitions. [2022-03-15 19:42:55,733 INFO L78 Accepts]: Start accepts. Automaton has 3172 states and 10326 transitions. Word has length 30 [2022-03-15 19:42:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:42:55,733 INFO L470 AbstractCegarLoop]: Abstraction has 3172 states and 10326 transitions. [2022-03-15 19:42:55,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.9130434782608696) internal successors, (134), 45 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3172 states and 10326 transitions. [2022-03-15 19:42:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:42:55,736 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:42:55,737 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:42:55,753 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:42:55,937 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,SelfDestructingSolverStorable98 [2022-03-15 19:42:55,937 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:42:55,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:42:55,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1644073130, now seen corresponding path program 98 times [2022-03-15 19:42:55,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:42:55,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994645978] [2022-03-15 19:42:55,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:42:55,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:42:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:42:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:56,122 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:42:56,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994645978] [2022-03-15 19:42:56,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994645978] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:42:56,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765324436] [2022-03-15 19:42:56,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:42:56,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:56,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:42:56,124 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:42:56,124 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:42:56,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:42:56,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:42:56,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:42:56,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:42:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 33 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:56,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:42:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:57,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765324436] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:42:57,254 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:42:57,254 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 52 [2022-03-15 19:42:57,254 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1834766847] [2022-03-15 19:42:57,254 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:42:57,256 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:42:57,274 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 198 transitions. [2022-03-15 19:42:57,274 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:42:58,906 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [538890#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 538894#(and (or (not (< 7 ~M~0)) (<= 0 ~counter~0)) (or (not (< 7 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 538895#(or (not (< 7 ~M~0)) (<= 0 ~counter~0)), 538884#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 538892#(and (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 538889#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 538873#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 538874#(and (or (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 6 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 538893#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 538891#(and (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 538882#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 538879#(and (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 538888#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0))), 538880#(and (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 538878#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 538881#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 538887#(and (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 6 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 538876#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 538883#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 538885#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 538877#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 ~counter~0))), 538886#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 thread1Thread1of1ForFork0_~i~0))), 538875#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)))] [2022-03-15 19:42:58,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 19:42:58,906 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:42:58,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 19:42:58,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=4760, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 19:42:58,907 INFO L87 Difference]: Start difference. First operand 3172 states and 10326 transitions. Second operand has 45 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 44 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:43:05,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:05,977 INFO L93 Difference]: Finished difference Result 9880 states and 26403 transitions. [2022-03-15 19:43:05,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2022-03-15 19:43:05,977 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 44 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 30 [2022-03-15 19:43:05,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:05,991 INFO L225 Difference]: With dead ends: 9880 [2022-03-15 19:43:05,991 INFO L226 Difference]: Without dead ends: 9740 [2022-03-15 19:43:05,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24541 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=15177, Invalid=50103, Unknown=0, NotChecked=0, Total=65280 [2022-03-15 19:43:05,993 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 779 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 3198 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 3450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 3198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:05,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [779 Valid, 58 Invalid, 3450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 3198 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 19:43:05,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9740 states. [2022-03-15 19:43:06,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9740 to 3168. [2022-03-15 19:43:06,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3168 states, 3167 states have (on average 3.250394695295232) internal successors, (10294), 3167 states have internal predecessors, (10294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:06,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 10294 transitions. [2022-03-15 19:43:06,057 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 10294 transitions. Word has length 30 [2022-03-15 19:43:06,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:06,057 INFO L470 AbstractCegarLoop]: Abstraction has 3168 states and 10294 transitions. [2022-03-15 19:43:06,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 44 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:43:06,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 10294 transitions. [2022-03-15 19:43:06,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:43:06,060 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:06,060 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:06,077 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:43:06,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:06,261 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:06,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:06,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1908978006, now seen corresponding path program 99 times [2022-03-15 19:43:06,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:06,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329117445] [2022-03-15 19:43:06,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:06,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:06,448 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:06,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329117445] [2022-03-15 19:43:06,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329117445] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:06,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696440065] [2022-03-15 19:43:06,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:43:06,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:06,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:06,449 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:43:06,450 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:43:06,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:43:06,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:06,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 19:43:06,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:06,825 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 32 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:06,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:07,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696440065] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:07,643 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:07,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 52 [2022-03-15 19:43:07,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1024359947] [2022-03-15 19:43:07,644 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:07,646 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:07,664 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 189 transitions. [2022-03-15 19:43:07,665 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:09,281 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [555717#(and (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 555701#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 555719#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 555721#(or (not (< 7 ~M~0)) (<= 0 ~counter~0)), 555716#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 555702#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 555711#(and (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 555713#(and (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 6 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 555704#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 555707#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 555705#(and (or (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 6 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 555712#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 thread1Thread1of1ForFork0_~i~0))), 555708#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 ~counter~0))), 555718#(and (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 555720#(and (or (not (< 7 ~M~0)) (<= 0 ~counter~0)) (or (not (< 7 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 555709#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 555715#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 555700#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 555710#(and (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 555714#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0))), 555706#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 555703#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0)))] [2022-03-15 19:43:09,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 19:43:09,282 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:09,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 19:43:09,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=802, Invalid=4600, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 19:43:09,283 INFO L87 Difference]: Start difference. First operand 3168 states and 10294 transitions. Second operand has 44 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 43 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:43:16,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:16,048 INFO L93 Difference]: Finished difference Result 8914 states and 23580 transitions. [2022-03-15 19:43:16,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2022-03-15 19:43:16,048 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 43 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 30 [2022-03-15 19:43:16,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:16,063 INFO L225 Difference]: With dead ends: 8914 [2022-03-15 19:43:16,063 INFO L226 Difference]: Without dead ends: 8834 [2022-03-15 19:43:16,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22477 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=14232, Invalid=48018, Unknown=0, NotChecked=0, Total=62250 [2022-03-15 19:43:16,066 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 902 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 2440 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 2693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 2440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:16,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [902 Valid, 47 Invalid, 2693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 2440 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:43:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8834 states. [2022-03-15 19:43:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8834 to 2868. [2022-03-15 19:43:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2868 states, 2867 states have (on average 3.2347401464945937) internal successors, (9274), 2867 states have internal predecessors, (9274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2868 states and 9274 transitions. [2022-03-15 19:43:16,139 INFO L78 Accepts]: Start accepts. Automaton has 2868 states and 9274 transitions. Word has length 30 [2022-03-15 19:43:16,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:16,139 INFO L470 AbstractCegarLoop]: Abstraction has 2868 states and 9274 transitions. [2022-03-15 19:43:16,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 43 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:43:16,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2868 states and 9274 transitions. [2022-03-15 19:43:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:43:16,143 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:16,143 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:16,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:16,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:16,361 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:16,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:16,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1192308566, now seen corresponding path program 100 times [2022-03-15 19:43:16,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:16,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557636918] [2022-03-15 19:43:16,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:16,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:16,554 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:16,554 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:16,554 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557636918] [2022-03-15 19:43:16,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557636918] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:16,554 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637172247] [2022-03-15 19:43:16,554 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:43:16,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:16,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:16,556 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:43:16,556 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:43:16,653 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:43:16,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:16,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:43:16,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:17,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:17,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637172247] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:17,549 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:17,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 51 [2022-03-15 19:43:17,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1007644435] [2022-03-15 19:43:17,549 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:17,552 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:17,568 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 180 transitions. [2022-03-15 19:43:17,568 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:18,869 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [570965#(and (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 570958#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 570966#(and (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 570959#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 thread1Thread1of1ForFork0_~i~0))), 570962#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 570960#(and (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 6 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 570957#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 570968#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 570954#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 570956#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 570967#(and (or (not (< 7 ~M~0)) (<= 0 ~counter~0)) (or (not (< 7 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 570969#(or (not (< 7 ~M~0)) (<= 0 ~counter~0)), 570964#(and (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 570950#(and (or (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 6 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 570953#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 ~counter~0))), 570963#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 570949#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 570961#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0))), 570951#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 570952#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 570955#(and (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:43:18,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 19:43:18,869 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:18,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 19:43:18,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=4483, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 19:43:18,870 INFO L87 Difference]: Start difference. First operand 2868 states and 9274 transitions. Second operand has 43 states, 43 states have (on average 2.7674418604651163) internal successors, (119), 42 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:43:24,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:24,845 INFO L93 Difference]: Finished difference Result 7682 states and 20117 transitions. [2022-03-15 19:43:24,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2022-03-15 19:43:24,845 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.7674418604651163) internal successors, (119), 42 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 30 [2022-03-15 19:43:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:24,865 INFO L225 Difference]: With dead ends: 7682 [2022-03-15 19:43:24,865 INFO L226 Difference]: Without dead ends: 7642 [2022-03-15 19:43:24,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19357 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=11726, Invalid=42330, Unknown=0, NotChecked=0, Total=54056 [2022-03-15 19:43:24,867 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 826 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 2809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:24,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [826 Valid, 50 Invalid, 2809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 2545 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:43:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7642 states. [2022-03-15 19:43:24,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7642 to 2402. [2022-03-15 19:43:24,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2402 states, 2401 states have (on average 3.1874219075385257) internal successors, (7653), 2401 states have internal predecessors, (7653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 7653 transitions. [2022-03-15 19:43:24,925 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 7653 transitions. Word has length 30 [2022-03-15 19:43:24,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:24,925 INFO L470 AbstractCegarLoop]: Abstraction has 2402 states and 7653 transitions. [2022-03-15 19:43:24,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.7674418604651163) internal successors, (119), 42 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:43:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 7653 transitions. [2022-03-15 19:43:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:43:24,929 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:24,929 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:24,946 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:43:25,129 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,SelfDestructingSolverStorable101 [2022-03-15 19:43:25,130 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:25,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:25,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2017398442, now seen corresponding path program 101 times [2022-03-15 19:43:25,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:25,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105781980] [2022-03-15 19:43:25,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:25,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:25,335 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:25,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105781980] [2022-03-15 19:43:25,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105781980] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:25,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956648266] [2022-03-15 19:43:25,335 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:43:25,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:25,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:25,336 INFO L229 MonitoredProcess]: Starting monitored process 103 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:43:25,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-03-15 19:43:25,444 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:43:25,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:25,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:43:25,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:25,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:26,722 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:26,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956648266] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:26,722 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:26,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 52 [2022-03-15 19:43:26,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1773622930] [2022-03-15 19:43:26,723 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:26,725 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:26,741 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 171 transitions. [2022-03-15 19:43:26,741 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:27,927 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [584022#(and (or (not (< 7 ~M~0)) (<= 0 ~counter~0)) (or (not (< 7 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 584013#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0))), 584016#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 584012#(and (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 6 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 584014#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 584015#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 584009#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 584021#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 584023#(or (not (< 7 ~M~0)) (<= 0 ~counter~0)), 584017#(and (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 584005#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 584011#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 thread1Thread1of1ForFork0_~i~0))), 584007#(and (or (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 6 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 584006#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 584010#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 ~counter~0))), 584008#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 584018#(and (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 584020#(and (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 584004#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 584019#(and (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:43:27,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 19:43:27,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:27,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 19:43:27,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=868, Invalid=4244, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 19:43:27,929 INFO L87 Difference]: Start difference. First operand 2402 states and 7653 transitions. Second operand has 42 states, 42 states have (on average 2.7142857142857144) internal successors, (114), 41 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:43:33,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:33,404 INFO L93 Difference]: Finished difference Result 6438 states and 16428 transitions. [2022-03-15 19:43:33,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2022-03-15 19:43:33,404 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.7142857142857144) internal successors, (114), 41 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) Word has length 30 [2022-03-15 19:43:33,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:33,414 INFO L225 Difference]: With dead ends: 6438 [2022-03-15 19:43:33,414 INFO L226 Difference]: Without dead ends: 6422 [2022-03-15 19:43:33,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16213 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=10548, Invalid=35462, Unknown=0, NotChecked=0, Total=46010 [2022-03-15 19:43:33,417 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 638 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 3193 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 3469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 3193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:33,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [638 Valid, 73 Invalid, 3469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 3193 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 19:43:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6422 states. [2022-03-15 19:43:33,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6422 to 2676. [2022-03-15 19:43:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2676 states, 2675 states have (on average 3.169345794392523) internal successors, (8478), 2675 states have internal predecessors, (8478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:33,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 8478 transitions. [2022-03-15 19:43:33,471 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 8478 transitions. Word has length 30 [2022-03-15 19:43:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:33,471 INFO L470 AbstractCegarLoop]: Abstraction has 2676 states and 8478 transitions. [2022-03-15 19:43:33,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.7142857142857144) internal successors, (114), 41 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:43:33,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 8478 transitions. [2022-03-15 19:43:33,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:43:33,474 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:33,475 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:33,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:33,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-03-15 19:43:33,675 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:33,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:33,675 INFO L85 PathProgramCache]: Analyzing trace with hash -55548630, now seen corresponding path program 102 times [2022-03-15 19:43:33,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:33,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341634588] [2022-03-15 19:43:33,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:33,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:33,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:33,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341634588] [2022-03-15 19:43:33,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341634588] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:33,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225603544] [2022-03-15 19:43:33,870 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:43:33,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:33,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:33,871 INFO L229 MonitoredProcess]: Starting monitored process 104 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:43:33,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-03-15 19:43:33,983 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 19:43:33,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:33,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:43:33,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:34,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:35,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225603544] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:35,406 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:35,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 51 [2022-03-15 19:43:35,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [901068808] [2022-03-15 19:43:35,406 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:35,409 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:35,425 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 167 transitions. [2022-03-15 19:43:35,425 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:36,523 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [596331#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0))), 596330#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 596328#(and (or (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 6 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 596334#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 ~counter~0))), 596327#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 thread1Thread1of1ForFork0_~i~0))), 596325#(< thread2Thread1of1ForFork1_~i~1 ~M~0), 596338#(and (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 596333#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 596329#(and (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 6 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 596341#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 596340#(and (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 596343#(or (not (< 7 ~M~0)) (<= 0 ~counter~0)), 596336#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 596337#(and (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 596332#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 596342#(and (or (not (< 7 ~M~0)) (<= 0 ~counter~0)) (or (not (< 7 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 596339#(and (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 596326#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 596335#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)))] [2022-03-15 19:43:36,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:43:36,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:36,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:43:36,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=930, Invalid=3900, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 19:43:36,524 INFO L87 Difference]: Start difference. First operand 2676 states and 8478 transitions. Second operand has 41 states, 41 states have (on average 2.682926829268293) internal successors, (110), 40 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:43:40,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:40,516 INFO L93 Difference]: Finished difference Result 4582 states and 12713 transitions. [2022-03-15 19:43:40,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-03-15 19:43:40,516 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.682926829268293) internal successors, (110), 40 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 30 [2022-03-15 19:43:40,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:40,524 INFO L225 Difference]: With dead ends: 4582 [2022-03-15 19:43:40,524 INFO L226 Difference]: Without dead ends: 4576 [2022-03-15 19:43:40,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10892 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=7472, Invalid=27684, Unknown=0, NotChecked=0, Total=35156 [2022-03-15 19:43:40,527 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 413 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 2417 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 2736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 2417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:40,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 73 Invalid, 2736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 2417 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:43:40,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2022-03-15 19:43:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 2434. [2022-03-15 19:43:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2433 states have (on average 3.1315248664200577) internal successors, (7619), 2433 states have internal predecessors, (7619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 7619 transitions. [2022-03-15 19:43:40,584 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 7619 transitions. Word has length 30 [2022-03-15 19:43:40,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:40,584 INFO L470 AbstractCegarLoop]: Abstraction has 2434 states and 7619 transitions. [2022-03-15 19:43:40,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.682926829268293) internal successors, (110), 40 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:43:40,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 7619 transitions. [2022-03-15 19:43:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:43:40,587 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:40,587 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:40,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Ended with exit code 0 [2022-03-15 19:43:40,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-03-15 19:43:40,788 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:40,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2081309516, now seen corresponding path program 103 times [2022-03-15 19:43:40,789 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:40,789 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894463263] [2022-03-15 19:43:40,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:40,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 16 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:40,968 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:40,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894463263] [2022-03-15 19:43:40,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894463263] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:40,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314920155] [2022-03-15 19:43:40,968 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:43:40,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:40,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:40,969 INFO L229 MonitoredProcess]: Starting monitored process 105 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:43:40,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-03-15 19:43:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:41,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:43:41,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 33 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:41,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:42,131 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:42,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314920155] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:42,131 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:42,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 21] total 52 [2022-03-15 19:43:42,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [602895181] [2022-03-15 19:43:42,131 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:42,134 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:42,153 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 198 transitions. [2022-03-15 19:43:42,154 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:43,845 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [606263#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 606265#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 5 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 606269#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 606270#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 606277#(or (not (< 6 ~M~0)) (<= 0 ~counter~0)), 606257#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 606271#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 606274#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 606260#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 606262#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 606259#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 606256#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0))), 606268#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 606258#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 606273#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0))), 606264#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 606272#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 606275#(and (or (not (< 6 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 6 ~M~0)) (<= 0 ~counter~0))), 606267#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 606261#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 606266#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 606276#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:43:43,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 19:43:43,846 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:43,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 19:43:43,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=754, Invalid=4648, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 19:43:43,847 INFO L87 Difference]: Start difference. First operand 2434 states and 7619 transitions. Second operand has 43 states, 43 states have (on average 2.953488372093023) internal successors, (127), 42 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:48,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:48,850 INFO L93 Difference]: Finished difference Result 6786 states and 17862 transitions. [2022-03-15 19:43:48,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-03-15 19:43:48,851 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.953488372093023) internal successors, (127), 42 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:43:48,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:48,861 INFO L225 Difference]: With dead ends: 6786 [2022-03-15 19:43:48,861 INFO L226 Difference]: Without dead ends: 6702 [2022-03-15 19:43:48,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 77 SyntacticMatches, 7 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14865 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=8993, Invalid=32013, Unknown=0, NotChecked=0, Total=41006 [2022-03-15 19:43:48,863 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 533 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 2920 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 3128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 2920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:48,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [533 Valid, 51 Invalid, 3128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 2920 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:43:48,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6702 states. [2022-03-15 19:43:48,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6702 to 2352. [2022-03-15 19:43:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 2351 states have (on average 3.133134836239898) internal successors, (7366), 2351 states have internal predecessors, (7366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 7366 transitions. [2022-03-15 19:43:48,912 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 7366 transitions. Word has length 30 [2022-03-15 19:43:48,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:48,912 INFO L470 AbstractCegarLoop]: Abstraction has 2352 states and 7366 transitions. [2022-03-15 19:43:48,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.953488372093023) internal successors, (127), 42 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:48,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 7366 transitions. [2022-03-15 19:43:48,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:43:48,914 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:48,914 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:48,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Ended with exit code 0 [2022-03-15 19:43:49,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:49,115 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:49,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:49,115 INFO L85 PathProgramCache]: Analyzing trace with hash 227813698, now seen corresponding path program 104 times [2022-03-15 19:43:49,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:49,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855912884] [2022-03-15 19:43:49,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:49,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 16 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:49,294 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:49,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855912884] [2022-03-15 19:43:49,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855912884] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:49,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359229657] [2022-03-15 19:43:49,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:43:49,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:49,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:49,296 INFO L229 MonitoredProcess]: Starting monitored process 106 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:43:49,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2022-03-15 19:43:49,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:43:49,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:49,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:43:49,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:49,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:50,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359229657] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:50,483 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:50,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 21] total 52 [2022-03-15 19:43:50,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [443417662] [2022-03-15 19:43:50,483 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:50,485 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:50,501 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 189 transitions. [2022-03-15 19:43:50,501 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:51,986 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [618253#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 618254#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 618265#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 618255#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 618259#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 618266#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 618269#(and (or (not (< 6 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 6 ~M~0)) (<= 0 ~counter~0))), 618256#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 618263#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 5 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 618261#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 618260#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 618272#(or (not (< 6 ~M~0)) (<= 0 ~counter~0)), 618264#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 618262#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 618258#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 618270#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0))), 618252#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 618257#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0))), 618271#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 618267#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 618268#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:43:51,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 19:43:51,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:51,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 19:43:51,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=752, Invalid=4504, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 19:43:51,987 INFO L87 Difference]: Start difference. First operand 2352 states and 7366 transitions. Second operand has 42 states, 42 states have (on average 2.9047619047619047) internal successors, (122), 41 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:43:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:57,213 INFO L93 Difference]: Finished difference Result 6572 states and 16913 transitions. [2022-03-15 19:43:57,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2022-03-15 19:43:57,214 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.9047619047619047) internal successors, (122), 41 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 30 [2022-03-15 19:43:57,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:57,224 INFO L225 Difference]: With dead ends: 6572 [2022-03-15 19:43:57,224 INFO L226 Difference]: Without dead ends: 6512 [2022-03-15 19:43:57,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16139 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=9878, Invalid=34854, Unknown=0, NotChecked=0, Total=44732 [2022-03-15 19:43:57,226 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 601 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:57,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [601 Valid, 43 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:43:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6512 states. [2022-03-15 19:43:57,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6512 to 2338. [2022-03-15 19:43:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2338 states, 2337 states have (on average 3.1240907145913566) internal successors, (7301), 2337 states have internal predecessors, (7301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 7301 transitions. [2022-03-15 19:43:57,274 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 7301 transitions. Word has length 30 [2022-03-15 19:43:57,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:57,275 INFO L470 AbstractCegarLoop]: Abstraction has 2338 states and 7301 transitions. [2022-03-15 19:43:57,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.9047619047619047) internal successors, (122), 41 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:43:57,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 7301 transitions. [2022-03-15 19:43:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:43:57,277 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:57,277 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:57,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Ended with exit code 0 [2022-03-15 19:43:57,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2022-03-15 19:43:57,478 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:57,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:57,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1969138828, now seen corresponding path program 105 times [2022-03-15 19:43:57,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:57,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178628794] [2022-03-15 19:43:57,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:57,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 16 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:57,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:57,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178628794] [2022-03-15 19:43:57,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178628794] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:57,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500470602] [2022-03-15 19:43:57,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:43:57,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:57,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:57,653 INFO L229 MonitoredProcess]: Starting monitored process 107 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:43:57,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2022-03-15 19:43:57,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:43:57,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:57,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 19:43:57,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:58,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:58,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500470602] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:58,557 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:58,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 20] total 51 [2022-03-15 19:43:58,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1234902890] [2022-03-15 19:43:58,558 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:58,560 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:58,579 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 180 transitions. [2022-03-15 19:43:58,579 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:00,093 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [630039#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 630024#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 630033#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 630042#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 630029#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 630032#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 630026#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 630034#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 630041#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0))), 630043#(or (not (< 6 ~M~0)) (<= 0 ~counter~0)), 630025#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 630037#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 630036#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 630035#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 630027#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 630040#(and (or (not (< 6 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 6 ~M~0)) (<= 0 ~counter~0))), 630038#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0))), 630030#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 5 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 630031#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 5 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 630028#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))))] [2022-03-15 19:44:00,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:44:00,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:00,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:44:00,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=4266, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 19:44:00,094 INFO L87 Difference]: Start difference. First operand 2338 states and 7301 transitions. Second operand has 41 states, 41 states have (on average 2.8536585365853657) internal successors, (117), 40 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:44:06,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:06,432 INFO L93 Difference]: Finished difference Result 6992 states and 17743 transitions. [2022-03-15 19:44:06,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2022-03-15 19:44:06,432 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.8536585365853657) internal successors, (117), 40 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 30 [2022-03-15 19:44:06,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:06,442 INFO L225 Difference]: With dead ends: 6992 [2022-03-15 19:44:06,442 INFO L226 Difference]: Without dead ends: 6952 [2022-03-15 19:44:06,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18411 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=11685, Invalid=41907, Unknown=0, NotChecked=0, Total=53592 [2022-03-15 19:44:06,445 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 545 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 2710 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 2710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:06,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [545 Valid, 61 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 2710 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:44:06,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6952 states. [2022-03-15 19:44:06,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6952 to 2464. [2022-03-15 19:44:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2464 states, 2463 states have (on average 3.122208688591149) internal successors, (7690), 2463 states have internal predecessors, (7690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 7690 transitions. [2022-03-15 19:44:06,494 INFO L78 Accepts]: Start accepts. Automaton has 2464 states and 7690 transitions. Word has length 30 [2022-03-15 19:44:06,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:06,494 INFO L470 AbstractCegarLoop]: Abstraction has 2464 states and 7690 transitions. [2022-03-15 19:44:06,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.8536585365853657) internal successors, (117), 40 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:44:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 7690 transitions. [2022-03-15 19:44:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:44:06,497 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:06,497 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:06,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Ended with exit code 0 [2022-03-15 19:44:06,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106 [2022-03-15 19:44:06,698 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:06,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:06,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1609668610, now seen corresponding path program 106 times [2022-03-15 19:44:06,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:06,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216169513] [2022-03-15 19:44:06,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:06,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 16 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:06,874 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:06,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216169513] [2022-03-15 19:44:06,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216169513] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:06,875 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760478195] [2022-03-15 19:44:06,875 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:44:06,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:06,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:06,876 INFO L229 MonitoredProcess]: Starting monitored process 108 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:44:06,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2022-03-15 19:44:06,983 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:44:06,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:06,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:44:06,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:07,554 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 35 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:07,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:07,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760478195] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:07,924 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:07,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 20] total 50 [2022-03-15 19:44:07,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1403555326] [2022-03-15 19:44:07,924 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:07,927 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:07,943 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 171 transitions. [2022-03-15 19:44:07,943 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:09,294 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [642518#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 642525#(or (not (< 6 ~M~0)) (<= 0 ~counter~0)), 642520#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 642510#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 642528#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 642516#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 642526#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 642524#(and (or (not (< 6 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 6 ~M~0)) (<= 0 ~counter~0))), 642511#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 5 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 642522#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0))), 642527#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 642515#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 5 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 642514#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 642523#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 642521#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 642519#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0))), 642512#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 642517#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 642513#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:44:09,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 19:44:09,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:09,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 19:44:09,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=4090, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 19:44:09,295 INFO L87 Difference]: Start difference. First operand 2464 states and 7690 transitions. Second operand has 40 states, 40 states have (on average 2.8) internal successors, (112), 39 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:44:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:14,997 INFO L93 Difference]: Finished difference Result 7834 states and 19726 transitions. [2022-03-15 19:44:14,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2022-03-15 19:44:14,997 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.8) internal successors, (112), 39 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 30 [2022-03-15 19:44:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:15,010 INFO L225 Difference]: With dead ends: 7834 [2022-03-15 19:44:15,010 INFO L226 Difference]: Without dead ends: 7810 [2022-03-15 19:44:15,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18633 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=10862, Invalid=39538, Unknown=0, NotChecked=0, Total=50400 [2022-03-15 19:44:15,014 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 462 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 2685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:15,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [462 Valid, 42 Invalid, 2685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:44:15,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7810 states. [2022-03-15 19:44:15,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7810 to 2514. [2022-03-15 19:44:15,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2514 states, 2513 states have (on average 3.1273378432152805) internal successors, (7859), 2513 states have internal predecessors, (7859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 7859 transitions. [2022-03-15 19:44:15,080 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 7859 transitions. Word has length 30 [2022-03-15 19:44:15,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:15,080 INFO L470 AbstractCegarLoop]: Abstraction has 2514 states and 7859 transitions. [2022-03-15 19:44:15,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.8) internal successors, (112), 39 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:44:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 7859 transitions. [2022-03-15 19:44:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:44:15,083 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:15,083 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:15,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:15,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107,108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:15,283 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:15,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:15,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1043883468, now seen corresponding path program 107 times [2022-03-15 19:44:15,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:15,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884245271] [2022-03-15 19:44:15,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:15,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 16 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:15,459 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:15,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884245271] [2022-03-15 19:44:15,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884245271] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:15,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763972833] [2022-03-15 19:44:15,459 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:44:15,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:15,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:15,460 INFO L229 MonitoredProcess]: Starting monitored process 109 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:44:15,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2022-03-15 19:44:15,568 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:44:15,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:15,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:44:15,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:15,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:16,848 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:16,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763972833] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:16,848 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:16,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 21] total 52 [2022-03-15 19:44:16,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1409921308] [2022-03-15 19:44:16,849 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:16,851 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:16,866 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 162 transitions. [2022-03-15 19:44:16,866 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:17,940 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [655936#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 655943#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 655941#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 655942#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0))), 655940#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 655933#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0))), 655945#(and (or (not (< 6 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 6 ~M~0)) (<= 0 ~counter~0))), 655939#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0))), 655944#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 655935#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 655929#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 655932#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 655937#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 5 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 655934#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 655946#(or (not (< 6 ~M~0)) (<= 0 ~counter~0)), 655930#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 655931#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0))), 655938#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0)))] [2022-03-15 19:44:17,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 19:44:17,940 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:17,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 19:44:17,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=794, Invalid=4036, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 19:44:17,941 INFO L87 Difference]: Start difference. First operand 2514 states and 7859 transitions. Second operand has 39 states, 39 states have (on average 2.7435897435897436) internal successors, (107), 38 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:44:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:24,572 INFO L93 Difference]: Finished difference Result 7446 states and 18591 transitions. [2022-03-15 19:44:24,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2022-03-15 19:44:24,572 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.7435897435897436) internal successors, (107), 38 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 30 [2022-03-15 19:44:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:24,583 INFO L225 Difference]: With dead ends: 7446 [2022-03-15 19:44:24,583 INFO L226 Difference]: Without dead ends: 7422 [2022-03-15 19:44:24,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22136 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=12467, Invalid=47803, Unknown=0, NotChecked=0, Total=60270 [2022-03-15 19:44:24,587 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 742 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 2662 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 2991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 2662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:24,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [742 Valid, 52 Invalid, 2991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 2662 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:44:24,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7422 states. [2022-03-15 19:44:24,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7422 to 2060. [2022-03-15 19:44:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 2059 states have (on average 3.1355026711996117) internal successors, (6456), 2059 states have internal predecessors, (6456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 6456 transitions. [2022-03-15 19:44:24,656 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 6456 transitions. Word has length 30 [2022-03-15 19:44:24,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:24,657 INFO L470 AbstractCegarLoop]: Abstraction has 2060 states and 6456 transitions. [2022-03-15 19:44:24,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.7435897435897436) internal successors, (107), 38 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:44:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 6456 transitions. [2022-03-15 19:44:24,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:44:24,659 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:24,659 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:24,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Ended with exit code 0 [2022-03-15 19:44:24,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:24,860 INFO L402 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:24,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:24,860 INFO L85 PathProgramCache]: Analyzing trace with hash -726555734, now seen corresponding path program 108 times [2022-03-15 19:44:24,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:24,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593469128] [2022-03-15 19:44:24,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:24,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:25,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:25,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593469128] [2022-03-15 19:44:25,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593469128] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:25,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884585625] [2022-03-15 19:44:25,029 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:44:25,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:25,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:25,030 INFO L229 MonitoredProcess]: Starting monitored process 110 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:44:25,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2022-03-15 19:44:25,145 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 19:44:25,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:25,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:44:25,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:25,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:26,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884585625] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:26,181 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:26,181 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 52 [2022-03-15 19:44:26,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [198904695] [2022-03-15 19:44:26,181 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:26,183 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:26,199 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 180 transitions. [2022-03-15 19:44:26,199 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:27,647 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [668108#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 668109#(or (not (< 5 ~M~0)) (<= 0 ~counter~0)), 668091#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 668096#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 668097#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 668092#(and (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 668104#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 668100#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 668095#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 668106#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 668107#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 668093#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 668099#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 668094#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 668101#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 668105#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 668102#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 668103#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 668098#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:44:27,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 19:44:27,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:27,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 19:44:27,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=4334, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 19:44:27,648 INFO L87 Difference]: Start difference. First operand 2060 states and 6456 transitions. Second operand has 39 states, 39 states have (on average 2.948717948717949) internal successors, (115), 38 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:44:31,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:31,495 INFO L93 Difference]: Finished difference Result 5646 states and 14689 transitions. [2022-03-15 19:44:31,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-03-15 19:44:31,495 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.948717948717949) internal successors, (115), 38 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 30 [2022-03-15 19:44:31,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:31,504 INFO L225 Difference]: With dead ends: 5646 [2022-03-15 19:44:31,504 INFO L226 Difference]: Without dead ends: 5586 [2022-03-15 19:44:31,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 73 SyntacticMatches, 6 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9412 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5788, Invalid=22942, Unknown=0, NotChecked=0, Total=28730 [2022-03-15 19:44:31,507 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 491 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 2529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:31,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 48 Invalid, 2529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:44:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5586 states. [2022-03-15 19:44:31,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5586 to 2024. [2022-03-15 19:44:31,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 2023 states have (on average 3.134948096885813) internal successors, (6342), 2023 states have internal predecessors, (6342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 6342 transitions. [2022-03-15 19:44:31,547 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 6342 transitions. Word has length 30 [2022-03-15 19:44:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:31,547 INFO L470 AbstractCegarLoop]: Abstraction has 2024 states and 6342 transitions. [2022-03-15 19:44:31,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.948717948717949) internal successors, (115), 38 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:44:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 6342 transitions. [2022-03-15 19:44:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:44:31,550 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:31,550 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:31,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Ended with exit code 0 [2022-03-15 19:44:31,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable109 [2022-03-15 19:44:31,750 INFO L402 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:31,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:31,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1931676394, now seen corresponding path program 109 times [2022-03-15 19:44:31,751 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:31,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040224996] [2022-03-15 19:44:31,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:31,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:31,928 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:31,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:31,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040224996] [2022-03-15 19:44:31,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040224996] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:31,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7543699] [2022-03-15 19:44:31,928 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:44:31,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:31,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:31,929 INFO L229 MonitoredProcess]: Starting monitored process 111 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:44:31,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2022-03-15 19:44:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:32,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:44:32,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 27 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:32,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:33,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7543699] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:33,147 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:33,147 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 52 [2022-03-15 19:44:33,147 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [337268976] [2022-03-15 19:44:33,147 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:33,149 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:33,164 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 171 transitions. [2022-03-15 19:44:33,164 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:34,427 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [678230#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 678231#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 678244#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 678229#(and (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 678228#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 678240#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 678238#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 678241#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 678234#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 678236#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 678242#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 678237#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 678235#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 678239#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 678232#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 678233#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 678243#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 678245#(or (not (< 5 ~M~0)) (<= 0 ~counter~0))] [2022-03-15 19:44:34,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 19:44:34,428 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:34,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 19:44:34,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=4108, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 19:44:34,428 INFO L87 Difference]: Start difference. First operand 2024 states and 6342 transitions. Second operand has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 37 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:44:38,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:38,245 INFO L93 Difference]: Finished difference Result 6120 states and 15521 transitions. [2022-03-15 19:44:38,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-15 19:44:38,246 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 37 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 30 [2022-03-15 19:44:38,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:38,255 INFO L225 Difference]: With dead ends: 6120 [2022-03-15 19:44:38,255 INFO L226 Difference]: Without dead ends: 6080 [2022-03-15 19:44:38,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10536 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6439, Invalid=23663, Unknown=0, NotChecked=0, Total=30102 [2022-03-15 19:44:38,257 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 500 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 2538 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 2734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 2538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:38,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 48 Invalid, 2734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 2538 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:44:38,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6080 states. [2022-03-15 19:44:38,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6080 to 1956. [2022-03-15 19:44:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1956 states, 1955 states have (on average 3.1498721227621482) internal successors, (6158), 1955 states have internal predecessors, (6158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 6158 transitions. [2022-03-15 19:44:38,298 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 6158 transitions. Word has length 30 [2022-03-15 19:44:38,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:38,298 INFO L470 AbstractCegarLoop]: Abstraction has 1956 states and 6158 transitions. [2022-03-15 19:44:38,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 37 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:44:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 6158 transitions. [2022-03-15 19:44:38,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:44:38,301 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:38,301 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:38,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Ended with exit code 0 [2022-03-15 19:44:38,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,111 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:38,501 INFO L402 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:38,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:38,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1723352150, now seen corresponding path program 110 times [2022-03-15 19:44:38,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:38,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670654329] [2022-03-15 19:44:38,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:38,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:38,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:38,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670654329] [2022-03-15 19:44:38,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670654329] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:38,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032085284] [2022-03-15 19:44:38,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:44:38,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:38,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:38,679 INFO L229 MonitoredProcess]: Starting monitored process 112 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:44:38,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2022-03-15 19:44:38,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:44:38,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:38,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:44:38,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:39,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:40,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032085284] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:40,011 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:40,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 52 [2022-03-15 19:44:40,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1278365126] [2022-03-15 19:44:40,011 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:40,013 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:40,028 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 162 transitions. [2022-03-15 19:44:40,028 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:41,154 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [688724#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 688727#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 688714#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 688712#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 688728#(or (not (< 5 ~M~0)) (<= 0 ~counter~0)), 688721#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 688718#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 688716#(and (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 688720#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 688726#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 688715#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 688717#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 688713#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 688723#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 688725#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 688719#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 688722#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0)))] [2022-03-15 19:44:41,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 19:44:41,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:41,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 19:44:41,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=3955, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 19:44:41,155 INFO L87 Difference]: Start difference. First operand 1956 states and 6158 transitions. Second operand has 37 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 36 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:44:46,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:46,603 INFO L93 Difference]: Finished difference Result 6892 states and 16963 transitions. [2022-03-15 19:44:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2022-03-15 19:44:46,603 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 36 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 30 [2022-03-15 19:44:46,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:46,612 INFO L225 Difference]: With dead ends: 6892 [2022-03-15 19:44:46,612 INFO L226 Difference]: Without dead ends: 6868 [2022-03-15 19:44:46,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17472 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=9828, Invalid=37914, Unknown=0, NotChecked=0, Total=47742 [2022-03-15 19:44:46,614 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 591 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 2530 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:46,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [591 Valid, 43 Invalid, 2795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2530 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:44:46,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2022-03-15 19:44:46,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 1956. [2022-03-15 19:44:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1956 states, 1955 states have (on average 3.1468030690537083) internal successors, (6152), 1955 states have internal predecessors, (6152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:46,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 6152 transitions. [2022-03-15 19:44:46,657 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 6152 transitions. Word has length 30 [2022-03-15 19:44:46,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:46,657 INFO L470 AbstractCegarLoop]: Abstraction has 1956 states and 6152 transitions. [2022-03-15 19:44:46,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 36 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:44:46,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 6152 transitions. [2022-03-15 19:44:46,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:44:46,660 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:46,660 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:46,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Ended with exit code 0 [2022-03-15 19:44:46,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2022-03-15 19:44:46,866 INFO L402 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:46,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:46,867 INFO L85 PathProgramCache]: Analyzing trace with hash 770340940, now seen corresponding path program 111 times [2022-03-15 19:44:46,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:46,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133375950] [2022-03-15 19:44:46,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:46,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:47,026 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 12 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:47,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:47,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133375950] [2022-03-15 19:44:47,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133375950] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:47,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994277075] [2022-03-15 19:44:47,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:44:47,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:47,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:47,027 INFO L229 MonitoredProcess]: Starting monitored process 113 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:44:47,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2022-03-15 19:44:47,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-03-15 19:44:47,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:47,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:44:47,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 16 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:47,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 16 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:48,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994277075] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:48,259 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:48,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 21] total 52 [2022-03-15 19:44:48,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [202072394] [2022-03-15 19:44:48,259 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:48,261 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:48,276 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 162 transitions. [2022-03-15 19:44:48,276 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:49,456 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [700063#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 700065#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0))), 700061#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 700069#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 700068#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 700062#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 700071#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 700073#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (not (< 4 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 700059#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 700070#(and (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 700067#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 700060#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 700066#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 700064#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 700072#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0))), 700074#(or (<= 0 ~counter~0) (not (< 4 ~M~0)))] [2022-03-15 19:44:49,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 19:44:49,456 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:49,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 19:44:49,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=3937, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 19:44:49,457 INFO L87 Difference]: Start difference. First operand 1956 states and 6152 transitions. Second operand has 35 states, 35 states have (on average 2.942857142857143) internal successors, (103), 34 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:44:52,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:52,974 INFO L93 Difference]: Finished difference Result 6000 states and 15812 transitions. [2022-03-15 19:44:52,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-03-15 19:44:52,975 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.942857142857143) internal successors, (103), 34 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 30 [2022-03-15 19:44:52,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:52,984 INFO L225 Difference]: With dead ends: 6000 [2022-03-15 19:44:52,984 INFO L226 Difference]: Without dead ends: 5960 [2022-03-15 19:44:52,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9025 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5212, Invalid=21848, Unknown=0, NotChecked=0, Total=27060 [2022-03-15 19:44:52,986 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 417 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 1820 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:52,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 33 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1820 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:44:52,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2022-03-15 19:44:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 1928. [2022-03-15 19:44:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1928 states, 1927 states have (on average 3.1510119356512716) internal successors, (6072), 1927 states have internal predecessors, (6072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 6072 transitions. [2022-03-15 19:44:53,026 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 6072 transitions. Word has length 30 [2022-03-15 19:44:53,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:53,026 INFO L470 AbstractCegarLoop]: Abstraction has 1928 states and 6072 transitions. [2022-03-15 19:44:53,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.942857142857143) internal successors, (103), 34 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:44:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 6072 transitions. [2022-03-15 19:44:53,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:44:53,028 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:53,029 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:53,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Ended with exit code 0 [2022-03-15 19:44:53,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2022-03-15 19:44:53,230 INFO L402 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:53,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:53,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1097032538, now seen corresponding path program 112 times [2022-03-15 19:44:53,231 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:53,231 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349804617] [2022-03-15 19:44:53,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:53,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:53,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:53,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349804617] [2022-03-15 19:44:53,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349804617] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:53,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966384484] [2022-03-15 19:44:53,334 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:44:53,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:53,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:53,335 INFO L229 MonitoredProcess]: Starting monitored process 114 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:44:53,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2022-03-15 19:44:53,458 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:44:53,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:53,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 19:44:53,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:53,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 1 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:54,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966384484] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:54,257 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:54,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18, 19] total 36 [2022-03-15 19:44:54,257 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [127896238] [2022-03-15 19:44:54,257 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:54,259 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:54,283 INFO L252 McrAutomatonBuilder]: Finished intersection with 140 states and 268 transitions. [2022-03-15 19:44:54,284 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:55,644 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:44:55,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:44:55,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:55,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:44:55,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1066, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:44:55,645 INFO L87 Difference]: Start difference. First operand 1928 states and 6072 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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:44:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:55,999 INFO L93 Difference]: Finished difference Result 2669 states and 8154 transitions. [2022-03-15 19:44:56,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:44:56,000 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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 31 [2022-03-15 19:44:56,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:56,005 INFO L225 Difference]: With dead ends: 2669 [2022-03-15 19:44:56,005 INFO L226 Difference]: Without dead ends: 2618 [2022-03-15 19:44:56,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 145 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=340, Invalid=1066, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:44:56,005 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:56,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 110 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:44:56,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2022-03-15 19:44:56,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2352. [2022-03-15 19:44:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 2351 states have (on average 3.196086771586559) internal successors, (7514), 2351 states have internal predecessors, (7514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 7514 transitions. [2022-03-15 19:44:56,036 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 7514 transitions. Word has length 31 [2022-03-15 19:44:56,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:56,036 INFO L470 AbstractCegarLoop]: Abstraction has 2352 states and 7514 transitions. [2022-03-15 19:44:56,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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:44:56,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 7514 transitions. [2022-03-15 19:44:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:44:56,040 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:56,040 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:56,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:56,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:56,249 INFO L402 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:56,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:56,249 INFO L85 PathProgramCache]: Analyzing trace with hash -749402894, now seen corresponding path program 113 times [2022-03-15 19:44:56,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:56,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162176155] [2022-03-15 19:44:56,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:56,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 73 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:56,354 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:56,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162176155] [2022-03-15 19:44:56,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162176155] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:56,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713950432] [2022-03-15 19:44:56,354 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:44:56,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:56,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:56,355 INFO L229 MonitoredProcess]: Starting monitored process 115 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:44:56,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2022-03-15 19:44:56,469 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-03-15 19:44:56,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:56,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:44:56,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 73 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:56,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 37 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:56,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713950432] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:56,897 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:56,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 24 [2022-03-15 19:44:56,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [369865826] [2022-03-15 19:44:56,897 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:56,900 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:56,917 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 170 transitions. [2022-03-15 19:44:56,917 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:57,349 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:44:57,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:44:57,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:57,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:44:57,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:44:57,350 INFO L87 Difference]: Start difference. First operand 2352 states and 7514 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 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:44:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:57,879 INFO L93 Difference]: Finished difference Result 3018 states and 8978 transitions. [2022-03-15 19:44:57,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:44:57,879 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 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 31 [2022-03-15 19:44:57,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:57,885 INFO L225 Difference]: With dead ends: 3018 [2022-03-15 19:44:57,885 INFO L226 Difference]: Without dead ends: 3014 [2022-03-15 19:44:57,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 112 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=242, Invalid=880, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:44:57,885 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 79 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:57,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 108 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:44:57,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2022-03-15 19:44:57,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 2386. [2022-03-15 19:44:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2386 states, 2385 states have (on average 3.2054507337526204) internal successors, (7645), 2385 states have internal predecessors, (7645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 7645 transitions. [2022-03-15 19:44:57,919 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 7645 transitions. Word has length 31 [2022-03-15 19:44:57,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:57,919 INFO L470 AbstractCegarLoop]: Abstraction has 2386 states and 7645 transitions. [2022-03-15 19:44:57,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 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:44:57,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 7645 transitions. [2022-03-15 19:44:57,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:44:57,923 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:57,923 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:57,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Ended with exit code 0 [2022-03-15 19:44:58,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2022-03-15 19:44:58,123 INFO L402 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:58,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:58,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1728826202, now seen corresponding path program 114 times [2022-03-15 19:44:58,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:58,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203466093] [2022-03-15 19:44:58,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:58,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 1 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:58,389 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:58,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203466093] [2022-03-15 19:44:58,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203466093] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:58,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003352161] [2022-03-15 19:44:58,389 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:44:58,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:58,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:58,391 INFO L229 MonitoredProcess]: Starting monitored process 116 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:44:58,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2022-03-15 19:44:58,513 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-03-15 19:44:58,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:58,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-15 19:44:58,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:58,905 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 1 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:58,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:01,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003352161] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:01,523 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:01,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 53 [2022-03-15 19:45:01,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [690234390] [2022-03-15 19:45:01,523 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:01,526 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:01,542 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 165 transitions. [2022-03-15 19:45:01,542 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:03,089 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [725963#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= ~counter~0 6) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 725966#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 725970#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= ~counter~0 2)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 725975#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= ~counter~0 2)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 725980#(and (or (not (< 6 ~M~0)) (<= ~counter~0 0)) (or (not (< 6 ~M~0)) (<= 0 ~counter~0))), 725965#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 725967#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 5) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 725974#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (<= ~counter~0 3) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 725971#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 1) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 725976#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 1) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 725969#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 3) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 725973#(and (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 4) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 725964#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (<= ~counter~0 6) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 725972#(and (or (<= 5 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 5) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 5 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 725978#(and (or (<= ~counter~0 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 725968#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 4) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 725977#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 725979#(and (or (not (< 6 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 6 ~M~0)) (<= ~counter~0 0)) (or (not (< 6 ~M~0)) (<= 0 ~counter~0)))] [2022-03-15 19:45:03,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:45:03,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:03,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:45:03,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=4513, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 19:45:03,090 INFO L87 Difference]: Start difference. First operand 2386 states and 7645 transitions. Second operand has 41 states, 41 states have (on average 2.682926829268293) internal successors, (110), 40 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:45:12,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:12,069 INFO L93 Difference]: Finished difference Result 5638 states and 15100 transitions. [2022-03-15 19:45:12,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2022-03-15 19:45:12,069 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.682926829268293) internal successors, (110), 40 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 31 [2022-03-15 19:45:12,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:12,077 INFO L225 Difference]: With dead ends: 5638 [2022-03-15 19:45:12,077 INFO L226 Difference]: Without dead ends: 5622 [2022-03-15 19:45:12,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11163 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=4865, Invalid=34537, Unknown=0, NotChecked=0, Total=39402 [2022-03-15 19:45:12,079 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 485 mSDsluCounter, 3122 mSDsCounter, 0 mSdLazyCounter, 6537 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 6960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 6537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:12,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 127 Invalid, 6960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 6537 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 19:45:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5622 states. [2022-03-15 19:45:12,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5622 to 2356. [2022-03-15 19:45:12,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 2355 states have (on average 3.1983014861995755) internal successors, (7532), 2355 states have internal predecessors, (7532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:12,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 7532 transitions. [2022-03-15 19:45:12,129 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 7532 transitions. Word has length 31 [2022-03-15 19:45:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:12,129 INFO L470 AbstractCegarLoop]: Abstraction has 2356 states and 7532 transitions. [2022-03-15 19:45:12,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.682926829268293) internal successors, (110), 40 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:45:12,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 7532 transitions. [2022-03-15 19:45:12,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:45:12,132 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:12,132 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:12,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Ended with exit code 0 [2022-03-15 19:45:12,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable115 [2022-03-15 19:45:12,333 INFO L402 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:12,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:12,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1245375438, now seen corresponding path program 115 times [2022-03-15 19:45:12,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:12,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046076640] [2022-03-15 19:45:12,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:12,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 3 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:12,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:12,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046076640] [2022-03-15 19:45:12,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046076640] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:12,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695906699] [2022-03-15 19:45:12,611 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:45:12,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:12,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:12,612 INFO L229 MonitoredProcess]: Starting monitored process 117 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:45:12,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2022-03-15 19:45:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:12,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 19:45:12,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 3 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:13,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:15,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695906699] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:15,396 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:15,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 56 [2022-03-15 19:45:15,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1331009503] [2022-03-15 19:45:15,396 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:15,398 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:15,416 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 165 transitions. [2022-03-15 19:45:15,416 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:17,099 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [736827#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (<= ~counter~0 3) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 736829#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 736824#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 5)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 736823#(and (or (<= ~counter~0 4) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 736822#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 5)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 5 ~counter~0))), 736835#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 736837#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 5 ~M~0)) (<= ~counter~0 0))), 736830#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 736834#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= ~counter~0 1)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 736826#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (<= ~counter~0 3) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 736831#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 2)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 736832#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 2)) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 736825#(and (or (<= ~counter~0 4) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 4 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 736838#(and (or (not (< 5 ~M~0)) (<= 0 ~counter~0)) (or (not (< 5 ~M~0)) (<= ~counter~0 0))), 736833#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= ~counter~0 1)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 736836#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 0 ~counter~0))), 736828#(< thread1Thread1of1ForFork0_~i~0 ~M~0)] [2022-03-15 19:45:17,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 19:45:17,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:17,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 19:45:17,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=4786, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 19:45:17,100 INFO L87 Difference]: Start difference. First operand 2356 states and 7532 transitions. Second operand has 40 states, 40 states have (on average 2.725) internal successors, (109), 39 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:45:26,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:26,310 INFO L93 Difference]: Finished difference Result 6294 states and 16296 transitions. [2022-03-15 19:45:26,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2022-03-15 19:45:26,310 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.725) internal successors, (109), 39 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 31 [2022-03-15 19:45:26,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:26,320 INFO L225 Difference]: With dead ends: 6294 [2022-03-15 19:45:26,320 INFO L226 Difference]: Without dead ends: 6282 [2022-03-15 19:45:26,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14371 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=5208, Invalid=40802, Unknown=0, NotChecked=0, Total=46010 [2022-03-15 19:45:26,322 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 410 mSDsluCounter, 2642 mSDsCounter, 0 mSdLazyCounter, 5258 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 5629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 5258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:26,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 115 Invalid, 5629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 5258 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 19:45:26,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6282 states. [2022-03-15 19:45:26,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6282 to 2406. [2022-03-15 19:45:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2406 states, 2405 states have (on average 3.197089397089397) internal successors, (7689), 2405 states have internal predecessors, (7689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 7689 transitions. [2022-03-15 19:45:26,367 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 7689 transitions. Word has length 31 [2022-03-15 19:45:26,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:26,367 INFO L470 AbstractCegarLoop]: Abstraction has 2406 states and 7689 transitions. [2022-03-15 19:45:26,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.725) internal successors, (109), 39 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:45:26,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 7689 transitions. [2022-03-15 19:45:26,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:45:26,370 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:26,370 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:26,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Ended with exit code 0 [2022-03-15 19:45:26,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116,117 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:26,571 INFO L402 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:26,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:26,571 INFO L85 PathProgramCache]: Analyzing trace with hash -872661734, now seen corresponding path program 116 times [2022-03-15 19:45:26,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:26,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955152139] [2022-03-15 19:45:26,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:26,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 6 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:26,816 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:26,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955152139] [2022-03-15 19:45:26,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955152139] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:26,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169350108] [2022-03-15 19:45:26,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:45:26,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:26,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:26,817 INFO L229 MonitoredProcess]: Starting monitored process 118 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:45:26,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2022-03-15 19:45:26,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:45:26,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:26,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 19:45:26,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 4 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:27,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:28,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169350108] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:28,911 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:28,911 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 56 [2022-03-15 19:45:28,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1527378099] [2022-03-15 19:45:28,911 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:28,913 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:28,945 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 165 transitions. [2022-03-15 19:45:28,945 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:30,362 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [748479#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (<= ~counter~0 0) (not (< 4 ~M~0)))), 748473#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 3) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 3 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 748472#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 4)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0))), 748475#(and (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 1) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 748477#(and (or (<= 0 ~counter~0) (not (< 4 ~M~0))) (or (<= ~counter~0 0) (not (< 4 ~M~0))) (or (not (< 4 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 748465#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 748476#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= ~counter~0 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 748470#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 2))), 748466#(or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)), 748471#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 1) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 748467#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 748469#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 3) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 748478#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= ~counter~0 0))), 748464#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 748468#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 4)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 748474#(and (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 2)))] [2022-03-15 19:45:30,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 19:45:30,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:30,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 19:45:30,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=596, Invalid=4660, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 19:45:30,363 INFO L87 Difference]: Start difference. First operand 2406 states and 7689 transitions. Second operand has 39 states, 39 states have (on average 2.769230769230769) internal successors, (108), 38 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:45:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:35,768 INFO L93 Difference]: Finished difference Result 6230 states and 15914 transitions. [2022-03-15 19:45:35,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-03-15 19:45:35,768 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.769230769230769) internal successors, (108), 38 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 31 [2022-03-15 19:45:35,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:35,776 INFO L225 Difference]: With dead ends: 6230 [2022-03-15 19:45:35,777 INFO L226 Difference]: Without dead ends: 6174 [2022-03-15 19:45:35,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8711 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=3880, Invalid=24850, Unknown=0, NotChecked=0, Total=28730 [2022-03-15 19:45:35,778 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 316 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 3159 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 3409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 3159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:35,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 69 Invalid, 3409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 3159 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:45:35,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6174 states. [2022-03-15 19:45:35,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6174 to 2368. [2022-03-15 19:45:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2367 states have (on average 3.2057456696239965) internal successors, (7588), 2367 states have internal predecessors, (7588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:35,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 7588 transitions. [2022-03-15 19:45:35,818 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 7588 transitions. Word has length 31 [2022-03-15 19:45:35,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:35,818 INFO L470 AbstractCegarLoop]: Abstraction has 2368 states and 7588 transitions. [2022-03-15 19:45:35,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.769230769230769) internal successors, (108), 38 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:45:35,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 7588 transitions. [2022-03-15 19:45:35,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:45:35,821 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:35,821 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:35,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Ended with exit code 0 [2022-03-15 19:45:36,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:36,021 INFO L402 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:36,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:36,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1242114062, now seen corresponding path program 117 times [2022-03-15 19:45:36,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:36,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698755661] [2022-03-15 19:45:36,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:36,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:36,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:36,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698755661] [2022-03-15 19:45:36,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698755661] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:36,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108539851] [2022-03-15 19:45:36,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:45:36,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:36,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:36,335 INFO L229 MonitoredProcess]: Starting monitored process 119 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:45:36,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2022-03-15 19:45:36,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 19:45:36,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:36,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 19:45:36,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:36,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:38,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108539851] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:38,111 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:38,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 58 [2022-03-15 19:45:38,112 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [283685215] [2022-03-15 19:45:38,112 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:38,114 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:38,145 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 165 transitions. [2022-03-15 19:45:38,145 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:40,034 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [759893#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (<= ~counter~0 0))), 759886#(and (or (<= ~counter~0 0) (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (or (<= ~counter~0 0) (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0))), 759889#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 1) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 759892#(and (or (<= 0 ~counter~0) (not (< 3 ~M~0))) (or (not (< 3 ~M~0)) (<= ~counter~0 0)) (or (not (< 3 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 759883#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 759879#(and (or (<= ~counter~0 3) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 759881#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (<= ~counter~0 3) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 3 ~counter~0))), 759884#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 759891#(and (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 759885#(and (or (<= ~counter~0 0) (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (<= ~counter~0 0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 759882#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= ~counter~0 2)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 759880#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= ~counter~0 2)) (or (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 759888#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 1 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)) (or (<= ~counter~0 1) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 759887#(and (or (<= ~counter~0 0) (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (<= ~counter~0 0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 759890#(and (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= ~counter~0 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:45:40,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 19:45:40,034 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:40,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 19:45:40,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=4801, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 19:45:40,035 INFO L87 Difference]: Start difference. First operand 2368 states and 7588 transitions. Second operand has 38 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 37 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:45:43,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:43,263 INFO L93 Difference]: Finished difference Result 5478 states and 14780 transitions. [2022-03-15 19:45:43,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-15 19:45:43,263 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 37 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 31 [2022-03-15 19:45:43,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:43,272 INFO L225 Difference]: With dead ends: 5478 [2022-03-15 19:45:43,272 INFO L226 Difference]: Without dead ends: 5446 [2022-03-15 19:45:43,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 61 SyntacticMatches, 11 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5899 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2138, Invalid=16222, Unknown=0, NotChecked=0, Total=18360 [2022-03-15 19:45:43,273 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 240 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 2061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:43,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 50 Invalid, 2061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:45:43,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5446 states. [2022-03-15 19:45:43,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5446 to 2368. [2022-03-15 19:45:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2367 states have (on average 3.2057456696239965) internal successors, (7588), 2367 states have internal predecessors, (7588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 7588 transitions. [2022-03-15 19:45:43,322 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 7588 transitions. Word has length 31 [2022-03-15 19:45:43,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:43,323 INFO L470 AbstractCegarLoop]: Abstraction has 2368 states and 7588 transitions. [2022-03-15 19:45:43,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 37 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:45:43,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 7588 transitions. [2022-03-15 19:45:43,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:45:43,325 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:43,325 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:43,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:43,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2022-03-15 19:45:43,526 INFO L402 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:43,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:43,526 INFO L85 PathProgramCache]: Analyzing trace with hash 604868314, now seen corresponding path program 118 times [2022-03-15 19:45:43,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:43,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095617188] [2022-03-15 19:45:43,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:43,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:43,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:43,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095617188] [2022-03-15 19:45:43,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095617188] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:43,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427970442] [2022-03-15 19:45:43,768 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:45:43,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:43,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:43,769 INFO L229 MonitoredProcess]: Starting monitored process 120 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:45:43,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2022-03-15 19:45:43,882 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:45:43,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:43,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 19:45:43,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:44,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:45,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427970442] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:45,392 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:45,392 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 60 [2022-03-15 19:45:45,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [576017885] [2022-03-15 19:45:45,392 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:45,395 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:45,411 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 165 transitions. [2022-03-15 19:45:45,411 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:46,904 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [770476#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 770485#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 0))), 770482#(and (or (<= ~counter~0 0) (not (< 2 ~M~0))) (or (<= 0 ~counter~0) (not (< 2 ~M~0))) (or (not (< 2 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 770477#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 770478#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 770474#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 770480#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 1) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 770473#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 770486#(and (or (<= ~counter~0 0) (not (< 2 ~M~0))) (or (<= 0 ~counter~0) (not (< 2 ~M~0)))), 770475#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 770484#(and (or (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 1) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 770481#(and (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= ~counter~0 0))), 770483#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 2)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0))), 770479#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 2)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))))] [2022-03-15 19:45:46,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 19:45:46,904 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:46,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 19:45:46,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=639, Invalid=4911, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 19:45:46,905 INFO L87 Difference]: Start difference. First operand 2368 states and 7588 transitions. Second operand has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:49,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:49,359 INFO L93 Difference]: Finished difference Result 5174 states and 14613 transitions. [2022-03-15 19:45:49,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-15 19:45:49,359 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:45:49,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:49,367 INFO L225 Difference]: With dead ends: 5174 [2022-03-15 19:45:49,367 INFO L226 Difference]: Without dead ends: 5122 [2022-03-15 19:45:49,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5321 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2052, Invalid=14718, Unknown=0, NotChecked=0, Total=16770 [2022-03-15 19:45:49,369 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 208 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:49,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 43 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1537 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:45:49,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5122 states. [2022-03-15 19:45:49,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5122 to 2376. [2022-03-15 19:45:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 2375 states have (on average 3.2033684210526316) internal successors, (7608), 2375 states have internal predecessors, (7608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 7608 transitions. [2022-03-15 19:45:49,411 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 7608 transitions. Word has length 31 [2022-03-15 19:45:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:49,412 INFO L470 AbstractCegarLoop]: Abstraction has 2376 states and 7608 transitions. [2022-03-15 19:45:49,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 7608 transitions. [2022-03-15 19:45:49,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:45:49,414 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:49,414 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:49,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Ended with exit code 0 [2022-03-15 19:45:49,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 120 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable119 [2022-03-15 19:45:49,615 INFO L402 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:49,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:49,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1508441010, now seen corresponding path program 119 times [2022-03-15 19:45:49,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:49,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605320860] [2022-03-15 19:45:49,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:49,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:49,852 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:49,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605320860] [2022-03-15 19:45:49,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605320860] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:49,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432410981] [2022-03-15 19:45:49,852 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:45:49,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:49,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:49,854 INFO L229 MonitoredProcess]: Starting monitored process 121 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:45:49,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2022-03-15 19:45:49,968 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:45:49,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:49,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 19:45:49,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:50,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:51,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432410981] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:51,111 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:51,112 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 59 [2022-03-15 19:45:51,112 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [816143594] [2022-03-15 19:45:51,112 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:51,114 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:51,130 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 165 transitions. [2022-03-15 19:45:51,130 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:52,625 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [780770#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 1 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 1)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))), 780771#(and (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 780763#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 780769#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 780774#(and (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= ~counter~0 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 780768#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 780773#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 1 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 1)) (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)))), 780764#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 780775#(and (or (not (< 1 ~M~0)) (<= ~counter~0 0)) (or (not (< 1 ~M~0)) (<= 0 ~counter~0))), 780765#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 780766#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 780772#(and (or (not (< 1 ~M~0)) (<= ~counter~0 0)) (or (not (< 1 ~M~0)) (<= 0 ~counter~0)) (or (not (< 1 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0))), 780767#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)))] [2022-03-15 19:45:52,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 19:45:52,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:52,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 19:45:52,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=698, Invalid=4558, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 19:45:52,627 INFO L87 Difference]: Start difference. First operand 2376 states and 7608 transitions. Second operand has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 35 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:45:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:54,285 INFO L93 Difference]: Finished difference Result 4418 states and 12851 transitions. [2022-03-15 19:45:54,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 19:45:54,285 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 35 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 31 [2022-03-15 19:45:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:54,292 INFO L225 Difference]: With dead ends: 4418 [2022-03-15 19:45:54,292 INFO L226 Difference]: Without dead ends: 4334 [2022-03-15 19:45:54,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 65 SyntacticMatches, 8 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4558 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1795, Invalid=10861, Unknown=0, NotChecked=0, Total=12656 [2022-03-15 19:45:54,293 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 198 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:54,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 37 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:45:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4334 states. [2022-03-15 19:45:54,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4334 to 2378. [2022-03-15 19:45:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2378 states, 2377 states have (on average 3.202776609171224) internal successors, (7613), 2377 states have internal predecessors, (7613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 7613 transitions. [2022-03-15 19:45:54,326 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 7613 transitions. Word has length 31 [2022-03-15 19:45:54,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:54,326 INFO L470 AbstractCegarLoop]: Abstraction has 2378 states and 7613 transitions. [2022-03-15 19:45:54,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 35 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:45:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 7613 transitions. [2022-03-15 19:45:54,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:45:54,329 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:54,329 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:54,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:54,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,121 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:54,532 INFO L402 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:54,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:54,532 INFO L85 PathProgramCache]: Analyzing trace with hash -421543782, now seen corresponding path program 120 times [2022-03-15 19:45:54,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:54,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56084966] [2022-03-15 19:45:54,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:54,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:54,763 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:54,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56084966] [2022-03-15 19:45:54,763 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56084966] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:54,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818548359] [2022-03-15 19:45:54,763 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:45:54,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:54,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:54,765 INFO L229 MonitoredProcess]: Starting monitored process 122 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:45:54,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2022-03-15 19:45:54,891 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:45:54,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:54,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 19:45:54,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:55,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:55,957 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:55,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818548359] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:55,958 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:55,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 60 [2022-03-15 19:45:55,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1395974883] [2022-03-15 19:45:55,958 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:55,960 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:55,975 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 165 transitions. [2022-03-15 19:45:55,976 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:57,459 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [790276#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 790273#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 790282#(and (or (not (< 0 ~M~0)) (<= ~counter~0 0)) (or (not (< 0 ~M~0)) (<= 0 ~counter~0))), 790278#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 7 ~counter~0))), 790281#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 0))), 790280#(and (or (not (< 0 ~M~0)) (<= ~counter~0 0)) (or (not (< 0 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 0 ~M~0)) (<= 0 ~counter~0))), 790279#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 0 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= ~counter~0 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0))), 790277#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 790272#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 790271#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 790275#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 790274#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0)))] [2022-03-15 19:45:57,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 19:45:57,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:57,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 19:45:57,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=4512, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 19:45:57,460 INFO L87 Difference]: Start difference. First operand 2378 states and 7613 transitions. Second operand has 35 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 34 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:45:58,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:58,701 INFO L93 Difference]: Finished difference Result 4380 states and 13095 transitions. [2022-03-15 19:45:58,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 19:45:58,701 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 34 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 31 [2022-03-15 19:45:58,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:58,709 INFO L225 Difference]: With dead ends: 4380 [2022-03-15 19:45:58,709 INFO L226 Difference]: Without dead ends: 4276 [2022-03-15 19:45:58,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1838, Invalid=9934, Unknown=0, NotChecked=0, Total=11772 [2022-03-15 19:45:58,710 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 189 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:58,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 23 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:45:58,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2022-03-15 19:45:58,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 2872. [2022-03-15 19:45:58,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2872 states, 2871 states have (on average 3.1898293277603624) internal successors, (9158), 2871 states have internal predecessors, (9158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:58,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2872 states to 2872 states and 9158 transitions. [2022-03-15 19:45:58,758 INFO L78 Accepts]: Start accepts. Automaton has 2872 states and 9158 transitions. Word has length 31 [2022-03-15 19:45:58,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:58,758 INFO L470 AbstractCegarLoop]: Abstraction has 2872 states and 9158 transitions. [2022-03-15 19:45:58,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 34 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:45:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2872 states and 9158 transitions. [2022-03-15 19:45:58,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:45:58,763 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:58,763 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:58,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Ended with exit code 0 [2022-03-15 19:45:58,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:58,964 INFO L402 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:58,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:58,964 INFO L85 PathProgramCache]: Analyzing trace with hash -648701217, now seen corresponding path program 121 times [2022-03-15 19:45:58,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:58,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955601074] [2022-03-15 19:45:58,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:58,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:59,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:59,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955601074] [2022-03-15 19:45:59,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955601074] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:59,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954884297] [2022-03-15 19:45:59,188 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:45:59,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:59,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:59,189 INFO L229 MonitoredProcess]: Starting monitored process 123 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:45:59,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2022-03-15 19:45:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:59,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:45:59,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:59,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:01,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954884297] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:01,101 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:01,101 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 56 [2022-03-15 19:46:01,101 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2084600626] [2022-03-15 19:46:01,102 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:01,104 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:01,128 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 280 transitions. [2022-03-15 19:46:01,129 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:03,869 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [800738#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 10) ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4))) (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)) (<= 5 ~counter~0))), 800726#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 800737#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 10) ~M~0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0))) (or (<= 6 ~counter~0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)))), 800749#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 10) ~M~0) (<= ~M~0 9)) (or (<= 0 ~counter~0) (<= ~M~0 9))), 800752#(or (<= 0 ~counter~0) (<= ~M~0 9)), 800727#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 800730#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 800731#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 800742#(and (or (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)) (<= 10 ~M~0)) (or (<= 6 ~counter~0) (<= ~M~0 (+ 3 thread1Thread1of1ForFork0_~i~0)))), 800735#(and (or (<= 7 ~counter~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 10) ~M~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0)))), 800745#(and (or (<= ~M~0 (+ 6 thread1Thread1of1ForFork0_~i~0)) (<= 10 ~M~0)) (or (<= ~M~0 (+ 6 thread1Thread1of1ForFork0_~i~0)) (<= 3 ~counter~0))), 800721#(and (or (<= 9 ~counter~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 10) ~M~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0))), 800722#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 10) ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))) (or (<= 8 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)))), 800728#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 800733#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 8 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ thread2Thread1of1ForFork1_~i~1 8) ~M~0))), 800741#(and (or (<= 2 ~counter~0) (<= ~M~0 (+ 7 thread1Thread1of1ForFork0_~i~0))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 10) ~M~0) (<= ~M~0 (+ 7 thread1Thread1of1ForFork0_~i~0)))), 800740#(and (or (<= ~M~0 (+ 6 thread1Thread1of1ForFork0_~i~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 10) ~M~0)) (or (<= ~M~0 (+ 6 thread1Thread1of1ForFork0_~i~0)) (<= 3 ~counter~0))), 800747#(and (or (<= 1 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 8))) (or (<= (+ thread2Thread1of1ForFork1_~i~1 10) ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 8)))), 800751#(and (or (<= ~M~0 (+ 9 thread1Thread1of1ForFork0_~i~0)) (<= 10 ~M~0)) (or (<= 0 ~counter~0) (<= ~M~0 (+ 9 thread1Thread1of1ForFork0_~i~0)))), 800725#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 800734#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (or (<= (+ 9 thread2Thread1of1ForFork1_~i~1) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 800729#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 800736#(and (or (<= 7 ~counter~0) (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))) (or (<= ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0)) (<= 10 ~M~0))), 800744#(and (or (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)) (<= 4 ~counter~0)) (or (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)) (<= 10 ~M~0))), 800723#(and (or (<= 9 ~counter~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)) (or (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 10 ~M~0))), 800750#(and (or (<= 1 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 8))) (or (<= 10 ~M~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 8)))), 800732#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 7 ~counter~0))), 800724#(and (or (<= 8 ~counter~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))) (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (<= 10 ~M~0))), 800739#(and (or (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 10) ~M~0) (<= ~M~0 (+ 5 thread1Thread1of1ForFork0_~i~0)))), 800746#(and (or (<= ~M~0 (+ 7 thread1Thread1of1ForFork0_~i~0)) (<= 10 ~M~0)) (or (<= 2 ~counter~0) (<= ~M~0 (+ 7 thread1Thread1of1ForFork0_~i~0)))), 800743#(and (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)) (<= 5 ~counter~0)) (or (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 4)) (<= 10 ~M~0))), 800748#(and (or (<= (+ thread2Thread1of1ForFork1_~i~1 10) ~M~0) (<= ~M~0 (+ 9 thread1Thread1of1ForFork0_~i~0))) (or (<= 0 ~counter~0) (<= ~M~0 (+ 9 thread1Thread1of1ForFork0_~i~0))))] [2022-03-15 19:46:03,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-15 19:46:03,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:03,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-15 19:46:03,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1079, Invalid=6577, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 19:46:03,870 INFO L87 Difference]: Start difference. First operand 2872 states and 9158 transitions. Second operand has 56 states, 56 states have (on average 3.0892857142857144) internal successors, (173), 55 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:14,766 INFO L93 Difference]: Finished difference Result 9040 states and 24313 transitions. [2022-03-15 19:46:14,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 279 states. [2022-03-15 19:46:14,766 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 3.0892857142857144) internal successors, (173), 55 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:46:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:14,779 INFO L225 Difference]: With dead ends: 9040 [2022-03-15 19:46:14,779 INFO L226 Difference]: Without dead ends: 9040 [2022-03-15 19:46:14,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 103 SyntacticMatches, 9 SemanticMatches, 351 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49119 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=29978, Invalid=94278, Unknown=0, NotChecked=0, Total=124256 [2022-03-15 19:46:14,784 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 607 mSDsluCounter, 1988 mSDsCounter, 0 mSdLazyCounter, 4211 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 4500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 4211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:14,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [607 Valid, 73 Invalid, 4500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 4211 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 19:46:14,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9040 states. [2022-03-15 19:46:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9040 to 3020. [2022-03-15 19:46:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3020 states, 3019 states have (on average 3.2027161311692613) internal successors, (9669), 3019 states have internal predecessors, (9669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 9669 transitions. [2022-03-15 19:46:14,867 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 9669 transitions. Word has length 32 [2022-03-15 19:46:14,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:14,868 INFO L470 AbstractCegarLoop]: Abstraction has 3020 states and 9669 transitions. [2022-03-15 19:46:14,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 3.0892857142857144) internal successors, (173), 55 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 9669 transitions. [2022-03-15 19:46:14,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:46:14,871 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:14,871 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:14,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Ended with exit code 0 [2022-03-15 19:46:15,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:15,072 INFO L402 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:15,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:15,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1880823817, now seen corresponding path program 122 times [2022-03-15 19:46:15,073 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:15,073 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691889876] [2022-03-15 19:46:15,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:15,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 28 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:15,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:15,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691889876] [2022-03-15 19:46:15,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691889876] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:15,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511020291] [2022-03-15 19:46:15,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:46:15,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:15,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:15,300 INFO L229 MonitoredProcess]: Starting monitored process 124 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:46:15,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2022-03-15 19:46:15,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:46:15,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:15,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:46:15,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:15,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:16,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511020291] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:16,840 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:16,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 57 [2022-03-15 19:46:16,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [274123339] [2022-03-15 19:46:16,840 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:16,842 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:16,865 INFO L252 McrAutomatonBuilder]: Finished intersection with 132 states and 249 transitions. [2022-03-15 19:46:16,865 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:19,348 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [816625#(and (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 816627#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 ~counter~0))), 816614#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 816618#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 816629#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 816634#(or (<= 0 ~counter~0) (not (< 8 ~M~0))), 816608#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 6 ~counter~0))), 816613#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 816611#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 816630#(and (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 816631#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 816628#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0))), 816617#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 816623#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 816624#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 816606#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 8) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 8 ~counter~0))), 816612#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 816619#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 7 ~counter~0))), 816621#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 816610#(and (or (<= 7 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 7 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 816616#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 816615#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 816607#(and (or (<= 7 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 816632#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 ~counter~0))), 816620#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 8 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ thread2Thread1of1ForFork1_~i~1 8) ~M~0))), 816622#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0))), 816609#(and (or (<= 8 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 8 ~counter~0))), 816633#(and (or (not (< 8 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 8 ~M~0)))), 816626#(and (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:46:19,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-15 19:46:19,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:19,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-15 19:46:19,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=973, Invalid=6337, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 19:46:19,349 INFO L87 Difference]: Start difference. First operand 3020 states and 9669 transitions. Second operand has 53 states, 53 states have (on average 3.0) internal successors, (159), 52 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:28,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:28,560 INFO L93 Difference]: Finished difference Result 11494 states and 29326 transitions. [2022-03-15 19:46:28,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2022-03-15 19:46:28,560 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.0) internal successors, (159), 52 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:46:28,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:28,580 INFO L225 Difference]: With dead ends: 11494 [2022-03-15 19:46:28,580 INFO L226 Difference]: Without dead ends: 11230 [2022-03-15 19:46:28,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 91 SyntacticMatches, 9 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32897 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=20041, Invalid=66101, Unknown=0, NotChecked=0, Total=86142 [2022-03-15 19:46:28,583 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 738 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 3653 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 3929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 3653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:28,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [738 Valid, 62 Invalid, 3929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 3653 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:46:28,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11230 states. [2022-03-15 19:46:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11230 to 3200. [2022-03-15 19:46:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3200 states, 3199 states have (on average 3.222569552985308) internal successors, (10309), 3199 states have internal predecessors, (10309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3200 states to 3200 states and 10309 transitions. [2022-03-15 19:46:28,671 INFO L78 Accepts]: Start accepts. Automaton has 3200 states and 10309 transitions. Word has length 32 [2022-03-15 19:46:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:28,671 INFO L470 AbstractCegarLoop]: Abstraction has 3200 states and 10309 transitions. [2022-03-15 19:46:28,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.0) internal successors, (159), 52 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 3200 states and 10309 transitions. [2022-03-15 19:46:28,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:46:28,676 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:28,676 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:28,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:28,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2022-03-15 19:46:28,877 INFO L402 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:28,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:28,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1435411959, now seen corresponding path program 123 times [2022-03-15 19:46:28,878 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:28,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832652166] [2022-03-15 19:46:28,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:28,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 28 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:29,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:29,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832652166] [2022-03-15 19:46:29,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832652166] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:29,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115391556] [2022-03-15 19:46:29,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:46:29,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:29,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:29,093 INFO L229 MonitoredProcess]: Starting monitored process 125 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:46:29,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-03-15 19:46:29,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:46:29,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:29,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 19:46:29,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 44 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:29,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:30,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115391556] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:30,040 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:30,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 57 [2022-03-15 19:46:30,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [520344487] [2022-03-15 19:46:30,040 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:30,042 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:30,064 INFO L252 McrAutomatonBuilder]: Finished intersection with 128 states and 240 transitions. [2022-03-15 19:46:30,064 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:32,494 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [835205#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 835210#(and (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 835213#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 835209#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 7 ~counter~0))), 835201#(and (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 835199#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 835198#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0))), 835206#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 835193#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 835195#(and (or (<= 7 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 7 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 835192#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 835200#(and (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 835197#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0))), 835204#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 835202#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 835208#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 835188#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 8) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 8 ~counter~0))), 835207#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 835190#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 6 ~counter~0))), 835191#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 835189#(and (or (<= 7 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 835214#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 ~counter~0))), 835194#(and (or (<= 8 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 8 ~counter~0))), 835212#(and (or (not (< 8 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 8 ~M~0)))), 835215#(or (<= 0 ~counter~0) (not (< 8 ~M~0))), 835203#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 835196#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 835211#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 ~counter~0)))] [2022-03-15 19:46:32,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 19:46:32,494 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:32,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 19:46:32,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=927, Invalid=6213, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 19:46:32,495 INFO L87 Difference]: Start difference. First operand 3200 states and 10309 transitions. Second operand has 52 states, 52 states have (on average 2.9615384615384617) internal successors, (154), 51 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:46:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:42,612 INFO L93 Difference]: Finished difference Result 13004 states and 32719 transitions. [2022-03-15 19:46:42,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2022-03-15 19:46:42,612 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.9615384615384617) internal successors, (154), 51 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 32 [2022-03-15 19:46:42,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:42,630 INFO L225 Difference]: With dead ends: 13004 [2022-03-15 19:46:42,630 INFO L226 Difference]: Without dead ends: 12524 [2022-03-15 19:46:42,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 87 SyntacticMatches, 10 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33475 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=21107, Invalid=67995, Unknown=0, NotChecked=0, Total=89102 [2022-03-15 19:46:42,634 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 844 mSDsluCounter, 2042 mSDsCounter, 0 mSdLazyCounter, 4617 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 4885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 4617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:42,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [844 Valid, 69 Invalid, 4885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 4617 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 19:46:42,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12524 states. [2022-03-15 19:46:42,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12524 to 3172. [2022-03-15 19:46:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3172 states, 3171 states have (on average 3.220119836013876) internal successors, (10211), 3171 states have internal predecessors, (10211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 10211 transitions. [2022-03-15 19:46:42,752 INFO L78 Accepts]: Start accepts. Automaton has 3172 states and 10211 transitions. Word has length 32 [2022-03-15 19:46:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:42,752 INFO L470 AbstractCegarLoop]: Abstraction has 3172 states and 10211 transitions. [2022-03-15 19:46:42,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.9615384615384617) internal successors, (154), 51 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:46:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3172 states and 10211 transitions. [2022-03-15 19:46:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:46:42,757 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:42,757 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:42,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:42,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2022-03-15 19:46:42,958 INFO L402 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:42,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:42,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1958029303, now seen corresponding path program 124 times [2022-03-15 19:46:42,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:42,959 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770655425] [2022-03-15 19:46:42,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:42,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 28 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:43,211 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:43,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770655425] [2022-03-15 19:46:43,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770655425] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:43,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532216574] [2022-03-15 19:46:43,211 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:46:43,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:43,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:43,212 INFO L229 MonitoredProcess]: Starting monitored process 126 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:46:43,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-03-15 19:46:43,357 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:46:43,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:43,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:46:43,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:43,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:44,412 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:44,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532216574] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:44,412 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:44,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 56 [2022-03-15 19:46:44,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [533829268] [2022-03-15 19:46:44,413 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:44,415 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:44,458 INFO L252 McrAutomatonBuilder]: Finished intersection with 124 states and 231 transitions. [2022-03-15 19:46:44,458 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:46,681 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [855259#(and (or (<= 0 ~counter~0) (not (< 8 ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 8 ~M~0)))), 855241#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 855250#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 855245#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 855238#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 855252#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 855254#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0))), 855248#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 855253#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0))), 855260#(or (<= 0 ~counter~0) (not (< 8 ~M~0))), 855237#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 855251#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 ~counter~0))), 855242#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 855240#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 855234#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 8 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 8 ~counter~0))), 855258#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 ~counter~0))), 855235#(and (or (<= 8 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 8 ~counter~0))), 855247#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0))), 855257#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 855236#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 855244#(and (or (<= 7 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 7 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 855243#(and (or (<= 7 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 7 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 855255#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 855239#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 855256#(and (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 855246#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 855249#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:46:46,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 19:46:46,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:46,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 19:46:46,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=6016, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 19:46:46,682 INFO L87 Difference]: Start difference. First operand 3172 states and 10211 transitions. Second operand has 51 states, 51 states have (on average 2.9215686274509802) internal successors, (149), 50 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:55,942 INFO L93 Difference]: Finished difference Result 10918 states and 28898 transitions. [2022-03-15 19:46:55,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2022-03-15 19:46:55,942 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.9215686274509802) internal successors, (149), 50 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:46:55,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:55,960 INFO L225 Difference]: With dead ends: 10918 [2022-03-15 19:46:55,961 INFO L226 Difference]: Without dead ends: 10806 [2022-03-15 19:46:55,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 89 SyntacticMatches, 6 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38034 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=22014, Invalid=73776, Unknown=0, NotChecked=0, Total=95790 [2022-03-15 19:46:55,965 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 586 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 4167 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 4327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 4167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:55,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [586 Valid, 64 Invalid, 4327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 4167 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 19:46:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10806 states. [2022-03-15 19:46:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10806 to 3244. [2022-03-15 19:46:56,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3244 states, 3243 states have (on average 3.2189330866481654) internal successors, (10439), 3243 states have internal predecessors, (10439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 10439 transitions. [2022-03-15 19:46:56,065 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 10439 transitions. Word has length 32 [2022-03-15 19:46:56,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:56,065 INFO L470 AbstractCegarLoop]: Abstraction has 3244 states and 10439 transitions. [2022-03-15 19:46:56,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.9215686274509802) internal successors, (149), 50 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:56,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 10439 transitions. [2022-03-15 19:46:56,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:46:56,069 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:56,069 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:56,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Ended with exit code 0 [2022-03-15 19:46:56,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2022-03-15 19:46:56,270 INFO L402 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:56,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1974887927, now seen corresponding path program 125 times [2022-03-15 19:46:56,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:56,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035147046] [2022-03-15 19:46:56,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:56,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 28 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:56,487 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:56,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035147046] [2022-03-15 19:46:56,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035147046] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:56,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376061445] [2022-03-15 19:46:56,487 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:46:56,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:56,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:56,488 INFO L229 MonitoredProcess]: Starting monitored process 127 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:46:56,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2022-03-15 19:46:56,608 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:46:56,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:56,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:46:56,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 42 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:56,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:57,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376061445] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:57,835 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:57,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 57 [2022-03-15 19:46:57,836 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1317699448] [2022-03-15 19:46:57,836 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:57,838 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:57,858 INFO L252 McrAutomatonBuilder]: Finished intersection with 120 states and 222 transitions. [2022-03-15 19:46:57,858 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:59,935 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [873369#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 873386#(and (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 873365#(and (or (<= 7 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 7 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 873382#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 873364#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 8 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 8 ~counter~0))), 873373#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 873384#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0))), 873371#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 873381#(and (or (<= 7 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 7 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 873366#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 873380#(and (or (<= 8 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 8 ~counter~0))), 873389#(or (<= 0 ~counter~0) (not (< 8 ~M~0))), 873374#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 873378#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 ~counter~0))), 873379#(and (or (<= 0 ~counter~0) (not (< 8 ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 8 ~M~0)))), 873367#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 873377#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 873388#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 ~counter~0))), 873370#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 873385#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 873375#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 5 ~counter~0))), 873383#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0))), 873376#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 873368#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0))), 873372#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 873387#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:46:59,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 19:46:59,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:59,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 19:46:59,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=5857, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 19:46:59,936 INFO L87 Difference]: Start difference. First operand 3244 states and 10439 transitions. Second operand has 50 states, 50 states have (on average 2.88) internal successors, (144), 49 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:47:09,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:09,464 INFO L93 Difference]: Finished difference Result 10892 states and 28583 transitions. [2022-03-15 19:47:09,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2022-03-15 19:47:09,464 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.88) internal successors, (144), 49 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 32 [2022-03-15 19:47:09,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:09,481 INFO L225 Difference]: With dead ends: 10892 [2022-03-15 19:47:09,481 INFO L226 Difference]: Without dead ends: 10808 [2022-03-15 19:47:09,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43427 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=24597, Invalid=81353, Unknown=0, NotChecked=0, Total=105950 [2022-03-15 19:47:09,484 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 644 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 3916 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 4079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 3916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:09,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [644 Valid, 65 Invalid, 4079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 3916 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:47:09,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10808 states. [2022-03-15 19:47:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10808 to 3336. [2022-03-15 19:47:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3336 states, 3335 states have (on average 3.223088455772114) internal successors, (10749), 3335 states have internal predecessors, (10749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 10749 transitions. [2022-03-15 19:47:09,565 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 10749 transitions. Word has length 32 [2022-03-15 19:47:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:09,565 INFO L470 AbstractCegarLoop]: Abstraction has 3336 states and 10749 transitions. [2022-03-15 19:47:09,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.88) internal successors, (144), 49 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:47:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 10749 transitions. [2022-03-15 19:47:09,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:47:09,570 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:09,570 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:09,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Ended with exit code 0 [2022-03-15 19:47:09,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126,127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:09,775 INFO L402 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:09,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:09,776 INFO L85 PathProgramCache]: Analyzing trace with hash -795514889, now seen corresponding path program 126 times [2022-03-15 19:47:09,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:09,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362150551] [2022-03-15 19:47:09,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:09,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 28 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:09,992 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:09,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362150551] [2022-03-15 19:47:09,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362150551] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:09,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097412245] [2022-03-15 19:47:09,992 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:47:09,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:09,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:09,994 INFO L229 MonitoredProcess]: Starting monitored process 128 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:47:09,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2022-03-15 19:47:10,127 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:47:10,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:10,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:47:10,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:10,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:11,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097412245] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:11,353 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:11,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 57 [2022-03-15 19:47:11,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1280613362] [2022-03-15 19:47:11,353 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:11,355 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:11,376 INFO L252 McrAutomatonBuilder]: Finished intersection with 116 states and 213 transitions. [2022-03-15 19:47:11,376 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:13,247 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [891683#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 8) thread1Thread1of1ForFork0_~i~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 8 ~counter~0))), 891686#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 5 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 891693#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 891699#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 891684#(and (or (<= 7 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)) (<= (+ 7 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0))), 891705#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 ~counter~0))), 891690#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 891696#(and (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 891707#(or (<= 0 ~counter~0) (not (< 8 ~M~0))), 891692#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0))), 891697#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 ~counter~0))), 891688#(and (or (<= 8 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 8 ~counter~0))), 891694#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 891704#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 891701#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 891687#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)))), 891702#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 4 ~counter~0)) (or (<= (+ thread2Thread1of1ForFork1_~i~1 4) ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 891685#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= (+ 6 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 6 ~counter~0))), 891700#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 891695#(and (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= (+ 2 thread2Thread1of1ForFork1_~i~1) thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 891698#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 891706#(and (or (not (< 8 ~M~0)) (<= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 8 ~M~0)))), 891689#(and (or (<= 7 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 7 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 891703#(and (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 891691#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)))] [2022-03-15 19:47:13,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-15 19:47:13,248 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:13,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-15 19:47:13,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=898, Invalid=5744, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 19:47:13,251 INFO L87 Difference]: Start difference. First operand 3336 states and 10749 transitions. Second operand has 49 states, 49 states have (on average 2.836734693877551) internal successors, (139), 48 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:47:23,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:23,583 INFO L93 Difference]: Finished difference Result 11450 states and 28967 transitions. [2022-03-15 19:47:23,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2022-03-15 19:47:23,584 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.836734693877551) internal successors, (139), 48 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 32 [2022-03-15 19:47:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:23,600 INFO L225 Difference]: With dead ends: 11450 [2022-03-15 19:47:23,600 INFO L226 Difference]: Without dead ends: 11310 [2022-03-15 19:47:23,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 81 SyntacticMatches, 7 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36569 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=22373, Invalid=74659, Unknown=0, NotChecked=0, Total=97032 [2022-03-15 19:47:23,603 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 838 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 3725 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 3967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 3725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:23,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [838 Valid, 68 Invalid, 3967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 3725 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:47:23,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11310 states. [2022-03-15 19:47:23,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11310 to 3246. [2022-03-15 19:47:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 3245 states have (on average 3.214175654853621) internal successors, (10430), 3245 states have internal predecessors, (10430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 10430 transitions. [2022-03-15 19:47:23,686 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 10430 transitions. Word has length 32 [2022-03-15 19:47:23,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:23,686 INFO L470 AbstractCegarLoop]: Abstraction has 3246 states and 10430 transitions. [2022-03-15 19:47:23,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.836734693877551) internal successors, (139), 48 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:47:23,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 10430 transitions. [2022-03-15 19:47:23,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:47:23,690 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:23,690 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:23,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Ended with exit code 0 [2022-03-15 19:47:23,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127,128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:23,903 INFO L402 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:23,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:23,904 INFO L85 PathProgramCache]: Analyzing trace with hash -53598729, now seen corresponding path program 127 times [2022-03-15 19:47:23,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:23,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121322895] [2022-03-15 19:47:23,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:23,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 28 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:24,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:24,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121322895] [2022-03-15 19:47:24,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121322895] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:24,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360580747] [2022-03-15 19:47:24,140 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:47:24,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:24,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:24,141 INFO L229 MonitoredProcess]: Starting monitored process 129 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:47:24,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2022-03-15 19:47:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:24,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:47:24,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:24,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:25,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360580747] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:25,629 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:25,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 57 [2022-03-15 19:47:25,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1193592588] [2022-03-15 19:47:25,630 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:25,632 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:25,651 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 204 transitions. [2022-03-15 19:47:25,652 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:27,496 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [910362#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0))), 910357#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0))), 910360#(and (or (<= 7 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 7 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 910363#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M~0)) (<= 4 thread1Thread1of1ForFork0_~i~0))), 910369#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 910373#(and (or (<= 0 ~counter~0) (not (< 8 ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 8 ~M~0)))), 910358#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 910376#(or (<= 0 ~counter~0) (not (< 8 ~M~0))), 910364#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 3 ~counter~0))), 910374#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 910354#(and (or (<= 7 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (<= 7 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M~0)))), 910371#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 ~counter~0))), 910367#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0))), 910365#(< thread1Thread1of1ForFork0_~i~0 ~M~0), 910375#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M~0)) (<= 0 ~counter~0))), 910359#(and (or (<= 8 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 8 ~counter~0))), 910353#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 8 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M~0)) (<= 8 ~counter~0))), 910368#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= (+ 3 thread2Thread1of1ForFork1_~i~1) ~M~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M~0) (<= 3 ~counter~0))), 910355#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 910356#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 ~counter~0)) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 5 thread1Thread1of1ForFork0_~i~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 910372#(and (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 2 thread1Thread1of1ForFork0_~i~0)) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M~0)))), 910366#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread1Thread1of1ForFork0_~i~0 ~M~0)), 910370#(and (or (<= 1 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 910361#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0)) (<= 6 ~counter~0)) (or (<= 6 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M~0))))] [2022-03-15 19:47:27,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-15 19:47:27,497 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:27,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-15 19:47:27,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=966, Invalid=5514, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 19:47:27,498 INFO L87 Difference]: Start difference. First operand 3246 states and 10430 transitions. Second operand has 48 states, 48 states have (on average 2.7916666666666665) internal successors, (134), 47 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 19:47:33,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2022-03-15 19:47:33,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23079 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=14106, Invalid=51686, Unknown=0, NotChecked=0, Total=65792 [2022-03-15 19:47:33,702 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 331 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 1979 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 2133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:33,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 60 Invalid, 2133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1979 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:47:33,703 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-03-15 19:47:33,709 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:47:33,711 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:47:33,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Ended with exit code 0 [2022-03-15 19:47:33,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 129 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2022-03-15 19:47:33,910 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (3246states) and FLOYD_HOARE automaton (currently 190 states, 48 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 257 known predicates. [2022-03-15 19:47:33,911 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 19:47:33,912 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 19:47:33,913 INFO L732 BasicCegarLoop]: Path program histogram: [127, 1, 1] [2022-03-15 19:47:33,914 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:47:33,914 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:47:33,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:47:33 BasicIcfg [2022-03-15 19:47:33,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:47:33,916 INFO L158 Benchmark]: Toolchain (without parser) took 726530.57ms. Allocated memory was 184.5MB in the beginning and 621.8MB in the end (delta: 437.3MB). Free memory was 130.2MB in the beginning and 206.3MB in the end (delta: -76.1MB). Peak memory consumption was 360.8MB. Max. memory is 8.0GB. [2022-03-15 19:47:33,916 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:47:33,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.29ms. Allocated memory is still 184.5MB. Free memory was 130.0MB in the beginning and 155.2MB in the end (delta: -25.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-15 19:47:33,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.23ms. Allocated memory is still 184.5MB. Free memory was 155.2MB in the beginning and 153.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:47:33,916 INFO L158 Benchmark]: Boogie Preprocessor took 27.86ms. Allocated memory is still 184.5MB. Free memory was 153.5MB in the beginning and 152.4MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:47:33,916 INFO L158 Benchmark]: RCFGBuilder took 342.70ms. Allocated memory is still 184.5MB. Free memory was 152.4MB in the beginning and 139.5MB in the end (delta: 13.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-03-15 19:47:33,916 INFO L158 Benchmark]: TraceAbstraction took 725952.35ms. Allocated memory was 184.5MB in the beginning and 621.8MB in the end (delta: 437.3MB). Free memory was 138.8MB in the beginning and 206.3MB in the end (delta: -67.5MB). Peak memory consumption was 370.9MB. Max. memory is 8.0GB. [2022-03-15 19:47:33,916 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.09ms. Allocated memory is still 184.5MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 176.29ms. Allocated memory is still 184.5MB. Free memory was 130.0MB in the beginning and 155.2MB in the end (delta: -25.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.23ms. Allocated memory is still 184.5MB. Free memory was 155.2MB in the beginning and 153.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.86ms. Allocated memory is still 184.5MB. Free memory was 153.5MB in the beginning and 152.4MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 342.70ms. Allocated memory is still 184.5MB. Free memory was 152.4MB in the beginning and 139.5MB in the end (delta: 13.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 725952.35ms. Allocated memory was 184.5MB in the beginning and 621.8MB in the end (delta: 437.3MB). Free memory was 138.8MB in the beginning and 206.3MB in the end (delta: -67.5MB). Peak memory consumption was 370.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 83 PlacesBefore, 23 PlacesAfterwards, 82 TransitionsBefore, 18 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 14 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 75 TotalNumberOfCompositions, 500 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 482, positive: 480, positive conditional: 0, positive unconditional: 480, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 214, positive: 212, positive conditional: 0, positive unconditional: 212, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 482, positive: 268, positive conditional: 0, positive unconditional: 268, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 214, unknown conditional: 0, unknown unconditional: 214] , 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: 77]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (3246states) and FLOYD_HOARE automaton (currently 190 states, 48 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 257 known predicates. - TimeoutResultAtElement [Line: 72]: 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 (3246states) and FLOYD_HOARE automaton (currently 190 states, 48 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 257 known predicates. - TimeoutResultAtElement [Line: 71]: 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 (3246states) and FLOYD_HOARE automaton (currently 190 states, 48 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 257 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 94 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 725.9s, OverallIterations: 129, TraceHistogramMax: 10, PathProgramHistogramMax: 127, EmptinessCheckTime: 0.3s, AutomataDifference: 408.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.8s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41531 SdHoareTripleChecker+Valid, 97.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41531 mSDsluCounter, 6103 SdHoareTripleChecker+Invalid, 81.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107185 mSDsCounter, 18998 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 243108 IncrementalHoareTripleChecker+Invalid, 262106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18998 mSolverCounterUnsat, 1344 mSDtfsCounter, 243108 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26195 GetRequests, 8470 SyntacticMatches, 647 SemanticMatches, 17077 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070385 ImplicationChecksByTransitivity, 396.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3336occurred in iteration=127, InterpolantAutomatonStates: 11438, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 128 MinimizatonAttempts, 281506 StatesRemovedByMinimization, 126 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 126.8s InterpolantComputationTime, 6623 NumberOfCodeBlocks, 6584 NumberOfCodeBlocksAsserted, 565 NumberOfCheckSat, 9530 ConstructedInterpolants, 0 QuantifiedInterpolants, 93683 SizeOfPredicates, 909 NumberOfNonLiveVariables, 19071 ConjunctsInSsa, 3076 ConjunctsInUnsatCore, 384 InterpolantComputations, 2 PerfectInterpolantSequences, 5107/20183 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