/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longer-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:11:53,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:11:53,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:11:53,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:11:53,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:11:53,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:11:53,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:11:53,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:11:53,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:11:53,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:11:53,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:11:53,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:11:53,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:11:53,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:11:53,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:11:53,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:11:53,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:11:53,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:11:53,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:11:53,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:11:53,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:11:53,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:11:53,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:11:53,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:11:53,614 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:11:53,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:11:53,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:11:53,616 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:11:53,617 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:11:53,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:11:53,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:11:53,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:11:53,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:11:53,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:11:53,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:11:53,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:11:53,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:11:53,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:11:53,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:11:53,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:11:53,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:11:53,635 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-05 20:11:53,666 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:11:53,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:11:53,667 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:11:53,668 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:11:53,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:11:53,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:11:53,669 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:11:53,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:11:53,669 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:11:53,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:11:53,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:11:53,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:11:53,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:11:53,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:11:53,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:11:53,671 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:11:53,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:11:53,671 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:11:53,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:11:53,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:11:53,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:11:53,672 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:11:53,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:11:53,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:11:53,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:11:53,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:11:53,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:11:53,672 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:11:53,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:11:53,673 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:11:53,673 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-12-05 20:11:53,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:11:53,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:11:53,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:11:53,999 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:11:53,999 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:11:54,000 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-1.i [2022-12-05 20:11:55,088 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:11:55,359 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:11:55,359 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i [2022-12-05 20:11:55,371 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a8918515/994a1e5f5c83442e8157bf36f7365bd8/FLAGc28fc0fbd [2022-12-05 20:11:55,383 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a8918515/994a1e5f5c83442e8157bf36f7365bd8 [2022-12-05 20:11:55,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:11:55,386 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:11:55,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:11:55,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:11:55,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:11:55,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:11:55" (1/1) ... [2022-12-05 20:11:55,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@786369ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:11:55, skipping insertion in model container [2022-12-05 20:11:55,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:11:55" (1/1) ... [2022-12-05 20:11:55,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:11:55,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:11:55,835 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i[41527,41540] [2022-12-05 20:11:55,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:11:55,877 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:11:55,922 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i[41527,41540] [2022-12-05 20:11:55,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:11:56,005 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:11:56,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:11:56 WrapperNode [2022-12-05 20:11:56,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:11:56,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:11:56,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:11:56,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:11:56,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:11:56" (1/1) ... [2022-12-05 20:11:56,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:11:56" (1/1) ... [2022-12-05 20:11:56,051 INFO L138 Inliner]: procedures = 277, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 155 [2022-12-05 20:11:56,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:11:56,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:11:56,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:11:56,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:11:56,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:11:56" (1/1) ... [2022-12-05 20:11:56,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:11:56" (1/1) ... [2022-12-05 20:11:56,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:11:56" (1/1) ... [2022-12-05 20:11:56,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:11:56" (1/1) ... [2022-12-05 20:11:56,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:11:56" (1/1) ... [2022-12-05 20:11:56,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:11:56" (1/1) ... [2022-12-05 20:11:56,075 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:11:56" (1/1) ... [2022-12-05 20:11:56,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:11:56" (1/1) ... [2022-12-05 20:11:56,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:11:56,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:11:56,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:11:56,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:11:56,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:11:56" (1/1) ... [2022-12-05 20:11:56,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:11:56,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:11:56,112 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-12-05 20:11:56,114 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-12-05 20:11:56,149 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-05 20:11:56,149 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-05 20:11:56,149 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-05 20:11:56,149 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-05 20:11:56,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:11:56,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:11:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 20:11:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:11:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 20:11:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:11:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:11:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:11:56,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:11:56,156 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:11:56,267 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:11:56,269 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:11:56,568 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:11:56,575 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:11:56,576 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-05 20:11:56,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:11:56 BoogieIcfgContainer [2022-12-05 20:11:56,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:11:56,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:11:56,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:11:56,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:11:56,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:11:55" (1/3) ... [2022-12-05 20:11:56,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119ef9eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:11:56, skipping insertion in model container [2022-12-05 20:11:56,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:11:56" (2/3) ... [2022-12-05 20:11:56,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119ef9eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:11:56, skipping insertion in model container [2022-12-05 20:11:56,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:11:56" (3/3) ... [2022-12-05 20:11:56,585 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2022-12-05 20:11:56,599 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:11:56,599 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:11:56,599 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:11:56,693 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-05 20:11:56,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 157 transitions, 330 flow [2022-12-05 20:11:56,808 INFO L130 PetriNetUnfolder]: 10/155 cut-off events. [2022-12-05 20:11:56,809 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 20:11:56,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 155 events. 10/155 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 368 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 117. Up to 3 conditions per place. [2022-12-05 20:11:56,815 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 157 transitions, 330 flow [2022-12-05 20:11:56,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 146 transitions, 301 flow [2022-12-05 20:11:56,821 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:11:56,841 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 146 transitions, 301 flow [2022-12-05 20:11:56,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 146 transitions, 301 flow [2022-12-05 20:11:56,875 INFO L130 PetriNetUnfolder]: 10/146 cut-off events. [2022-12-05 20:11:56,876 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 20:11:56,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 146 events. 10/146 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 297 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 117. Up to 3 conditions per place. [2022-12-05 20:11:56,882 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 146 transitions, 301 flow [2022-12-05 20:11:56,883 INFO L188 LiptonReduction]: Number of co-enabled transitions 7212 [2022-12-05 20:12:01,174 INFO L203 LiptonReduction]: Total number of compositions: 118 [2022-12-05 20:12:01,188 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:12:01,193 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, 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=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d175c4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:12:01,193 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 20:12:01,198 INFO L130 PetriNetUnfolder]: 3/24 cut-off events. [2022-12-05 20:12:01,198 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 20:12:01,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:01,199 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 20:12:01,199 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:01,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:01,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1883113372, now seen corresponding path program 1 times [2022-12-05 20:12:01,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:01,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288084645] [2022-12-05 20:12:01,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:01,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:01,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:01,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288084645] [2022-12-05 20:12:01,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288084645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:12:01,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:12:01,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:12:01,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235855504] [2022-12-05 20:12:01,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:12:01,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:12:01,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:01,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:12:01,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:12:01,452 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 40 [2022-12-05 20:12:01,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:01,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:01,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 40 [2022-12-05 20:12:01,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:12:01,698 INFO L130 PetriNetUnfolder]: 1032/1696 cut-off events. [2022-12-05 20:12:01,698 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2022-12-05 20:12:01,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3424 conditions, 1696 events. 1032/1696 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7763 event pairs, 303 based on Foata normal form. 0/1238 useless extension candidates. Maximal degree in co-relation 3207. Up to 974 conditions per place. [2022-12-05 20:12:01,713 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 60 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2022-12-05 20:12:01,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 275 flow [2022-12-05 20:12:01,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:12:01,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:12:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-05 20:12:01,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6416666666666667 [2022-12-05 20:12:01,725 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 89 flow. Second operand 3 states and 77 transitions. [2022-12-05 20:12:01,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 275 flow [2022-12-05 20:12:01,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 66 transitions, 267 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:12:01,731 INFO L231 Difference]: Finished difference. Result has 40 places, 40 transitions, 108 flow [2022-12-05 20:12:01,732 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=40, PETRI_TRANSITIONS=40} [2022-12-05 20:12:01,737 INFO L294 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2022-12-05 20:12:01,737 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 108 flow [2022-12-05 20:12:01,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:01,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:01,738 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:12:01,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:12:01,739 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:01,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:01,741 INFO L85 PathProgramCache]: Analyzing trace with hash 576850360, now seen corresponding path program 1 times [2022-12-05 20:12:01,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:01,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90010880] [2022-12-05 20:12:01,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:01,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:01,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:01,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:01,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90010880] [2022-12-05 20:12:01,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90010880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:12:01,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:12:01,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:12:01,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535458111] [2022-12-05 20:12:01,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:12:01,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:12:01,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:01,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:12:01,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:12:01,869 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-05 20:12:01,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:01,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:01,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-05 20:12:01,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:12:02,045 INFO L130 PetriNetUnfolder]: 1089/1825 cut-off events. [2022-12-05 20:12:02,045 INFO L131 PetriNetUnfolder]: For 181/183 co-relation queries the response was YES. [2022-12-05 20:12:02,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3872 conditions, 1825 events. 1089/1825 cut-off events. For 181/183 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8390 event pairs, 499 based on Foata normal form. 52/1432 useless extension candidates. Maximal degree in co-relation 3555. Up to 1383 conditions per place. [2022-12-05 20:12:02,055 INFO L137 encePairwiseOnDemand]: 36/40 looper letters, 50 selfloop transitions, 2 changer transitions 5/61 dead transitions. [2022-12-05 20:12:02,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 61 transitions, 271 flow [2022-12-05 20:12:02,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:12:02,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:12:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-05 20:12:02,057 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-05 20:12:02,057 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 108 flow. Second operand 3 states and 66 transitions. [2022-12-05 20:12:02,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 61 transitions, 271 flow [2022-12-05 20:12:02,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 61 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:12:02,060 INFO L231 Difference]: Finished difference. Result has 41 places, 41 transitions, 116 flow [2022-12-05 20:12:02,060 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=41, PETRI_TRANSITIONS=41} [2022-12-05 20:12:02,061 INFO L294 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2022-12-05 20:12:02,061 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 41 transitions, 116 flow [2022-12-05 20:12:02,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:02,062 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:02,062 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:12:02,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:12:02,062 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:02,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:02,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1906802682, now seen corresponding path program 1 times [2022-12-05 20:12:02,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:02,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238166279] [2022-12-05 20:12:02,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:02,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:02,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:02,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238166279] [2022-12-05 20:12:02,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238166279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:12:02,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:12:02,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:12:02,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938620690] [2022-12-05 20:12:02,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:12:02,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:12:02,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:02,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:12:02,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:12:02,121 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-05 20:12:02,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 41 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:02,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:02,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-05 20:12:02,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:12:02,372 INFO L130 PetriNetUnfolder]: 1146/1922 cut-off events. [2022-12-05 20:12:02,372 INFO L131 PetriNetUnfolder]: For 219/219 co-relation queries the response was YES. [2022-12-05 20:12:02,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4207 conditions, 1922 events. 1146/1922 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9068 event pairs, 827 based on Foata normal form. 54/1576 useless extension candidates. Maximal degree in co-relation 3883. Up to 1683 conditions per place. [2022-12-05 20:12:02,383 INFO L137 encePairwiseOnDemand]: 37/40 looper letters, 51 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2022-12-05 20:12:02,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 276 flow [2022-12-05 20:12:02,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:12:02,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:12:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-05 20:12:02,385 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2022-12-05 20:12:02,385 INFO L175 Difference]: Start difference. First operand has 41 places, 41 transitions, 116 flow. Second operand 3 states and 61 transitions. [2022-12-05 20:12:02,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 276 flow [2022-12-05 20:12:02,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:12:02,387 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 134 flow [2022-12-05 20:12:02,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2022-12-05 20:12:02,388 INFO L294 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2022-12-05 20:12:02,388 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 134 flow [2022-12-05 20:12:02,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:02,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:02,388 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:12:02,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:12:02,388 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:02,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1379022029, now seen corresponding path program 1 times [2022-12-05 20:12:02,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:02,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404931934] [2022-12-05 20:12:02,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:02,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:02,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:02,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404931934] [2022-12-05 20:12:02,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404931934] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:12:02,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090787956] [2022-12-05 20:12:02,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:02,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:12:02,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:12:02,467 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-12-05 20:12:02,481 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-12-05 20:12:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:02,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-05 20:12:02,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:12:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:02,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:12:02,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:02,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090787956] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:12:02,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:12:02,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-05 20:12:02,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350659708] [2022-12-05 20:12:02,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:12:02,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 20:12:02,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:02,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 20:12:02,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-05 20:12:02,703 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 40 [2022-12-05 20:12:02,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 134 flow. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:02,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:02,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 40 [2022-12-05 20:12:02,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:12:03,327 INFO L130 PetriNetUnfolder]: 2287/3825 cut-off events. [2022-12-05 20:12:03,327 INFO L131 PetriNetUnfolder]: For 1309/1309 co-relation queries the response was YES. [2022-12-05 20:12:03,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8902 conditions, 3825 events. 2287/3825 cut-off events. For 1309/1309 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 19680 event pairs, 444 based on Foata normal form. 52/3095 useless extension candidates. Maximal degree in co-relation 8335. Up to 1051 conditions per place. [2022-12-05 20:12:03,348 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 178 selfloop transitions, 22 changer transitions 0/202 dead transitions. [2022-12-05 20:12:03,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 202 transitions, 976 flow [2022-12-05 20:12:03,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 20:12:03,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 20:12:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 219 transitions. [2022-12-05 20:12:03,354 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5475 [2022-12-05 20:12:03,354 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 134 flow. Second operand 10 states and 219 transitions. [2022-12-05 20:12:03,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 202 transitions, 976 flow [2022-12-05 20:12:03,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 202 transitions, 963 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:12:03,364 INFO L231 Difference]: Finished difference. Result has 55 places, 60 transitions, 302 flow [2022-12-05 20:12:03,364 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=302, PETRI_PLACES=55, PETRI_TRANSITIONS=60} [2022-12-05 20:12:03,365 INFO L294 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2022-12-05 20:12:03,365 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 60 transitions, 302 flow [2022-12-05 20:12:03,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:03,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:03,366 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:12:03,374 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-12-05 20:12:03,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:12:03,572 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:03,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:03,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1763564082, now seen corresponding path program 1 times [2022-12-05 20:12:03,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:03,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133287573] [2022-12-05 20:12:03,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:03,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:03,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:03,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:03,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133287573] [2022-12-05 20:12:03,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133287573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:12:03,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:12:03,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:12:03,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689116420] [2022-12-05 20:12:03,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:12:03,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:12:03,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:03,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:12:03,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:12:03,667 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-05 20:12:03,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 60 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:03,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:03,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-05 20:12:03,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:12:03,815 INFO L130 PetriNetUnfolder]: 702/1311 cut-off events. [2022-12-05 20:12:03,815 INFO L131 PetriNetUnfolder]: For 363/363 co-relation queries the response was YES. [2022-12-05 20:12:03,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3156 conditions, 1311 events. 702/1311 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5910 event pairs, 98 based on Foata normal form. 0/1121 useless extension candidates. Maximal degree in co-relation 2558. Up to 1012 conditions per place. [2022-12-05 20:12:03,821 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 44 selfloop transitions, 6 changer transitions 3/59 dead transitions. [2022-12-05 20:12:03,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 349 flow [2022-12-05 20:12:03,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:12:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:12:03,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-05 20:12:03,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-05 20:12:03,823 INFO L175 Difference]: Start difference. First operand has 55 places, 60 transitions, 302 flow. Second operand 3 states and 56 transitions. [2022-12-05 20:12:03,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 349 flow [2022-12-05 20:12:03,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 337 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-05 20:12:03,826 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 216 flow [2022-12-05 20:12:03,826 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2022-12-05 20:12:03,827 INFO L294 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2022-12-05 20:12:03,827 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 216 flow [2022-12-05 20:12:03,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:03,827 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:03,828 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:12:03,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:12:03,828 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:03,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:03,828 INFO L85 PathProgramCache]: Analyzing trace with hash -355159589, now seen corresponding path program 1 times [2022-12-05 20:12:03,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:03,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913685973] [2022-12-05 20:12:03,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:03,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:03,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:03,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913685973] [2022-12-05 20:12:03,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913685973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:12:03,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:12:03,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:12:03,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232832526] [2022-12-05 20:12:03,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:12:03,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:12:03,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:03,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:12:03,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:12:03,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 40 [2022-12-05 20:12:03,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:03,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:03,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 40 [2022-12-05 20:12:03,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:12:04,107 INFO L130 PetriNetUnfolder]: 736/1381 cut-off events. [2022-12-05 20:12:04,108 INFO L131 PetriNetUnfolder]: For 477/477 co-relation queries the response was YES. [2022-12-05 20:12:04,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3524 conditions, 1381 events. 736/1381 cut-off events. For 477/477 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5974 event pairs, 220 based on Foata normal form. 12/1355 useless extension candidates. Maximal degree in co-relation 2886. Up to 529 conditions per place. [2022-12-05 20:12:04,116 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 80 selfloop transitions, 11 changer transitions 0/93 dead transitions. [2022-12-05 20:12:04,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 93 transitions, 540 flow [2022-12-05 20:12:04,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:12:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:12:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-05 20:12:04,117 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47 [2022-12-05 20:12:04,117 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 216 flow. Second operand 5 states and 94 transitions. [2022-12-05 20:12:04,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 93 transitions, 540 flow [2022-12-05 20:12:04,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 93 transitions, 524 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:12:04,122 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 267 flow [2022-12-05 20:12:04,122 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2022-12-05 20:12:04,125 INFO L294 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2022-12-05 20:12:04,125 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 267 flow [2022-12-05 20:12:04,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:04,125 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:04,125 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:12:04,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:12:04,126 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:04,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:04,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1065909933, now seen corresponding path program 1 times [2022-12-05 20:12:04,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:04,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939047020] [2022-12-05 20:12:04,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:04,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:04,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:04,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939047020] [2022-12-05 20:12:04,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939047020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:12:04,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:12:04,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 20:12:04,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723987914] [2022-12-05 20:12:04,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:12:04,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 20:12:04,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:04,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 20:12:04,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-05 20:12:04,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-05 20:12:04,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 267 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-12-05 20:12:04,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:04,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-05 20:12:04,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:12:05,196 INFO L130 PetriNetUnfolder]: 1070/2018 cut-off events. [2022-12-05 20:12:05,196 INFO L131 PetriNetUnfolder]: For 1343/1343 co-relation queries the response was YES. [2022-12-05 20:12:05,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5088 conditions, 2018 events. 1070/2018 cut-off events. For 1343/1343 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 10094 event pairs, 312 based on Foata normal form. 0/1937 useless extension candidates. Maximal degree in co-relation 3041. Up to 1156 conditions per place. [2022-12-05 20:12:05,209 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 103 selfloop transitions, 10 changer transitions 4/124 dead transitions. [2022-12-05 20:12:05,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 124 transitions, 740 flow [2022-12-05 20:12:05,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:12:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:12:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2022-12-05 20:12:05,211 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.403125 [2022-12-05 20:12:05,211 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 267 flow. Second operand 8 states and 129 transitions. [2022-12-05 20:12:05,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 124 transitions, 740 flow [2022-12-05 20:12:05,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 124 transitions, 723 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-05 20:12:05,216 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 328 flow [2022-12-05 20:12:05,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=328, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2022-12-05 20:12:05,217 INFO L294 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2022-12-05 20:12:05,217 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 328 flow [2022-12-05 20:12:05,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-12-05 20:12:05,218 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:05,218 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:12:05,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:12:05,218 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:05,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:05,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1628634145, now seen corresponding path program 2 times [2022-12-05 20:12:05,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:05,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442600182] [2022-12-05 20:12:05,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:05,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:05,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:05,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442600182] [2022-12-05 20:12:05,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442600182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:12:05,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:12:05,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 20:12:05,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703015468] [2022-12-05 20:12:05,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:12:05,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 20:12:05,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:05,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 20:12:05,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-05 20:12:05,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-05 20:12:05,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 328 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-12-05 20:12:05,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:05,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-05 20:12:05,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:12:06,482 INFO L130 PetriNetUnfolder]: 1361/2567 cut-off events. [2022-12-05 20:12:06,482 INFO L131 PetriNetUnfolder]: For 1619/1619 co-relation queries the response was YES. [2022-12-05 20:12:06,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6830 conditions, 2567 events. 1361/2567 cut-off events. For 1619/1619 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 13326 event pairs, 404 based on Foata normal form. 0/2456 useless extension candidates. Maximal degree in co-relation 4420. Up to 1075 conditions per place. [2022-12-05 20:12:06,503 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 103 selfloop transitions, 14 changer transitions 4/128 dead transitions. [2022-12-05 20:12:06,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 128 transitions, 818 flow [2022-12-05 20:12:06,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:12:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:12:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2022-12-05 20:12:06,505 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.403125 [2022-12-05 20:12:06,505 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 328 flow. Second operand 8 states and 129 transitions. [2022-12-05 20:12:06,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 128 transitions, 818 flow [2022-12-05 20:12:06,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 128 transitions, 818 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:12:06,512 INFO L231 Difference]: Finished difference. Result has 75 places, 63 transitions, 406 flow [2022-12-05 20:12:06,512 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=406, PETRI_PLACES=75, PETRI_TRANSITIONS=63} [2022-12-05 20:12:06,514 INFO L294 CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places. [2022-12-05 20:12:06,516 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 63 transitions, 406 flow [2022-12-05 20:12:06,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-12-05 20:12:06,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:06,516 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:12:06,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:12:06,517 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:06,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:06,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1591962383, now seen corresponding path program 1 times [2022-12-05 20:12:06,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:06,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306425196] [2022-12-05 20:12:06,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:06,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:12:06,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:12:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:12:06,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:12:06,639 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:12:06,640 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 20:12:06,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-05 20:12:06,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 20:12:06,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-05 20:12:06,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-05 20:12:06,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 20:12:06,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:12:06,643 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:12:06,649 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:12:06,649 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:12:06,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:12:06 BasicIcfg [2022-12-05 20:12:06,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:12:06,707 INFO L158 Benchmark]: Toolchain (without parser) took 11321.19ms. Allocated memory was 224.4MB in the beginning and 346.0MB in the end (delta: 121.6MB). Free memory was 199.0MB in the beginning and 217.7MB in the end (delta: -18.6MB). Peak memory consumption was 103.6MB. Max. memory is 8.0GB. [2022-12-05 20:12:06,708 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 224.4MB. Free memory was 202.2MB in the beginning and 202.1MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:12:06,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 619.77ms. Allocated memory is still 224.4MB. Free memory was 199.0MB in the beginning and 169.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-05 20:12:06,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.43ms. Allocated memory is still 224.4MB. Free memory was 169.6MB in the beginning and 167.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:12:06,708 INFO L158 Benchmark]: Boogie Preprocessor took 27.21ms. Allocated memory is still 224.4MB. Free memory was 167.1MB in the beginning and 165.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:12:06,709 INFO L158 Benchmark]: RCFGBuilder took 498.39ms. Allocated memory is still 224.4MB. Free memory was 165.0MB in the beginning and 147.1MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-05 20:12:06,709 INFO L158 Benchmark]: TraceAbstraction took 10127.29ms. Allocated memory was 224.4MB in the beginning and 346.0MB in the end (delta: 121.6MB). Free memory was 146.6MB in the beginning and 217.7MB in the end (delta: -71.0MB). Peak memory consumption was 51.1MB. Max. memory is 8.0GB. [2022-12-05 20:12:06,710 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.18ms. Allocated memory is still 224.4MB. Free memory was 202.2MB in the beginning and 202.1MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 619.77ms. Allocated memory is still 224.4MB. Free memory was 199.0MB in the beginning and 169.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.43ms. Allocated memory is still 224.4MB. Free memory was 169.6MB in the beginning and 167.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.21ms. Allocated memory is still 224.4MB. Free memory was 167.1MB in the beginning and 165.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 498.39ms. Allocated memory is still 224.4MB. Free memory was 165.0MB in the beginning and 147.1MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 10127.29ms. Allocated memory was 224.4MB in the beginning and 346.0MB in the end (delta: 121.6MB). Free memory was 146.6MB in the beginning and 217.7MB in the end (delta: -71.0MB). Peak memory consumption was 51.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 143 PlacesBefore, 41 PlacesAfterwards, 146 TransitionsBefore, 40 TransitionsAfterwards, 7212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 83 ConcurrentYvCompositions, 4 ChoiceCompositions, 118 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5586, independent: 5507, independent conditional: 5507, independent unconditional: 0, dependent: 79, dependent conditional: 79, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5586, independent: 5507, independent conditional: 0, independent unconditional: 5507, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5586, independent: 5507, independent conditional: 0, independent unconditional: 5507, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5586, independent: 5507, independent conditional: 0, independent unconditional: 5507, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4561, independent: 4509, independent conditional: 0, independent unconditional: 4509, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4561, independent: 4481, independent conditional: 0, independent unconditional: 4481, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5586, independent: 998, independent conditional: 0, independent unconditional: 998, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 4561, unknown conditional: 0, unknown unconditional: 4561] , Statistics on independence cache: Total cache size (in pairs): 8726, Positive cache size: 8674, Positive conditional cache size: 0, Positive unconditional cache size: 8674, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 940]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(400)]; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1019] 0 pthread_t id1, id2; [L1021] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={6:0}, id2={5:0}, m={4:0}, pthread_create(&id1, ((void *)0), t1, ((void *)0))=9, top=0] [L988] 1 int i; [L989] 1 unsigned int tmp; [L990] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1022] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={6:0}, id2={5:0}, m={4:0}, pthread_create(&id2, ((void *)0), t2, ((void *)0))=10, top=0] [L1004] 2 int i; [L1005] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L990] COND TRUE 1 i<(400) [L993] 1 tmp = __VERIFIER_nondet_uint() [L994] CALL 1 assume_abort_if_not(tmp < (400)) [L23] COND FALSE 1 !(!cond) [L994] RET 1 assume_abort_if_not(tmp < (400)) [L995] CALL, EXPR 1 push(arr,tmp) [L960] COND FALSE 1 !(top==(400)) [L967] CALL, EXPR 1 get_top() [L952] 1 return top; [L967] RET, EXPR 1 get_top() [L967] 1 stack[get_top()] = x [L968] CALL 1 inc_top() [L944] 1 top++ [L968] RET 1 inc_top() [L970] 1 return 0; [L995] RET, EXPR 1 push(arr,tmp) [L995] COND FALSE 1 !(push(arr,tmp)==(-1)) [L997] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=7, top=1] [L990] 1 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=7, top=1] [L1005] COND TRUE 2 i<(400) [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND FALSE 2 !(get_top()==0) [L981] CALL 2 dec_top() [L948] 2 top-- [L981] RET 2 dec_top() [L982] CALL, EXPR 2 get_top() [L952] 2 return top; VAL [\result=0, \result=0, arr={3:0}, flag=1, m={4:0}, top=0] [L982] RET, EXPR 2 get_top() [L982] EXPR 2 stack[get_top()] [L982] 2 return stack[get_top()]; [L1010] RET, EXPR 2 pop(arr) [L1010] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1005] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1005] COND TRUE 2 i<(400) [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND TRUE 2 get_top()==0 [L977] 2 return (-2); [L1010] RET, EXPR 2 pop(arr) [L1010] COND TRUE 2 !(pop(arr)!=(-2)) [L1011] CALL 2 error() [L940] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1021]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 940]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 248 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.9s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 442 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 442 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1772 IncrementalHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 7 mSDtfsCounter, 1772 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=406occurred in iteration=8, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 1353 SizeOfPredicates, 1 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 3/9 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 proved your program to be incorrect! [2022-12-05 20:12:06,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...