/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longest-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 23:27:09,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 23:27:09,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 23:27:09,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 23:27:09,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 23:27:09,287 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 23:27:09,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 23:27:09,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 23:27:09,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 23:27:09,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 23:27:09,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 23:27:09,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 23:27:09,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 23:27:09,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 23:27:09,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 23:27:09,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 23:27:09,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 23:27:09,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 23:27:09,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 23:27:09,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 23:27:09,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 23:27:09,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 23:27:09,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 23:27:09,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 23:27:09,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 23:27:09,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 23:27:09,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 23:27:09,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 23:27:09,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 23:27:09,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 23:27:09,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 23:27:09,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 23:27:09,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 23:27:09,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 23:27:09,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 23:27:09,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 23:27:09,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 23:27:09,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 23:27:09,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 23:27:09,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 23:27:09,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 23:27:09,323 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-NoLbe.epf [2022-12-11 23:27:09,355 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 23:27:09,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 23:27:09,356 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 23:27:09,356 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 23:27:09,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 23:27:09,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 23:27:09,358 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 23:27:09,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 23:27:09,358 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 23:27:09,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 23:27:09,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 23:27:09,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 23:27:09,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 23:27:09,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 23:27:09,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 23:27:09,359 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 23:27:09,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 23:27:09,359 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 23:27:09,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 23:27:09,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 23:27:09,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 23:27:09,360 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 23:27:09,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 23:27:09,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:27:09,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 23:27:09,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 23:27:09,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 23:27:09,360 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 23:27:09,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 23:27:09,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 23:27:09,361 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 23:27:09,361 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-11 23:27:09,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 23:27:09,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 23:27:09,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 23:27:09,651 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 23:27:09,651 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 23:27:09,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-1.i [2022-12-11 23:27:10,615 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 23:27:10,843 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 23:27:10,843 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-1.i [2022-12-11 23:27:10,855 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4fc2fd52/fb0da04ac0bc4a528eb480a78582d86d/FLAG93a1e45e2 [2022-12-11 23:27:10,866 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4fc2fd52/fb0da04ac0bc4a528eb480a78582d86d [2022-12-11 23:27:10,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 23:27:10,868 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 23:27:10,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 23:27:10,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 23:27:10,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 23:27:10,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:27:10" (1/1) ... [2022-12-11 23:27:10,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e48ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:27:10, skipping insertion in model container [2022-12-11 23:27:10,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:27:10" (1/1) ... [2022-12-11 23:27:10,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 23:27:10,923 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 23:27:11,227 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_longest-1.i[41530,41543] [2022-12-11 23:27:11,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:27:11,259 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 23:27:11,291 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_longest-1.i[41530,41543] [2022-12-11 23:27:11,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:27:11,351 INFO L208 MainTranslator]: Completed translation [2022-12-11 23:27:11,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:27:11 WrapperNode [2022-12-11 23:27:11,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 23:27:11,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 23:27:11,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 23:27:11,354 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 23:27:11,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:27:11" (1/1) ... [2022-12-11 23:27:11,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:27:11" (1/1) ... [2022-12-11 23:27:11,408 INFO L138 Inliner]: procedures = 277, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 155 [2022-12-11 23:27:11,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 23:27:11,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 23:27:11,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 23:27:11,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 23:27:11,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:27:11" (1/1) ... [2022-12-11 23:27:11,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:27:11" (1/1) ... [2022-12-11 23:27:11,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:27:11" (1/1) ... [2022-12-11 23:27:11,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:27:11" (1/1) ... [2022-12-11 23:27:11,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:27:11" (1/1) ... [2022-12-11 23:27:11,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:27:11" (1/1) ... [2022-12-11 23:27:11,437 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:27:11" (1/1) ... [2022-12-11 23:27:11,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:27:11" (1/1) ... [2022-12-11 23:27:11,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 23:27:11,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 23:27:11,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 23:27:11,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 23:27:11,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:27:11" (1/1) ... [2022-12-11 23:27:11,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:27:11,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:27:11,476 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-11 23:27:11,481 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-11 23:27:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-11 23:27:11,503 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-11 23:27:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-11 23:27:11,503 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-11 23:27:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 23:27:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 23:27:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 23:27:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 23:27:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-11 23:27:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 23:27:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 23:27:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 23:27:11,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 23:27:11,504 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 23:27:11,654 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 23:27:11,656 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 23:27:11,866 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 23:27:11,872 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 23:27:11,872 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-11 23:27:11,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:27:11 BoogieIcfgContainer [2022-12-11 23:27:11,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 23:27:11,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 23:27:11,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 23:27:11,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 23:27:11,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 11:27:10" (1/3) ... [2022-12-11 23:27:11,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e04898f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:27:11, skipping insertion in model container [2022-12-11 23:27:11,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:27:11" (2/3) ... [2022-12-11 23:27:11,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e04898f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:27:11, skipping insertion in model container [2022-12-11 23:27:11,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:27:11" (3/3) ... [2022-12-11 23:27:11,879 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2022-12-11 23:27:11,892 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 23:27:11,892 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 23:27:11,892 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 23:27:11,984 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-11 23:27:12,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 157 transitions, 330 flow [2022-12-11 23:27:12,077 INFO L130 PetriNetUnfolder]: 10/155 cut-off events. [2022-12-11 23:27:12,077 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-11 23:27:12,083 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 375 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-11 23:27:12,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 157 transitions, 330 flow [2022-12-11 23:27:12,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 146 transitions, 301 flow [2022-12-11 23:27:12,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 23:27:12,107 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;@12dd3e69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 23:27:12,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 23:27:12,135 INFO L130 PetriNetUnfolder]: 4/115 cut-off events. [2022-12-11 23:27:12,135 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-11 23:27:12,135 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:27:12,136 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:27:12,136 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:27:12,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:27:12,140 INFO L85 PathProgramCache]: Analyzing trace with hash -31759089, now seen corresponding path program 1 times [2022-12-11 23:27:12,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:27:12,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757253809] [2022-12-11 23:27:12,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:27:12,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:27:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:27:12,401 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-11 23:27:12,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:27:12,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757253809] [2022-12-11 23:27:12,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757253809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:27:12,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:27:12,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 23:27:12,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963425225] [2022-12-11 23:27:12,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:27:12,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 23:27:12,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:27:12,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 23:27:12,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 23:27:12,461 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 157 [2022-12-11 23:27:12,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 146 transitions, 301 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 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-11 23:27:12,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:27:12,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 157 [2022-12-11 23:27:12,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:27:12,611 INFO L130 PetriNetUnfolder]: 91/770 cut-off events. [2022-12-11 23:27:12,612 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-12-11 23:27:12,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 770 events. 91/770 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4583 event pairs, 15 based on Foata normal form. 62/761 useless extension candidates. Maximal degree in co-relation 795. Up to 96 conditions per place. [2022-12-11 23:27:12,621 INFO L137 encePairwiseOnDemand]: 148/157 looper letters, 19 selfloop transitions, 3 changer transitions 0/146 dead transitions. [2022-12-11 23:27:12,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 146 transitions, 351 flow [2022-12-11 23:27:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 23:27:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 23:27:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2022-12-11 23:27:12,635 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9341825902335457 [2022-12-11 23:27:12,639 INFO L295 CegarLoopForPetriNet]: 143 programPoint places, -2 predicate places. [2022-12-11 23:27:12,640 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 146 transitions, 351 flow [2022-12-11 23:27:12,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 146 transitions, 351 flow [2022-12-11 23:27:12,646 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 146 transitions, 351 flow [2022-12-11 23:27:12,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 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-11 23:27:12,646 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:27:12,647 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:27:12,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 23:27:12,647 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:27:12,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:27:12,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1416984035, now seen corresponding path program 1 times [2022-12-11 23:27:12,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:27:12,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466924444] [2022-12-11 23:27:12,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:27:12,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:27:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:27:12,808 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-11 23:27:12,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:27:12,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466924444] [2022-12-11 23:27:12,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466924444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:27:12,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:27:12,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 23:27:12,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506561358] [2022-12-11 23:27:12,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:27:12,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 23:27:12,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:27:12,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 23:27:12,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 23:27:12,815 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 157 [2022-12-11 23:27:12,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 146 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 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-11 23:27:12,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:27:12,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 157 [2022-12-11 23:27:12,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:27:12,879 INFO L130 PetriNetUnfolder]: 65/569 cut-off events. [2022-12-11 23:27:12,879 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2022-12-11 23:27:12,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 569 events. 65/569 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2645 event pairs, 29 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 616. Up to 80 conditions per place. [2022-12-11 23:27:12,883 INFO L137 encePairwiseOnDemand]: 154/157 looper letters, 10 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2022-12-11 23:27:12,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 146 transitions, 374 flow [2022-12-11 23:27:12,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 23:27:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 23:27:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2022-12-11 23:27:12,885 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9299363057324841 [2022-12-11 23:27:12,886 INFO L295 CegarLoopForPetriNet]: 143 programPoint places, 0 predicate places. [2022-12-11 23:27:12,888 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 146 transitions, 374 flow [2022-12-11 23:27:12,892 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 146 transitions, 374 flow [2022-12-11 23:27:12,892 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 146 transitions, 374 flow [2022-12-11 23:27:12,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 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-11 23:27:12,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:27:12,896 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:27:12,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 23:27:12,896 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:27:12,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:27:12,896 INFO L85 PathProgramCache]: Analyzing trace with hash -453123432, now seen corresponding path program 1 times [2022-12-11 23:27:12,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:27:12,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843866420] [2022-12-11 23:27:12,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:27:12,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:27:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:27:13,002 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-11 23:27:13,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:27:13,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843866420] [2022-12-11 23:27:13,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843866420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:27:13,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:27:13,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-11 23:27:13,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304471830] [2022-12-11 23:27:13,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:27:13,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-11 23:27:13,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:27:13,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-11 23:27:13,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-11 23:27:13,006 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 157 [2022-12-11 23:27:13,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 146 transitions, 374 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 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-11 23:27:13,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:27:13,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 157 [2022-12-11 23:27:13,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:27:13,100 INFO L130 PetriNetUnfolder]: 98/743 cut-off events. [2022-12-11 23:27:13,100 INFO L131 PetriNetUnfolder]: For 361/364 co-relation queries the response was YES. [2022-12-11 23:27:13,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 743 events. 98/743 cut-off events. For 361/364 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4069 event pairs, 36 based on Foata normal form. 3/690 useless extension candidates. Maximal degree in co-relation 940. Up to 114 conditions per place. [2022-12-11 23:27:13,104 INFO L137 encePairwiseOnDemand]: 152/157 looper letters, 21 selfloop transitions, 4 changer transitions 0/156 dead transitions. [2022-12-11 23:27:13,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 156 transitions, 479 flow [2022-12-11 23:27:13,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-11 23:27:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-11 23:27:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2022-12-11 23:27:13,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9060509554140127 [2022-12-11 23:27:13,108 INFO L295 CegarLoopForPetriNet]: 143 programPoint places, 3 predicate places. [2022-12-11 23:27:13,108 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 156 transitions, 479 flow [2022-12-11 23:27:13,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 156 transitions, 479 flow [2022-12-11 23:27:13,110 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 156 transitions, 479 flow [2022-12-11 23:27:13,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 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-11 23:27:13,111 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:27:13,112 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:27:13,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 23:27:13,112 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:27:13,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:27:13,113 INFO L85 PathProgramCache]: Analyzing trace with hash 337342643, now seen corresponding path program 1 times [2022-12-11 23:27:13,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:27:13,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969010671] [2022-12-11 23:27:13,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:27:13,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:27:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:27:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:27:13,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:27:13,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969010671] [2022-12-11 23:27:13,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969010671] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 23:27:13,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688657572] [2022-12-11 23:27:13,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:27:13,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 23:27:13,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:27:13,277 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-11 23:27:13,279 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-11 23:27:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:27:13,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-11 23:27:13,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 23:27:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:27:13,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 23:27:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:27:13,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688657572] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 23:27:13,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 23:27:13,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-11 23:27:13,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617627601] [2022-12-11 23:27:13,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 23:27:13,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 23:27:13,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:27:13,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 23:27:13,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-11 23:27:13,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 157 [2022-12-11 23:27:13,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 156 transitions, 479 flow. Second operand has 10 states, 10 states have (on average 136.5) internal successors, (1365), 10 states have internal predecessors, (1365), 0 states have call successors, (0), 0 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-11 23:27:13,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:27:13,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 157 [2022-12-11 23:27:13,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:27:13,857 INFO L130 PetriNetUnfolder]: 224/1530 cut-off events. [2022-12-11 23:27:13,857 INFO L131 PetriNetUnfolder]: For 981/1037 co-relation queries the response was YES. [2022-12-11 23:27:13,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2635 conditions, 1530 events. 224/1530 cut-off events. For 981/1037 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10137 event pairs, 33 based on Foata normal form. 6/1404 useless extension candidates. Maximal degree in co-relation 2226. Up to 267 conditions per place. [2022-12-11 23:27:13,866 INFO L137 encePairwiseOnDemand]: 151/157 looper letters, 57 selfloop transitions, 14 changer transitions 0/200 dead transitions. [2022-12-11 23:27:13,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 200 transitions, 862 flow [2022-12-11 23:27:13,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:27:13,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:27:13,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1404 transitions. [2022-12-11 23:27:13,869 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8942675159235669 [2022-12-11 23:27:13,870 INFO L295 CegarLoopForPetriNet]: 143 programPoint places, 12 predicate places. [2022-12-11 23:27:13,871 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 200 transitions, 862 flow [2022-12-11 23:27:13,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 200 transitions, 862 flow [2022-12-11 23:27:13,876 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 200 transitions, 862 flow [2022-12-11 23:27:13,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 136.5) internal successors, (1365), 10 states have internal predecessors, (1365), 0 states have call successors, (0), 0 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-11 23:27:13,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:27:13,877 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:27:13,895 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-11 23:27:14,082 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-11 23:27:14,082 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:27:14,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:27:14,083 INFO L85 PathProgramCache]: Analyzing trace with hash -839012686, now seen corresponding path program 1 times [2022-12-11 23:27:14,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:27:14,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198654797] [2022-12-11 23:27:14,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:27:14,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:27:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:27:14,201 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-11 23:27:14,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:27:14,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198654797] [2022-12-11 23:27:14,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198654797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:27:14,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:27:14,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 23:27:14,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667395376] [2022-12-11 23:27:14,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:27:14,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 23:27:14,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:27:14,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 23:27:14,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 23:27:14,203 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 157 [2022-12-11 23:27:14,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 200 transitions, 862 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 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-11 23:27:14,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:27:14,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 157 [2022-12-11 23:27:14,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:27:14,299 INFO L130 PetriNetUnfolder]: 123/970 cut-off events. [2022-12-11 23:27:14,299 INFO L131 PetriNetUnfolder]: For 1588/1588 co-relation queries the response was YES. [2022-12-11 23:27:14,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 970 events. 123/970 cut-off events. For 1588/1588 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5033 event pairs, 1 based on Foata normal form. 12/922 useless extension candidates. Maximal degree in co-relation 1475. Up to 158 conditions per place. [2022-12-11 23:27:14,303 INFO L137 encePairwiseOnDemand]: 153/157 looper letters, 39 selfloop transitions, 4 changer transitions 0/196 dead transitions. [2022-12-11 23:27:14,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 196 transitions, 996 flow [2022-12-11 23:27:14,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 23:27:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 23:27:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2022-12-11 23:27:14,305 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8980891719745223 [2022-12-11 23:27:14,305 INFO L295 CegarLoopForPetriNet]: 143 programPoint places, 13 predicate places. [2022-12-11 23:27:14,305 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 196 transitions, 996 flow [2022-12-11 23:27:14,308 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 196 transitions, 996 flow [2022-12-11 23:27:14,308 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 196 transitions, 996 flow [2022-12-11 23:27:14,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 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-11 23:27:14,309 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:27:14,309 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:27:14,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 23:27:14,309 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:27:14,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:27:14,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1689269764, now seen corresponding path program 1 times [2022-12-11 23:27:14,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:27:14,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875071433] [2022-12-11 23:27:14,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:27:14,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:27:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:27:14,399 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-11 23:27:14,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:27:14,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875071433] [2022-12-11 23:27:14,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875071433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:27:14,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:27:14,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:27:14,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216021299] [2022-12-11 23:27:14,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:27:14,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:27:14,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:27:14,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:27:14,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:27:14,401 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 157 [2022-12-11 23:27:14,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 196 transitions, 996 flow. Second operand has 7 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 0 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-11 23:27:14,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:27:14,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 157 [2022-12-11 23:27:14,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:27:14,601 INFO L130 PetriNetUnfolder]: 179/1112 cut-off events. [2022-12-11 23:27:14,601 INFO L131 PetriNetUnfolder]: For 3432/3432 co-relation queries the response was YES. [2022-12-11 23:27:14,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2862 conditions, 1112 events. 179/1112 cut-off events. For 3432/3432 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6276 event pairs, 13 based on Foata normal form. 0/1048 useless extension candidates. Maximal degree in co-relation 1882. Up to 231 conditions per place. [2022-12-11 23:27:14,606 INFO L137 encePairwiseOnDemand]: 146/157 looper letters, 88 selfloop transitions, 14 changer transitions 0/221 dead transitions. [2022-12-11 23:27:14,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 221 transitions, 1401 flow [2022-12-11 23:27:14,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:27:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:27:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1173 transitions. [2022-12-11 23:27:14,608 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8301486199575372 [2022-12-11 23:27:14,609 INFO L295 CegarLoopForPetriNet]: 143 programPoint places, 21 predicate places. [2022-12-11 23:27:14,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 221 transitions, 1401 flow [2022-12-11 23:27:14,613 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 221 transitions, 1401 flow [2022-12-11 23:27:14,613 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 221 transitions, 1401 flow [2022-12-11 23:27:14,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 0 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-11 23:27:14,614 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:27:14,614 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:27:14,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 23:27:14,614 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:27:14,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:27:14,614 INFO L85 PathProgramCache]: Analyzing trace with hash -72847009, now seen corresponding path program 1 times [2022-12-11 23:27:14,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:27:14,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781404679] [2022-12-11 23:27:14,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:27:14,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:27:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:27:15,774 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-11 23:27:15,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:27:15,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781404679] [2022-12-11 23:27:15,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781404679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:27:15,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:27:15,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-12-11 23:27:15,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231313062] [2022-12-11 23:27:15,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:27:15,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-11 23:27:15,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:27:15,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-11 23:27:15,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-12-11 23:27:15,777 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 157 [2022-12-11 23:27:15,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 221 transitions, 1401 flow. Second operand has 24 states, 24 states have (on average 85.41666666666667) internal successors, (2050), 24 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:27:15,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:27:15,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 157 [2022-12-11 23:27:15,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:27:17,348 INFO L130 PetriNetUnfolder]: 1117/3607 cut-off events. [2022-12-11 23:27:17,349 INFO L131 PetriNetUnfolder]: For 10934/10938 co-relation queries the response was YES. [2022-12-11 23:27:17,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10386 conditions, 3607 events. 1117/3607 cut-off events. For 10934/10938 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 25894 event pairs, 101 based on Foata normal form. 1/3415 useless extension candidates. Maximal degree in co-relation 7391. Up to 1591 conditions per place. [2022-12-11 23:27:17,371 INFO L137 encePairwiseOnDemand]: 123/157 looper letters, 307 selfloop transitions, 43 changer transitions 2/433 dead transitions. [2022-12-11 23:27:17,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 433 transitions, 3352 flow [2022-12-11 23:27:17,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-11 23:27:17,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-11 23:27:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2833 transitions. [2022-12-11 23:27:17,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5820834189439079 [2022-12-11 23:27:17,377 INFO L295 CegarLoopForPetriNet]: 143 programPoint places, 51 predicate places. [2022-12-11 23:27:17,377 INFO L82 GeneralOperation]: Start removeDead. Operand has 194 places, 433 transitions, 3352 flow [2022-12-11 23:27:17,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 431 transitions, 3344 flow [2022-12-11 23:27:17,389 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 431 transitions, 3344 flow [2022-12-11 23:27:17,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 85.41666666666667) internal successors, (2050), 24 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:27:17,390 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:27:17,390 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:27:17,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 23:27:17,390 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:27:17,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:27:17,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1800270099, now seen corresponding path program 2 times [2022-12-11 23:27:17,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:27:17,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230274802] [2022-12-11 23:27:17,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:27:17,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:27:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:27:18,521 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-11 23:27:18,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:27:18,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230274802] [2022-12-11 23:27:18,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230274802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:27:18,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:27:18,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-12-11 23:27:18,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349172807] [2022-12-11 23:27:18,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:27:18,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-11 23:27:18,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:27:18,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-11 23:27:18,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2022-12-11 23:27:18,524 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 157 [2022-12-11 23:27:18,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 431 transitions, 3344 flow. Second operand has 29 states, 29 states have (on average 73.27586206896552) internal successors, (2125), 29 states have internal predecessors, (2125), 0 states have call successors, (0), 0 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-11 23:27:18,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:27:18,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 157 [2022-12-11 23:27:18,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:27:20,618 INFO L130 PetriNetUnfolder]: 1393/4565 cut-off events. [2022-12-11 23:27:20,619 INFO L131 PetriNetUnfolder]: For 15077/15101 co-relation queries the response was YES. [2022-12-11 23:27:20,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15981 conditions, 4565 events. 1393/4565 cut-off events. For 15077/15101 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 35152 event pairs, 223 based on Foata normal form. 1/4324 useless extension candidates. Maximal degree in co-relation 11429. Up to 2209 conditions per place. [2022-12-11 23:27:20,645 INFO L137 encePairwiseOnDemand]: 121/157 looper letters, 449 selfloop transitions, 62 changer transitions 3/587 dead transitions. [2022-12-11 23:27:20,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 587 transitions, 5638 flow [2022-12-11 23:27:20,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-11 23:27:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-11 23:27:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2530 transitions. [2022-12-11 23:27:20,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5035828025477707 [2022-12-11 23:27:20,651 INFO L295 CegarLoopForPetriNet]: 143 programPoint places, 82 predicate places. [2022-12-11 23:27:20,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 587 transitions, 5638 flow [2022-12-11 23:27:20,665 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 584 transitions, 5620 flow [2022-12-11 23:27:20,666 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 584 transitions, 5620 flow [2022-12-11 23:27:20,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 73.27586206896552) internal successors, (2125), 29 states have internal predecessors, (2125), 0 states have call successors, (0), 0 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-11 23:27:20,666 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:27:20,666 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:27:20,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 23:27:20,667 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:27:20,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:27:20,667 INFO L85 PathProgramCache]: Analyzing trace with hash 608494239, now seen corresponding path program 3 times [2022-12-11 23:27:20,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:27:20,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291240253] [2022-12-11 23:27:20,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:27:20,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:27:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:27:21,670 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-11 23:27:21,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:27:21,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291240253] [2022-12-11 23:27:21,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291240253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:27:21,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:27:21,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-12-11 23:27:21,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414654753] [2022-12-11 23:27:21,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:27:21,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-11 23:27:21,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:27:21,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-11 23:27:21,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2022-12-11 23:27:21,673 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 157 [2022-12-11 23:27:21,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 584 transitions, 5620 flow. Second operand has 29 states, 29 states have (on average 73.27586206896552) internal successors, (2125), 29 states have internal predecessors, (2125), 0 states have call successors, (0), 0 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-11 23:27:21,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:27:21,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 157 [2022-12-11 23:27:21,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:27:24,114 INFO L130 PetriNetUnfolder]: 1559/5145 cut-off events. [2022-12-11 23:27:24,114 INFO L131 PetriNetUnfolder]: For 18741/18799 co-relation queries the response was YES. [2022-12-11 23:27:24,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21179 conditions, 5145 events. 1559/5145 cut-off events. For 18741/18799 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 41260 event pairs, 58 based on Foata normal form. 3/4875 useless extension candidates. Maximal degree in co-relation 15194. Up to 2570 conditions per place. [2022-12-11 23:27:24,144 INFO L137 encePairwiseOnDemand]: 122/157 looper letters, 569 selfloop transitions, 81 changer transitions 3/726 dead transitions. [2022-12-11 23:27:24,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 726 transitions, 8251 flow [2022-12-11 23:27:24,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-11 23:27:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-11 23:27:24,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2678 transitions. [2022-12-11 23:27:24,148 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5016860247283627 [2022-12-11 23:27:24,149 INFO L295 CegarLoopForPetriNet]: 143 programPoint places, 115 predicate places. [2022-12-11 23:27:24,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 258 places, 726 transitions, 8251 flow [2022-12-11 23:27:24,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 258 places, 723 transitions, 8227 flow [2022-12-11 23:27:24,171 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 723 transitions, 8227 flow [2022-12-11 23:27:24,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 73.27586206896552) internal successors, (2125), 29 states have internal predecessors, (2125), 0 states have call successors, (0), 0 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-11 23:27:24,172 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:27:24,172 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:27:24,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 23:27:24,172 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:27:24,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:27:24,172 INFO L85 PathProgramCache]: Analyzing trace with hash -109544013, now seen corresponding path program 1 times [2022-12-11 23:27:24,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:27:24,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519761006] [2022-12-11 23:27:24,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:27:24,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:27:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:27:24,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 23:27:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:27:24,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 23:27:24,269 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 23:27:24,270 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 23:27:24,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-11 23:27:24,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 23:27:24,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-11 23:27:24,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-11 23:27:24,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 23:27:24,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 23:27:24,273 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:27:24,278 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 23:27:24,278 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 23:27:24,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 11:27:24 BasicIcfg [2022-12-11 23:27:24,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 23:27:24,367 INFO L158 Benchmark]: Toolchain (without parser) took 13498.56ms. Allocated memory was 224.4MB in the beginning and 557.8MB in the end (delta: 333.4MB). Free memory was 197.2MB in the beginning and 248.2MB in the end (delta: -51.0MB). Peak memory consumption was 283.5MB. Max. memory is 8.0GB. [2022-12-11 23:27:24,367 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 224.4MB. Free memory is still 200.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 23:27:24,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.89ms. Allocated memory is still 224.4MB. Free memory was 197.2MB in the beginning and 167.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-11 23:27:24,367 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.55ms. Allocated memory is still 224.4MB. Free memory was 167.8MB in the beginning and 165.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 23:27:24,367 INFO L158 Benchmark]: Boogie Preprocessor took 40.93ms. Allocated memory is still 224.4MB. Free memory was 165.2MB in the beginning and 163.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 23:27:24,367 INFO L158 Benchmark]: RCFGBuilder took 423.59ms. Allocated memory is still 224.4MB. Free memory was 163.1MB in the beginning and 145.8MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-11 23:27:24,369 INFO L158 Benchmark]: TraceAbstraction took 12490.91ms. Allocated memory was 224.4MB in the beginning and 557.8MB in the end (delta: 333.4MB). Free memory was 144.2MB in the beginning and 248.2MB in the end (delta: -104.0MB). Peak memory consumption was 231.1MB. Max. memory is 8.0GB. [2022-12-11 23:27:24,370 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.11ms. Allocated memory is still 224.4MB. Free memory is still 200.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 483.89ms. Allocated memory is still 224.4MB. Free memory was 197.2MB in the beginning and 167.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.55ms. Allocated memory is still 224.4MB. Free memory was 167.8MB in the beginning and 165.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.93ms. Allocated memory is still 224.4MB. Free memory was 165.2MB in the beginning and 163.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 423.59ms. Allocated memory is still 224.4MB. Free memory was 163.1MB in the beginning and 145.8MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 12490.91ms. Allocated memory was 224.4MB in the beginning and 557.8MB in the end (delta: 333.4MB). Free memory was 144.2MB in the beginning and 248.2MB in the end (delta: -104.0MB). Peak memory consumption was 231.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; VAL [top=0] [L936] 0 static unsigned int arr[(800)]; VAL [arr={3:0}, top=0] [L937] 0 pthread_mutex_t m; VAL [arr={3:0}, m={4:0}, top=0] [L938] 0 _Bool flag=(0); VAL [arr={3:0}, flag=0, m={4:0}, top=0] [L1020] 0 pthread_t id1, id2; VAL [arr={3:0}, flag=0, id1={5:0}, id2={7:0}, m={4:0}, top=0] [L1022] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={5:0}, id2={7:0}, m={4:0}, pthread_create(&id1, ((void *)0), t1, ((void *)0))=798, top=0] [L989] 1 int i; VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, m={4:0}, top=0] [L990] 1 unsigned int tmp; VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, m={4:0}, top=0] [L1023] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={5:0}, id2={7:0}, m={4:0}, pthread_create(&id2, ((void *)0), t2, ((void *)0))=799, top=0] [L991] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L991] COND TRUE 1 i<(800) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L994] 1 tmp = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=4294968094, arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, tmp=798, top=0] [L995] CALL 1 assume_abort_if_not(tmp < (800)) [L23] COND FALSE 1 !(!cond) VAL [\old(cond)=1, arr={3:0}, cond=1, flag=0, m={4:0}, top=0] [L995] RET 1 assume_abort_if_not(tmp < (800)) [L996] CALL, EXPR 1 push(arr,tmp) [L961] COND FALSE 1 !(top==(800)) [L968] CALL, EXPR 1 get_top() [L953] 1 return top; VAL [\result=0, arr={3:0}, flag=0, m={4:0}, top=0] [L968] RET, EXPR 1 get_top() [L968] 1 stack[get_top()] = x VAL [\old(x)=798, arr={3:0}, flag=0, get_top()=0, m={4:0}, stack={3:0}, stack={3:0}, top=0, x=798] [L969] CALL 1 inc_top() [L945] 1 top++ VAL [arr={3:0}, flag=0, m={4:0}, top=1] [L969] RET 1 inc_top() [L971] 1 return 0; VAL [\old(x)=798, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, stack={3:0}, top=1, x=798] [L996] RET, EXPR 1 push(arr,tmp) [L996] COND FALSE 1 !(push(arr,tmp)==(-1)) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, push(arr,tmp)=0, tmp=798, top=1] [L998] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=798, top=1] [L1005] 2 int i; VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, m={4:0}, top=1] [L1006] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1006] COND TRUE 2 i<(800) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; VAL [\result=0, \result=1, arr={3:0}, flag=1, m={4:0}, top=1] [L975] RET, EXPR 2 get_top() [L975] COND FALSE 2 !(get_top()==0) VAL [arr={3:0}, flag=1, get_top()=1, m={4:0}, stack={3:0}, stack={3:0}, top=1] [L982] CALL 2 dec_top() [L949] 2 top-- VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L982] RET 2 dec_top() [L983] CALL, EXPR 2 get_top() [L953] 2 return top; VAL [\result=0, \result=0, arr={3:0}, flag=1, m={4:0}, top=0] [L983] RET, EXPR 2 get_top() [L983] EXPR 2 stack[get_top()] VAL [arr={3:0}, flag=1, get_top()=0, m={4:0}, stack={3:0}, stack={3:0}, stack[get_top()]=798, top=0] [L983] 2 return stack[get_top()]; VAL [\result=798, arr={3:0}, flag=1, get_top()=0, m={4:0}, stack={3:0}, stack={3:0}, stack[get_top()]=798, top=0] [L1011] RET, EXPR 2 pop(arr) [L1011] COND FALSE 2 !(!(pop(arr)!=(-2))) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, pop(arr)=798, top=0] [L1006] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1006] COND TRUE 2 i<(800) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; VAL [\result=0, \result=0, arr={3:0}, flag=1, m={4:0}, top=0] [L975] RET, EXPR 2 get_top() [L975] COND TRUE 2 get_top()==0 VAL [arr={3:0}, flag=1, get_top()=0, m={4:0}, stack={3:0}, stack={3:0}, top=0] [L978] 2 return (-2); VAL [\result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0] [L1011] RET, EXPR 2 pop(arr) [L1011] COND TRUE 2 !(pop(arr)!=(-2)) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, pop(arr)=-2, top=0] [L1012] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - 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: 1023]: 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: 941]: 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.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.3s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1290 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1290 mSDsluCounter, 2864 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2634 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5565 IncrementalHoareTripleChecker+Invalid, 5603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 230 mSDtfsCounter, 5565 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1785 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8227occurred in iteration=9, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 50 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 980 NumberOfCodeBlocks, 980 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 930 ConstructedInterpolants, 0 QuantifiedInterpolants, 6994 SizeOfPredicates, 2 NumberOfNonLiveVariables, 224 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 9/54 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-11 23:27:24,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...