./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e08637578a960e5117d483812e56de1a390e4c3bc66da607109cc6e10390727 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:13:57,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:13:57,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:13:57,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:13:57,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:13:57,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:13:57,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:13:57,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:13:57,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:13:57,583 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:13:57,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:13:57,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:13:57,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:13:57,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:13:57,585 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:13:57,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:13:57,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:13:57,586 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:13:57,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:13:57,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:13:57,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:13:57,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:13:57,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:13:57,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:13:57,587 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:13:57,588 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:13:57,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:13:57,588 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:13:57,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:13:57,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:13:57,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:13:57,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:13:57,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:13:57,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:13:57,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:13:57,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:13:57,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:13:57,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:13:57,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:13:57,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:13:57,591 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:13:57,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:13:57,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:13:57,592 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e08637578a960e5117d483812e56de1a390e4c3bc66da607109cc6e10390727 [2024-01-27 16:13:57,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:13:57,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:13:57,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:13:57,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:13:57,832 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:13:57,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-01-27 16:13:58,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:13:59,174 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:13:59,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-01-27 16:13:59,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6997bb367/300a5dad5d5f416397721777f9e391af/FLAG9b528816e [2024-01-27 16:13:59,204 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6997bb367/300a5dad5d5f416397721777f9e391af [2024-01-27 16:13:59,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:13:59,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:13:59,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:13:59,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:13:59,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:13:59,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:13:59" (1/1) ... [2024-01-27 16:13:59,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e560515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:59, skipping insertion in model container [2024-01-27 16:13:59,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:13:59" (1/1) ... [2024-01-27 16:13:59,243 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:13:59,350 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2024-01-27 16:13:59,494 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:13:59,505 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:13:59,516 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2024-01-27 16:13:59,553 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:13:59,600 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:13:59,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:59 WrapperNode [2024-01-27 16:13:59,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:13:59,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:13:59,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:13:59,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:13:59,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:59" (1/1) ... [2024-01-27 16:13:59,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:59" (1/1) ... [2024-01-27 16:13:59,656 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2024-01-27 16:13:59,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:13:59,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:13:59,657 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:13:59,657 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:13:59,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:59" (1/1) ... [2024-01-27 16:13:59,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:59" (1/1) ... [2024-01-27 16:13:59,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:59" (1/1) ... [2024-01-27 16:13:59,696 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-27 16:13:59,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:59" (1/1) ... [2024-01-27 16:13:59,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:59" (1/1) ... [2024-01-27 16:13:59,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:59" (1/1) ... [2024-01-27 16:13:59,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:59" (1/1) ... [2024-01-27 16:13:59,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:59" (1/1) ... [2024-01-27 16:13:59,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:59" (1/1) ... [2024-01-27 16:13:59,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:13:59,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:13:59,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:13:59,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:13:59,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:59" (1/1) ... [2024-01-27 16:13:59,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:13:59,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:13:59,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 16:13:59,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 16:13:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:13:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:13:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:13:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:13:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:13:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:13:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:13:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:13:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-27 16:13:59,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-27 16:13:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-27 16:13:59,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-27 16:13:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-27 16:13:59,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-27 16:13:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:13:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:13:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:13:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:13:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:13:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:13:59,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:13:59,845 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 16:13:59,954 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:13:59,956 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:14:00,272 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:14:00,273 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:14:00,402 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:14:00,403 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 16:14:00,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:14:00 BoogieIcfgContainer [2024-01-27 16:14:00,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:14:00,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:14:00,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:14:00,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:14:00,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:13:59" (1/3) ... [2024-01-27 16:14:00,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6bc5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:14:00, skipping insertion in model container [2024-01-27 16:14:00,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:13:59" (2/3) ... [2024-01-27 16:14:00,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6bc5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:14:00, skipping insertion in model container [2024-01-27 16:14:00,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:14:00" (3/3) ... [2024-01-27 16:14:00,409 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-01-27 16:14:00,415 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:14:00,422 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:14:00,423 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-01-27 16:14:00,423 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:14:00,459 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 16:14:00,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 94 flow [2024-01-27 16:14:00,569 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2024-01-27 16:14:00,569 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:14:00,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2024-01-27 16:14:00,572 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 94 flow [2024-01-27 16:14:00,574 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 85 flow [2024-01-27 16:14:00,581 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:14:00,586 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@de7b20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:14:00,586 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-01-27 16:14:00,591 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:14:00,591 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-01-27 16:14:00,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:14:00,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:14:00,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:14:00,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:14:00,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:14:00,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1421572031, now seen corresponding path program 1 times [2024-01-27 16:14:00,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:14:00,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659597470] [2024-01-27 16:14:00,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:14:00,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:14:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:14:01,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:14:01,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:14:01,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659597470] [2024-01-27 16:14:01,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659597470] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:14:01,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:14:01,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 16:14:01,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005379022] [2024-01-27 16:14:01,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:14:01,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:14:01,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:14:01,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:14:01,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:14:01,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 41 [2024-01-27 16:14:01,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:01,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:14:01,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 41 [2024-01-27 16:14:01,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:14:01,275 INFO L124 PetriNetUnfolderBase]: 315/711 cut-off events. [2024-01-27 16:14:01,276 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:14:01,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 711 events. 315/711 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4746 event pairs, 60 based on Foata normal form. 24/710 useless extension candidates. Maximal degree in co-relation 1223. Up to 382 conditions per place. [2024-01-27 16:14:01,285 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 23 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2024-01-27 16:14:01,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 153 flow [2024-01-27 16:14:01,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:14:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:14:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-01-27 16:14:01,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7560975609756098 [2024-01-27 16:14:01,299 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 93 transitions. [2024-01-27 16:14:01,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 153 flow [2024-01-27 16:14:01,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 150 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:14:01,304 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2024-01-27 16:14:01,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-01-27 16:14:01,309 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2024-01-27 16:14:01,310 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2024-01-27 16:14:01,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:01,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:14:01,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:14:01,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:14:01,311 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:14:01,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:14:01,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1378936423, now seen corresponding path program 1 times [2024-01-27 16:14:01,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:14:01,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432402456] [2024-01-27 16:14:01,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:14:01,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:14:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:14:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:14:01,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:14:01,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432402456] [2024-01-27 16:14:01,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432402456] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:14:01,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:14:01,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:14:01,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468517817] [2024-01-27 16:14:01,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:14:01,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:14:01,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:14:01,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:14:01,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:14:01,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-01-27 16:14:01,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:01,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:14:01,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-01-27 16:14:01,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:14:01,847 INFO L124 PetriNetUnfolderBase]: 514/952 cut-off events. [2024-01-27 16:14:01,848 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-01-27 16:14:01,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1829 conditions, 952 events. 514/952 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6444 event pairs, 121 based on Foata normal form. 0/909 useless extension candidates. Maximal degree in co-relation 1819. Up to 364 conditions per place. [2024-01-27 16:14:01,853 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 23 selfloop transitions, 2 changer transitions 31/71 dead transitions. [2024-01-27 16:14:01,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 268 flow [2024-01-27 16:14:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:14:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:14:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-01-27 16:14:01,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6158536585365854 [2024-01-27 16:14:01,860 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 8 states and 202 transitions. [2024-01-27 16:14:01,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 268 flow [2024-01-27 16:14:01,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:14:01,864 INFO L231 Difference]: Finished difference. Result has 54 places, 34 transitions, 90 flow [2024-01-27 16:14:01,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=90, PETRI_PLACES=54, PETRI_TRANSITIONS=34} [2024-01-27 16:14:01,865 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2024-01-27 16:14:01,865 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 34 transitions, 90 flow [2024-01-27 16:14:01,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:01,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:14:01,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:14:01,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:14:01,869 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:14:01,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:14:01,871 INFO L85 PathProgramCache]: Analyzing trace with hash -284295798, now seen corresponding path program 1 times [2024-01-27 16:14:01,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:14:01,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842324887] [2024-01-27 16:14:01,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:14:01,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:14:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:14:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:14:02,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:14:02,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842324887] [2024-01-27 16:14:02,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842324887] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:14:02,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:14:02,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:14:02,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810457267] [2024-01-27 16:14:02,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:14:02,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:14:02,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:14:02,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:14:02,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:14:02,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-01-27 16:14:02,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 34 transitions, 90 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:02,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:14:02,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-01-27 16:14:02,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:14:03,047 INFO L124 PetriNetUnfolderBase]: 1643/3064 cut-off events. [2024-01-27 16:14:03,048 INFO L125 PetriNetUnfolderBase]: For 653/653 co-relation queries the response was YES. [2024-01-27 16:14:03,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6305 conditions, 3064 events. 1643/3064 cut-off events. For 653/653 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 21443 event pairs, 93 based on Foata normal form. 78/3127 useless extension candidates. Maximal degree in co-relation 6290. Up to 1463 conditions per place. [2024-01-27 16:14:03,060 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 41 selfloop transitions, 11 changer transitions 45/109 dead transitions. [2024-01-27 16:14:03,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 109 transitions, 470 flow [2024-01-27 16:14:03,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 16:14:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 16:14:03,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 250 transitions. [2024-01-27 16:14:03,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2024-01-27 16:14:03,062 INFO L175 Difference]: Start difference. First operand has 54 places, 34 transitions, 90 flow. Second operand 10 states and 250 transitions. [2024-01-27 16:14:03,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 109 transitions, 470 flow [2024-01-27 16:14:03,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 109 transitions, 434 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-01-27 16:14:03,073 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 173 flow [2024-01-27 16:14:03,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=173, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2024-01-27 16:14:03,074 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places. [2024-01-27 16:14:03,074 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 173 flow [2024-01-27 16:14:03,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:03,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:14:03,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:14:03,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:14:03,075 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:14:03,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:14:03,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1554122165, now seen corresponding path program 1 times [2024-01-27 16:14:03,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:14:03,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937830274] [2024-01-27 16:14:03,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:14:03,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:14:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:14:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:14:03,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:14:03,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937830274] [2024-01-27 16:14:03,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937830274] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:14:03,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:14:03,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:14:03,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57211167] [2024-01-27 16:14:03,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:14:03,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:14:03,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:14:03,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:14:03,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:14:03,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-01-27 16:14:03,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 173 flow. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:03,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:14:03,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-01-27 16:14:03,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:14:03,884 INFO L124 PetriNetUnfolderBase]: 1384/2748 cut-off events. [2024-01-27 16:14:03,884 INFO L125 PetriNetUnfolderBase]: For 2544/2598 co-relation queries the response was YES. [2024-01-27 16:14:03,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7648 conditions, 2748 events. 1384/2748 cut-off events. For 2544/2598 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 20316 event pairs, 438 based on Foata normal form. 82/2696 useless extension candidates. Maximal degree in co-relation 7629. Up to 1458 conditions per place. [2024-01-27 16:14:03,902 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 40 selfloop transitions, 12 changer transitions 16/88 dead transitions. [2024-01-27 16:14:03,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 88 transitions, 497 flow [2024-01-27 16:14:03,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:14:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:14:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2024-01-27 16:14:03,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2024-01-27 16:14:03,904 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 173 flow. Second operand 8 states and 200 transitions. [2024-01-27 16:14:03,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 88 transitions, 497 flow [2024-01-27 16:14:03,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 88 transitions, 481 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-01-27 16:14:03,919 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 286 flow [2024-01-27 16:14:03,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=286, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2024-01-27 16:14:03,920 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2024-01-27 16:14:03,920 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 286 flow [2024-01-27 16:14:03,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:03,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:14:03,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:14:03,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:14:03,921 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:14:03,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:14:03,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1725821287, now seen corresponding path program 1 times [2024-01-27 16:14:03,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:14:03,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735625412] [2024-01-27 16:14:03,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:14:03,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:14:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:14:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:14:04,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:14:04,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735625412] [2024-01-27 16:14:04,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735625412] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:14:04,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:14:04,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:14:04,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427392763] [2024-01-27 16:14:04,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:14:04,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:14:04,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:14:04,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:14:04,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:14:04,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-01-27 16:14:04,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:04,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:14:04,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-01-27 16:14:04,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:14:04,780 INFO L124 PetriNetUnfolderBase]: 1469/2891 cut-off events. [2024-01-27 16:14:04,780 INFO L125 PetriNetUnfolderBase]: For 3678/3806 co-relation queries the response was YES. [2024-01-27 16:14:04,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8850 conditions, 2891 events. 1469/2891 cut-off events. For 3678/3806 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 21639 event pairs, 301 based on Foata normal form. 59/2787 useless extension candidates. Maximal degree in co-relation 8828. Up to 1567 conditions per place. [2024-01-27 16:14:04,796 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 44 selfloop transitions, 18 changer transitions 27/109 dead transitions. [2024-01-27 16:14:04,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 109 transitions, 764 flow [2024-01-27 16:14:04,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:14:04,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:14:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-01-27 16:14:04,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6043360433604336 [2024-01-27 16:14:04,798 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 286 flow. Second operand 9 states and 223 transitions. [2024-01-27 16:14:04,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 109 transitions, 764 flow [2024-01-27 16:14:04,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 109 transitions, 762 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-01-27 16:14:04,805 INFO L231 Difference]: Finished difference. Result has 75 places, 66 transitions, 459 flow [2024-01-27 16:14:04,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=459, PETRI_PLACES=75, PETRI_TRANSITIONS=66} [2024-01-27 16:14:04,805 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 28 predicate places. [2024-01-27 16:14:04,805 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 459 flow [2024-01-27 16:14:04,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:04,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:14:04,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:14:04,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:14:04,806 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:14:04,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:14:04,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1303965333, now seen corresponding path program 2 times [2024-01-27 16:14:04,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:14:04,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599875446] [2024-01-27 16:14:04,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:14:04,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:14:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:14:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:14:05,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:14:05,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599875446] [2024-01-27 16:14:05,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599875446] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:14:05,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:14:05,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-27 16:14:05,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976943416] [2024-01-27 16:14:05,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:14:05,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 16:14:05,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:14:05,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 16:14:05,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-01-27 16:14:05,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-01-27 16:14:05,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 459 flow. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:05,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:14:05,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-01-27 16:14:05,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:14:05,676 INFO L124 PetriNetUnfolderBase]: 1614/3234 cut-off events. [2024-01-27 16:14:05,676 INFO L125 PetriNetUnfolderBase]: For 12112/12299 co-relation queries the response was YES. [2024-01-27 16:14:05,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12096 conditions, 3234 events. 1614/3234 cut-off events. For 12112/12299 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 25151 event pairs, 330 based on Foata normal form. 84/3147 useless extension candidates. Maximal degree in co-relation 12066. Up to 1255 conditions per place. [2024-01-27 16:14:05,699 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 49 selfloop transitions, 29 changer transitions 23/121 dead transitions. [2024-01-27 16:14:05,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 121 transitions, 1120 flow [2024-01-27 16:14:05,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 16:14:05,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 16:14:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 251 transitions. [2024-01-27 16:14:05,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6121951219512195 [2024-01-27 16:14:05,701 INFO L175 Difference]: Start difference. First operand has 75 places, 66 transitions, 459 flow. Second operand 10 states and 251 transitions. [2024-01-27 16:14:05,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 121 transitions, 1120 flow [2024-01-27 16:14:05,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 121 transitions, 1085 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-01-27 16:14:05,718 INFO L231 Difference]: Finished difference. Result has 82 places, 70 transitions, 604 flow [2024-01-27 16:14:05,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=604, PETRI_PLACES=82, PETRI_TRANSITIONS=70} [2024-01-27 16:14:05,720 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 35 predicate places. [2024-01-27 16:14:05,720 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 70 transitions, 604 flow [2024-01-27 16:14:05,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:05,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:14:05,721 INFO L208 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] [2024-01-27 16:14:05,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:14:05,721 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:14:05,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:14:05,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1999004698, now seen corresponding path program 1 times [2024-01-27 16:14:05,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:14:05,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101182866] [2024-01-27 16:14:05,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:14:05,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:14:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:14:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:14:06,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:14:06,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101182866] [2024-01-27 16:14:06,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101182866] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:14:06,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:14:06,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-27 16:14:06,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209657829] [2024-01-27 16:14:06,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:14:06,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 16:14:06,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:14:06,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 16:14:06,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-01-27 16:14:06,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-01-27 16:14:06,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 70 transitions, 604 flow. Second operand has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:06,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:14:06,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-01-27 16:14:06,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:14:07,294 INFO L124 PetriNetUnfolderBase]: 2505/4599 cut-off events. [2024-01-27 16:14:07,294 INFO L125 PetriNetUnfolderBase]: For 18645/18645 co-relation queries the response was YES. [2024-01-27 16:14:07,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17671 conditions, 4599 events. 2505/4599 cut-off events. For 18645/18645 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 34223 event pairs, 262 based on Foata normal form. 46/4622 useless extension candidates. Maximal degree in co-relation 17637. Up to 1935 conditions per place. [2024-01-27 16:14:07,330 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 72 selfloop transitions, 49 changer transitions 37/169 dead transitions. [2024-01-27 16:14:07,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 169 transitions, 1617 flow [2024-01-27 16:14:07,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-27 16:14:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-27 16:14:07,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 282 transitions. [2024-01-27 16:14:07,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.573170731707317 [2024-01-27 16:14:07,332 INFO L175 Difference]: Start difference. First operand has 82 places, 70 transitions, 604 flow. Second operand 12 states and 282 transitions. [2024-01-27 16:14:07,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 169 transitions, 1617 flow [2024-01-27 16:14:07,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 169 transitions, 1506 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-01-27 16:14:07,386 INFO L231 Difference]: Finished difference. Result has 93 places, 93 transitions, 966 flow [2024-01-27 16:14:07,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=966, PETRI_PLACES=93, PETRI_TRANSITIONS=93} [2024-01-27 16:14:07,387 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 46 predicate places. [2024-01-27 16:14:07,387 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 93 transitions, 966 flow [2024-01-27 16:14:07,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:07,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:14:07,388 INFO L208 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] [2024-01-27 16:14:07,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:14:07,388 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:14:07,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:14:07,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1416926404, now seen corresponding path program 2 times [2024-01-27 16:14:07,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:14:07,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701307433] [2024-01-27 16:14:07,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:14:07,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:14:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:14:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:14:07,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:14:07,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701307433] [2024-01-27 16:14:07,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701307433] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:14:07,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:14:07,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:14:07,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327362394] [2024-01-27 16:14:07,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:14:07,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:14:07,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:14:07,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:14:07,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:14:07,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-01-27 16:14:07,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 93 transitions, 966 flow. Second operand has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:07,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:14:07,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-01-27 16:14:07,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:14:08,559 INFO L124 PetriNetUnfolderBase]: 1781/3587 cut-off events. [2024-01-27 16:14:08,559 INFO L125 PetriNetUnfolderBase]: For 23061/23235 co-relation queries the response was YES. [2024-01-27 16:14:08,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15954 conditions, 3587 events. 1781/3587 cut-off events. For 23061/23235 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 28441 event pairs, 309 based on Foata normal form. 109/3537 useless extension candidates. Maximal degree in co-relation 15913. Up to 1294 conditions per place. [2024-01-27 16:14:08,584 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 57 selfloop transitions, 40 changer transitions 17/148 dead transitions. [2024-01-27 16:14:08,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 148 transitions, 1687 flow [2024-01-27 16:14:08,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 16:14:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 16:14:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 270 transitions. [2024-01-27 16:14:08,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5986696230598669 [2024-01-27 16:14:08,586 INFO L175 Difference]: Start difference. First operand has 93 places, 93 transitions, 966 flow. Second operand 11 states and 270 transitions. [2024-01-27 16:14:08,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 148 transitions, 1687 flow [2024-01-27 16:14:08,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 148 transitions, 1459 flow, removed 104 selfloop flow, removed 9 redundant places. [2024-01-27 16:14:08,635 INFO L231 Difference]: Finished difference. Result has 91 places, 108 transitions, 1161 flow [2024-01-27 16:14:08,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1161, PETRI_PLACES=91, PETRI_TRANSITIONS=108} [2024-01-27 16:14:08,635 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 44 predicate places. [2024-01-27 16:14:08,635 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 108 transitions, 1161 flow [2024-01-27 16:14:08,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:08,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:14:08,636 INFO L208 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] [2024-01-27 16:14:08,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 16:14:08,636 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:14:08,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:14:08,637 INFO L85 PathProgramCache]: Analyzing trace with hash -944830314, now seen corresponding path program 3 times [2024-01-27 16:14:08,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:14:08,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904770030] [2024-01-27 16:14:08,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:14:08,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:14:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:14:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:14:09,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:14:09,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904770030] [2024-01-27 16:14:09,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904770030] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:14:09,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:14:09,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:14:09,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72374626] [2024-01-27 16:14:09,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:14:09,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:14:09,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:14:09,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:14:09,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:14:09,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-01-27 16:14:09,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 108 transitions, 1161 flow. Second operand has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:09,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:14:09,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-01-27 16:14:09,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:14:09,644 INFO L124 PetriNetUnfolderBase]: 1822/3699 cut-off events. [2024-01-27 16:14:09,645 INFO L125 PetriNetUnfolderBase]: For 19931/20207 co-relation queries the response was YES. [2024-01-27 16:14:09,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16310 conditions, 3699 events. 1822/3699 cut-off events. For 19931/20207 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 29521 event pairs, 311 based on Foata normal form. 91/3622 useless extension candidates. Maximal degree in co-relation 16269. Up to 1533 conditions per place. [2024-01-27 16:14:09,670 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 75 selfloop transitions, 24 changer transitions 17/150 dead transitions. [2024-01-27 16:14:09,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 150 transitions, 1762 flow [2024-01-27 16:14:09,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:14:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:14:09,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions. [2024-01-27 16:14:09,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5934959349593496 [2024-01-27 16:14:09,671 INFO L175 Difference]: Start difference. First operand has 91 places, 108 transitions, 1161 flow. Second operand 9 states and 219 transitions. [2024-01-27 16:14:09,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 150 transitions, 1762 flow [2024-01-27 16:14:09,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 150 transitions, 1615 flow, removed 45 selfloop flow, removed 8 redundant places. [2024-01-27 16:14:09,711 INFO L231 Difference]: Finished difference. Result has 92 places, 112 transitions, 1214 flow [2024-01-27 16:14:09,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1214, PETRI_PLACES=92, PETRI_TRANSITIONS=112} [2024-01-27 16:14:09,712 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 45 predicate places. [2024-01-27 16:14:09,713 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 112 transitions, 1214 flow [2024-01-27 16:14:09,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:09,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:14:09,713 INFO L208 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] [2024-01-27 16:14:09,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 16:14:09,713 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:14:09,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:14:09,714 INFO L85 PathProgramCache]: Analyzing trace with hash 323039530, now seen corresponding path program 4 times [2024-01-27 16:14:09,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:14:09,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269041437] [2024-01-27 16:14:09,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:14:09,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:14:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:14:10,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:14:10,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:14:10,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269041437] [2024-01-27 16:14:10,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269041437] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:14:10,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:14:10,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-27 16:14:10,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604470907] [2024-01-27 16:14:10,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:14:10,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 16:14:10,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:14:10,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 16:14:10,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-01-27 16:14:10,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-01-27 16:14:10,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 112 transitions, 1214 flow. Second operand has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:10,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:14:10,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-01-27 16:14:10,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:14:10,738 INFO L124 PetriNetUnfolderBase]: 2068/4191 cut-off events. [2024-01-27 16:14:10,738 INFO L125 PetriNetUnfolderBase]: For 23456/23758 co-relation queries the response was YES. [2024-01-27 16:14:10,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17847 conditions, 4191 events. 2068/4191 cut-off events. For 23456/23758 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 34679 event pairs, 290 based on Foata normal form. 261/4279 useless extension candidates. Maximal degree in co-relation 17806. Up to 1387 conditions per place. [2024-01-27 16:14:10,775 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 55 selfloop transitions, 50 changer transitions 28/167 dead transitions. [2024-01-27 16:14:10,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 167 transitions, 1956 flow [2024-01-27 16:14:10,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 16:14:10,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 16:14:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 273 transitions. [2024-01-27 16:14:10,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6053215077605322 [2024-01-27 16:14:10,777 INFO L175 Difference]: Start difference. First operand has 92 places, 112 transitions, 1214 flow. Second operand 11 states and 273 transitions. [2024-01-27 16:14:10,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 167 transitions, 1956 flow [2024-01-27 16:14:10,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 167 transitions, 1818 flow, removed 54 selfloop flow, removed 7 redundant places. [2024-01-27 16:14:10,843 INFO L231 Difference]: Finished difference. Result has 97 places, 114 transitions, 1345 flow [2024-01-27 16:14:10,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1345, PETRI_PLACES=97, PETRI_TRANSITIONS=114} [2024-01-27 16:14:10,843 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 50 predicate places. [2024-01-27 16:14:10,844 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 114 transitions, 1345 flow [2024-01-27 16:14:10,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:10,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:14:10,844 INFO L208 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] [2024-01-27 16:14:10,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 16:14:10,844 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:14:10,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:14:10,845 INFO L85 PathProgramCache]: Analyzing trace with hash 562254508, now seen corresponding path program 1 times [2024-01-27 16:14:10,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:14:10,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606865612] [2024-01-27 16:14:10,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:14:10,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:14:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:14:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:14:10,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:14:10,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606865612] [2024-01-27 16:14:10,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606865612] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:14:10,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:14:10,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:14:10,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661384595] [2024-01-27 16:14:10,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:14:10,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:14:10,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:14:10,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:14:10,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:14:10,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2024-01-27 16:14:10,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 114 transitions, 1345 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:10,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:14:10,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2024-01-27 16:14:10,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:14:11,598 INFO L124 PetriNetUnfolderBase]: 4289/7283 cut-off events. [2024-01-27 16:14:11,599 INFO L125 PetriNetUnfolderBase]: For 58354/59836 co-relation queries the response was YES. [2024-01-27 16:14:11,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30167 conditions, 7283 events. 4289/7283 cut-off events. For 58354/59836 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 53570 event pairs, 636 based on Foata normal form. 684/7583 useless extension candidates. Maximal degree in co-relation 30125. Up to 3741 conditions per place. [2024-01-27 16:14:11,643 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 135 selfloop transitions, 5 changer transitions 4/178 dead transitions. [2024-01-27 16:14:11,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 178 transitions, 2545 flow [2024-01-27 16:14:11,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:14:11,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:14:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2024-01-27 16:14:11,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6829268292682927 [2024-01-27 16:14:11,644 INFO L175 Difference]: Start difference. First operand has 97 places, 114 transitions, 1345 flow. Second operand 4 states and 112 transitions. [2024-01-27 16:14:11,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 178 transitions, 2545 flow [2024-01-27 16:14:11,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 178 transitions, 2435 flow, removed 18 selfloop flow, removed 11 redundant places. [2024-01-27 16:14:11,692 INFO L231 Difference]: Finished difference. Result has 87 places, 109 transitions, 1199 flow [2024-01-27 16:14:11,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1199, PETRI_PLACES=87, PETRI_TRANSITIONS=109} [2024-01-27 16:14:11,692 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 40 predicate places. [2024-01-27 16:14:11,693 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 109 transitions, 1199 flow [2024-01-27 16:14:11,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:11,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:14:11,693 INFO L208 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] [2024-01-27 16:14:11,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 16:14:11,693 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:14:11,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:14:11,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1581145813, now seen corresponding path program 1 times [2024-01-27 16:14:11,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:14:11,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427673152] [2024-01-27 16:14:11,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:14:11,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:14:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:14:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:14:11,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:14:11,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427673152] [2024-01-27 16:14:11,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427673152] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:14:11,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:14:11,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:14:11,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539333876] [2024-01-27 16:14:11,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:14:11,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:14:11,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:14:11,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:14:11,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:14:11,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2024-01-27 16:14:11,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 109 transitions, 1199 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:11,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:14:11,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2024-01-27 16:14:11,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:14:12,276 INFO L124 PetriNetUnfolderBase]: 3235/5564 cut-off events. [2024-01-27 16:14:12,276 INFO L125 PetriNetUnfolderBase]: For 40174/41834 co-relation queries the response was YES. [2024-01-27 16:14:12,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23469 conditions, 5564 events. 3235/5564 cut-off events. For 40174/41834 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 39301 event pairs, 299 based on Foata normal form. 534/5771 useless extension candidates. Maximal degree in co-relation 23433. Up to 1988 conditions per place. [2024-01-27 16:14:12,308 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 119 selfloop transitions, 8 changer transitions 7/167 dead transitions. [2024-01-27 16:14:12,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 167 transitions, 2197 flow [2024-01-27 16:14:12,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:14:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:14:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2024-01-27 16:14:12,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6926829268292682 [2024-01-27 16:14:12,310 INFO L175 Difference]: Start difference. First operand has 87 places, 109 transitions, 1199 flow. Second operand 5 states and 142 transitions. [2024-01-27 16:14:12,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 167 transitions, 2197 flow [2024-01-27 16:14:12,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 167 transitions, 2094 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-01-27 16:14:12,333 INFO L231 Difference]: Finished difference. Result has 88 places, 96 transitions, 929 flow [2024-01-27 16:14:12,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=929, PETRI_PLACES=88, PETRI_TRANSITIONS=96} [2024-01-27 16:14:12,334 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 41 predicate places. [2024-01-27 16:14:12,334 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 96 transitions, 929 flow [2024-01-27 16:14:12,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:12,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:14:12,335 INFO L208 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] [2024-01-27 16:14:12,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 16:14:12,335 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:14:12,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:14:12,335 INFO L85 PathProgramCache]: Analyzing trace with hash 278638504, now seen corresponding path program 1 times [2024-01-27 16:14:12,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:14:12,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578872239] [2024-01-27 16:14:12,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:14:12,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:14:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:14:12,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:14:12,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:14:12,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578872239] [2024-01-27 16:14:12,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578872239] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:14:12,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:14:12,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:14:12,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018346849] [2024-01-27 16:14:12,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:14:12,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:14:12,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:14:12,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:14:12,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:14:12,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2024-01-27 16:14:12,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 96 transitions, 929 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:12,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:14:12,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2024-01-27 16:14:12,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:14:13,088 INFO L124 PetriNetUnfolderBase]: 3429/6857 cut-off events. [2024-01-27 16:14:13,088 INFO L125 PetriNetUnfolderBase]: For 32971/34241 co-relation queries the response was YES. [2024-01-27 16:14:13,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27340 conditions, 6857 events. 3429/6857 cut-off events. For 32971/34241 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 58688 event pairs, 1127 based on Foata normal form. 314/6525 useless extension candidates. Maximal degree in co-relation 27304. Up to 2681 conditions per place. [2024-01-27 16:14:13,121 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 69 selfloop transitions, 1 changer transitions 57/165 dead transitions. [2024-01-27 16:14:13,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 165 transitions, 2007 flow [2024-01-27 16:14:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:14:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:14:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2024-01-27 16:14:13,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6382113821138211 [2024-01-27 16:14:13,123 INFO L175 Difference]: Start difference. First operand has 88 places, 96 transitions, 929 flow. Second operand 6 states and 157 transitions. [2024-01-27 16:14:13,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 165 transitions, 2007 flow [2024-01-27 16:14:13,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 165 transitions, 1995 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-01-27 16:14:13,167 INFO L231 Difference]: Finished difference. Result has 95 places, 84 transitions, 796 flow [2024-01-27 16:14:13,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=796, PETRI_PLACES=95, PETRI_TRANSITIONS=84} [2024-01-27 16:14:13,168 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 48 predicate places. [2024-01-27 16:14:13,168 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 84 transitions, 796 flow [2024-01-27 16:14:13,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:13,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:14:13,168 INFO L208 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] [2024-01-27 16:14:13,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 16:14:13,169 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:14:13,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:14:13,169 INFO L85 PathProgramCache]: Analyzing trace with hash -273651178, now seen corresponding path program 2 times [2024-01-27 16:14:13,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:14:13,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799007463] [2024-01-27 16:14:13,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:14:13,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:14:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:14:13,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:14:13,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:14:13,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799007463] [2024-01-27 16:14:13,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799007463] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:14:13,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:14:13,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:14:13,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686792649] [2024-01-27 16:14:13,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:14:13,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:14:13,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:14:13,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:14:13,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:14:13,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2024-01-27 16:14:13,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 84 transitions, 796 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:13,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:14:13,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2024-01-27 16:14:13,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:14:13,855 INFO L124 PetriNetUnfolderBase]: 2550/5388 cut-off events. [2024-01-27 16:14:13,856 INFO L125 PetriNetUnfolderBase]: For 24328/24898 co-relation queries the response was YES. [2024-01-27 16:14:13,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20276 conditions, 5388 events. 2550/5388 cut-off events. For 24328/24898 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 45998 event pairs, 1000 based on Foata normal form. 201/5062 useless extension candidates. Maximal degree in co-relation 20237. Up to 2078 conditions per place. [2024-01-27 16:14:13,880 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 43 selfloop transitions, 4 changer transitions 55/127 dead transitions. [2024-01-27 16:14:13,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 127 transitions, 1388 flow [2024-01-27 16:14:13,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:14:13,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:14:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-01-27 16:14:13,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6202090592334495 [2024-01-27 16:14:13,882 INFO L175 Difference]: Start difference. First operand has 95 places, 84 transitions, 796 flow. Second operand 7 states and 178 transitions. [2024-01-27 16:14:13,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 127 transitions, 1388 flow [2024-01-27 16:14:13,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 127 transitions, 1371 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-01-27 16:14:13,922 INFO L231 Difference]: Finished difference. Result has 99 places, 64 transitions, 574 flow [2024-01-27 16:14:13,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=574, PETRI_PLACES=99, PETRI_TRANSITIONS=64} [2024-01-27 16:14:13,922 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 52 predicate places. [2024-01-27 16:14:13,922 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 64 transitions, 574 flow [2024-01-27 16:14:13,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:13,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:14:13,923 INFO L208 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] [2024-01-27 16:14:13,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-27 16:14:13,923 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:14:13,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:14:13,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1899054724, now seen corresponding path program 1 times [2024-01-27 16:14:13,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:14:13,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457906046] [2024-01-27 16:14:13,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:14:13,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:14:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:14:14,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:14:14,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:14:14,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457906046] [2024-01-27 16:14:14,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457906046] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:14:14,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:14:14,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:14:14,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256790038] [2024-01-27 16:14:14,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:14:14,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:14:14,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:14:14,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:14:14,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:14:14,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2024-01-27 16:14:14,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 64 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:14,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:14:14,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2024-01-27 16:14:14,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:14:14,341 INFO L124 PetriNetUnfolderBase]: 1838/3350 cut-off events. [2024-01-27 16:14:14,342 INFO L125 PetriNetUnfolderBase]: For 19041/20450 co-relation queries the response was YES. [2024-01-27 16:14:14,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12656 conditions, 3350 events. 1838/3350 cut-off events. For 19041/20450 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 22633 event pairs, 171 based on Foata normal form. 290/3482 useless extension candidates. Maximal degree in co-relation 12615. Up to 1400 conditions per place. [2024-01-27 16:14:14,356 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 36 selfloop transitions, 11 changer transitions 32/92 dead transitions. [2024-01-27 16:14:14,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 92 transitions, 986 flow [2024-01-27 16:14:14,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:14:14,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:14:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2024-01-27 16:14:14,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6219512195121951 [2024-01-27 16:14:14,357 INFO L175 Difference]: Start difference. First operand has 99 places, 64 transitions, 574 flow. Second operand 6 states and 153 transitions. [2024-01-27 16:14:14,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 92 transitions, 986 flow [2024-01-27 16:14:14,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 92 transitions, 890 flow, removed 35 selfloop flow, removed 10 redundant places. [2024-01-27 16:14:14,372 INFO L231 Difference]: Finished difference. Result has 91 places, 42 transitions, 308 flow [2024-01-27 16:14:14,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=91, PETRI_TRANSITIONS=42} [2024-01-27 16:14:14,373 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 44 predicate places. [2024-01-27 16:14:14,373 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 42 transitions, 308 flow [2024-01-27 16:14:14,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:14:14,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:14:14,374 INFO L208 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] [2024-01-27 16:14:14,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-27 16:14:14,374 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:14:14,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:14:14,374 INFO L85 PathProgramCache]: Analyzing trace with hash -675928146, now seen corresponding path program 1 times [2024-01-27 16:14:14,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:14:14,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350301484] [2024-01-27 16:14:14,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:14:14,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:14:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:14:14,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:14:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:14:14,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:14:14,458 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:14:14,459 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-01-27 16:14:14,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-01-27 16:14:14,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-01-27 16:14:14,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-01-27 16:14:14,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-01-27 16:14:14,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-01-27 16:14:14,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-27 16:14:14,463 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:14:14,468 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:14:14,469 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:14:14,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:14:14 BasicIcfg [2024-01-27 16:14:14,543 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:14:14,543 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:14:14,543 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:14:14,543 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:14:14,544 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:14:00" (3/4) ... [2024-01-27 16:14:14,545 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:14:14,652 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:14:14,653 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:14:14,653 INFO L158 Benchmark]: Toolchain (without parser) took 15445.48ms. Allocated memory was 163.6MB in the beginning and 1.1GB in the end (delta: 887.1MB). Free memory was 134.1MB in the beginning and 551.5MB in the end (delta: -417.4MB). Peak memory consumption was 468.6MB. Max. memory is 16.1GB. [2024-01-27 16:14:14,653 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:14:14,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.15ms. Allocated memory is still 163.6MB. Free memory was 134.1MB in the beginning and 110.0MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-01-27 16:14:14,654 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.68ms. Allocated memory is still 163.6MB. Free memory was 110.0MB in the beginning and 107.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:14:14,654 INFO L158 Benchmark]: Boogie Preprocessor took 65.99ms. Allocated memory is still 163.6MB. Free memory was 107.9MB in the beginning and 104.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 16:14:14,654 INFO L158 Benchmark]: RCFGBuilder took 679.81ms. Allocated memory is still 163.6MB. Free memory was 103.7MB in the beginning and 58.6MB in the end (delta: 45.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-01-27 16:14:14,654 INFO L158 Benchmark]: TraceAbstraction took 14138.22ms. Allocated memory was 163.6MB in the beginning and 1.1GB in the end (delta: 887.1MB). Free memory was 58.6MB in the beginning and 564.1MB in the end (delta: -505.5MB). Peak memory consumption was 380.5MB. Max. memory is 16.1GB. [2024-01-27 16:14:14,655 INFO L158 Benchmark]: Witness Printer took 109.52ms. Allocated memory is still 1.1GB. Free memory was 564.1MB in the beginning and 551.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-01-27 16:14:14,656 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.15ms. Allocated memory is still 163.6MB. Free memory was 134.1MB in the beginning and 110.0MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.68ms. Allocated memory is still 163.6MB. Free memory was 110.0MB in the beginning and 107.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.99ms. Allocated memory is still 163.6MB. Free memory was 107.9MB in the beginning and 104.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 679.81ms. Allocated memory is still 163.6MB. Free memory was 103.7MB in the beginning and 58.6MB in the end (delta: 45.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14138.22ms. Allocated memory was 163.6MB in the beginning and 1.1GB in the end (delta: 887.1MB). Free memory was 58.6MB in the beginning and 564.1MB in the end (delta: -505.5MB). Peak memory consumption was 380.5MB. Max. memory is 16.1GB. * Witness Printer took 109.52ms. Allocated memory is still 1.1GB. Free memory was 564.1MB in the beginning and 551.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1196; [L824] FCALL, FORK 0 pthread_create(&t1196, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t1197; [L826] FCALL, FORK 0 pthread_create(&t1197, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t1198; [L828] FCALL, FORK 0 pthread_create(&t1198, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L784] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L784] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 704 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 667 mSDsluCounter, 331 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 272 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2368 IncrementalHoareTripleChecker+Invalid, 2477 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 59 mSDtfsCounter, 2368 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1345occurred in iteration=10, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 2456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 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! [2024-01-27 16:14:14,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE