./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.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 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:15:44,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:15:44,572 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:15:44,575 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:15:44,576 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:15:44,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:15:44,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:15:44,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:15:44,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:15:44,633 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:15:44,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:15:44,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:15:44,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:15:44,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:15:44,636 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:15:44,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:15:44,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:15:44,637 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:15:44,638 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:15:44,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:15:44,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:15:44,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:15:44,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:15:44,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:15:44,639 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:15:44,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:15:44,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:15:44,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:15:44,641 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:15:44,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:15:44,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:15:44,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:15:44,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:15:44,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:15:44,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:15:44,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:15:44,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:15:44,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:15:44,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:15:44,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:15:44,644 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:15:44,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:15:44,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:15:44,645 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 -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2024-01-27 16:15:44,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:15:44,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:15:44,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:15:44,926 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:15:44,927 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:15:44,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-01-27 16:15:46,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:15:46,519 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:15:46,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-01-27 16:15:46,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529b78421/b9a557d307234d30a9dd18be970d145a/FLAG82e3f3c20 [2024-01-27 16:15:46,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529b78421/b9a557d307234d30a9dd18be970d145a [2024-01-27 16:15:46,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:15:46,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:15:46,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:15:46,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:15:46,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:15:46,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:15:46" (1/1) ... [2024-01-27 16:15:46,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@387dd931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:46, skipping insertion in model container [2024-01-27 16:15:46,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:15:46" (1/1) ... [2024-01-27 16:15:46,608 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:15:46,761 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2024-01-27 16:15:46,971 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:15:46,987 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:15:47,002 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2024-01-27 16:15:47,062 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:15:47,103 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:15:47,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:47 WrapperNode [2024-01-27 16:15:47,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:15:47,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:15:47,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:15:47,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:15:47,114 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:15:47" (1/1) ... [2024-01-27 16:15:47,135 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:15:47" (1/1) ... [2024-01-27 16:15:47,183 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2024-01-27 16:15:47,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:15:47,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:15:47,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:15:47,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:15:47,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:47" (1/1) ... [2024-01-27 16:15:47,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:47" (1/1) ... [2024-01-27 16:15:47,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:47" (1/1) ... [2024-01-27 16:15:47,240 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:15:47,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:47" (1/1) ... [2024-01-27 16:15:47,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:47" (1/1) ... [2024-01-27 16:15:47,264 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:47" (1/1) ... [2024-01-27 16:15:47,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:47" (1/1) ... [2024-01-27 16:15:47,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:47" (1/1) ... [2024-01-27 16:15:47,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:47" (1/1) ... [2024-01-27 16:15:47,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:15:47,281 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:15:47,281 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:15:47,281 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:15:47,282 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:47" (1/1) ... [2024-01-27 16:15:47,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:15:47,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:15:47,318 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:15:47,348 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:15:47,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:15:47,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:15:47,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:15:47,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:15:47,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:15:47,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:15:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:15:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:15:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-27 16:15:47,378 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-27 16:15:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-27 16:15:47,378 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-27 16:15:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-27 16:15:47,378 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-27 16:15:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:15:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:15:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:15:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:15:47,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:15:47,384 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:15:47,533 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:15:47,534 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:15:47,803 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:15:47,803 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:15:47,994 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:15:47,994 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 16:15:47,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:15:47 BoogieIcfgContainer [2024-01-27 16:15:47,995 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:15:47,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:15:47,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:15:48,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:15:48,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:15:46" (1/3) ... [2024-01-27 16:15:48,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413c4a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:15:48, skipping insertion in model container [2024-01-27 16:15:48,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:47" (2/3) ... [2024-01-27 16:15:48,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413c4a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:15:48, skipping insertion in model container [2024-01-27 16:15:48,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:15:47" (3/3) ... [2024-01-27 16:15:48,003 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-01-27 16:15:48,011 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:15:48,020 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:15:48,021 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-01-27 16:15:48,021 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:15:48,057 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 16:15:48,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-01-27 16:15:48,121 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-01-27 16:15:48,121 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:15:48,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2024-01-27 16:15:48,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-01-27 16:15:48,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-01-27 16:15:48,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:15:48,161 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;@67e4ffc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:15:48,161 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-01-27 16:15:48,166 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:15:48,167 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-01-27 16:15:48,167 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:15:48,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:48,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-27 16:15:48,168 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:48,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:48,175 INFO L85 PathProgramCache]: Analyzing trace with hash 11139069, now seen corresponding path program 1 times [2024-01-27 16:15:48,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:48,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457940841] [2024-01-27 16:15:48,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:48,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:48,553 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:15:48,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:48,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457940841] [2024-01-27 16:15:48,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457940841] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:48,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:48,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 16:15:48,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976200367] [2024-01-27 16:15:48,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:48,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:15:48,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:48,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:15:48,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:15:48,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2024-01-27 16:15:48,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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:15:48,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:48,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2024-01-27 16:15:48,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:48,895 INFO L124 PetriNetUnfolderBase]: 530/980 cut-off events. [2024-01-27 16:15:48,896 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-27 16:15:48,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 980 events. 530/980 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5537 event pairs, 284 based on Foata normal form. 36/992 useless extension candidates. Maximal degree in co-relation 1823. Up to 664 conditions per place. [2024-01-27 16:15:48,906 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 29 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2024-01-27 16:15:48,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 177 flow [2024-01-27 16:15:48,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:15:48,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:15:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-01-27 16:15:48,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7692307692307693 [2024-01-27 16:15:48,921 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 90 transitions. [2024-01-27 16:15:48,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 177 flow [2024-01-27 16:15:48,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:15:48,926 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-01-27 16:15:48,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-01-27 16:15:48,931 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-01-27 16:15:48,932 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-01-27 16:15:48,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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:15:48,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:48,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:15:48,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:15:48,933 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:48,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:48,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1800742136, now seen corresponding path program 1 times [2024-01-27 16:15:48,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:48,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897739805] [2024-01-27 16:15:48,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:48,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:49,293 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:15:49,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:49,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897739805] [2024-01-27 16:15:49,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897739805] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:49,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:49,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:15:49,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662207706] [2024-01-27 16:15:49,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:49,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:15:49,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:49,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:15:49,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:15:49,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-01-27 16:15:49,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 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:15:49,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:49,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-01-27 16:15:49,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:49,782 INFO L124 PetriNetUnfolderBase]: 1356/2342 cut-off events. [2024-01-27 16:15:49,783 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-01-27 16:15:49,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4571 conditions, 2342 events. 1356/2342 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 15572 event pairs, 354 based on Foata normal form. 0/2274 useless extension candidates. Maximal degree in co-relation 4561. Up to 1288 conditions per place. [2024-01-27 16:15:49,801 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 30 selfloop transitions, 3 changer transitions 43/87 dead transitions. [2024-01-27 16:15:49,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 87 transitions, 352 flow [2024-01-27 16:15:49,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:15:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:15:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2024-01-27 16:15:49,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6089743589743589 [2024-01-27 16:15:49,805 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 8 states and 190 transitions. [2024-01-27 16:15:49,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 87 transitions, 352 flow [2024-01-27 16:15:49,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 87 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:15:49,807 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 105 flow [2024-01-27 16:15:49,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=105, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2024-01-27 16:15:49,808 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-01-27 16:15:49,808 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 105 flow [2024-01-27 16:15:49,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 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:15:49,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:49,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:15:49,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:15:49,810 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:49,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:49,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1118530345, now seen corresponding path program 1 times [2024-01-27 16:15:49,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:49,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885640092] [2024-01-27 16:15:49,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:49,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:50,659 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:15:50,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:50,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885640092] [2024-01-27 16:15:50,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885640092] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:50,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:50,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:15:50,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549120283] [2024-01-27 16:15:50,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:50,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:15:50,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:50,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:15:50,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:15:50,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-01-27 16:15:50,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 105 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:50,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:50,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-01-27 16:15:50,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:51,376 INFO L124 PetriNetUnfolderBase]: 1564/2688 cut-off events. [2024-01-27 16:15:51,377 INFO L125 PetriNetUnfolderBase]: For 1726/1726 co-relation queries the response was YES. [2024-01-27 16:15:51,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6389 conditions, 2688 events. 1564/2688 cut-off events. For 1726/1726 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16533 event pairs, 265 based on Foata normal form. 84/2756 useless extension candidates. Maximal degree in co-relation 6374. Up to 1376 conditions per place. [2024-01-27 16:15:51,396 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 38 selfloop transitions, 9 changer transitions 51/108 dead transitions. [2024-01-27 16:15:51,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 108 transitions, 557 flow [2024-01-27 16:15:51,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 16:15:51,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 16:15:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 227 transitions. [2024-01-27 16:15:51,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5820512820512821 [2024-01-27 16:15:51,402 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 105 flow. Second operand 10 states and 227 transitions. [2024-01-27 16:15:51,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 108 transitions, 557 flow [2024-01-27 16:15:51,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 108 transitions, 538 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-01-27 16:15:51,414 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 212 flow [2024-01-27 16:15:51,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=212, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2024-01-27 16:15:51,415 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2024-01-27 16:15:51,415 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 212 flow [2024-01-27 16:15:51,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:51,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:51,416 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:15:51,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:15:51,416 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:51,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:51,417 INFO L85 PathProgramCache]: Analyzing trace with hash -672310628, now seen corresponding path program 1 times [2024-01-27 16:15:51,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:51,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343738792] [2024-01-27 16:15:51,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:51,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:51,605 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:15:51,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:51,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343738792] [2024-01-27 16:15:51,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343738792] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:51,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:51,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:15:51,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746508686] [2024-01-27 16:15:51,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:51,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:15:51,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:51,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:15:51,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:15:51,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-01-27 16:15:51,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:51,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:51,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-01-27 16:15:51,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:52,196 INFO L124 PetriNetUnfolderBase]: 1932/3214 cut-off events. [2024-01-27 16:15:52,197 INFO L125 PetriNetUnfolderBase]: For 6872/7033 co-relation queries the response was YES. [2024-01-27 16:15:52,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10704 conditions, 3214 events. 1932/3214 cut-off events. For 6872/7033 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 20037 event pairs, 350 based on Foata normal form. 130/3253 useless extension candidates. Maximal degree in co-relation 10681. Up to 1231 conditions per place. [2024-01-27 16:15:52,222 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 38 selfloop transitions, 3 changer transitions 54/109 dead transitions. [2024-01-27 16:15:52,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 109 transitions, 730 flow [2024-01-27 16:15:52,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:15:52,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:15:52,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2024-01-27 16:15:52,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2024-01-27 16:15:52,226 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 212 flow. Second operand 8 states and 186 transitions. [2024-01-27 16:15:52,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 109 transitions, 730 flow [2024-01-27 16:15:52,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 109 transitions, 701 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-01-27 16:15:52,249 INFO L231 Difference]: Finished difference. Result has 63 places, 39 transitions, 198 flow [2024-01-27 16:15:52,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=198, PETRI_PLACES=63, PETRI_TRANSITIONS=39} [2024-01-27 16:15:52,251 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2024-01-27 16:15:52,251 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 39 transitions, 198 flow [2024-01-27 16:15:52,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:52,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:52,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:15:52,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:15:52,252 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:52,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:52,253 INFO L85 PathProgramCache]: Analyzing trace with hash 520244005, now seen corresponding path program 1 times [2024-01-27 16:15:52,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:52,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128603339] [2024-01-27 16:15:52,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:52,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:53,050 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:15:53,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:53,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128603339] [2024-01-27 16:15:53,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128603339] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:53,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:53,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:15:53,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970950220] [2024-01-27 16:15:53,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:53,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:15:53,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:53,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:15:53,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:15:53,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-01-27 16:15:53,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 39 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:53,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:53,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-01-27 16:15:53,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:53,752 INFO L124 PetriNetUnfolderBase]: 1577/2592 cut-off events. [2024-01-27 16:15:53,752 INFO L125 PetriNetUnfolderBase]: For 6440/6440 co-relation queries the response was YES. [2024-01-27 16:15:53,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9227 conditions, 2592 events. 1577/2592 cut-off events. For 6440/6440 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14630 event pairs, 428 based on Foata normal form. 72/2658 useless extension candidates. Maximal degree in co-relation 9201. Up to 1631 conditions per place. [2024-01-27 16:15:53,776 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 44 selfloop transitions, 17 changer transitions 49/119 dead transitions. [2024-01-27 16:15:53,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 119 transitions, 814 flow [2024-01-27 16:15:53,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 16:15:53,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 16:15:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 222 transitions. [2024-01-27 16:15:53,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2024-01-27 16:15:53,778 INFO L175 Difference]: Start difference. First operand has 63 places, 39 transitions, 198 flow. Second operand 10 states and 222 transitions. [2024-01-27 16:15:53,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 119 transitions, 814 flow [2024-01-27 16:15:53,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 119 transitions, 756 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-01-27 16:15:53,800 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 320 flow [2024-01-27 16:15:53,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=320, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2024-01-27 16:15:53,803 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2024-01-27 16:15:53,803 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 320 flow [2024-01-27 16:15:53,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:53,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:53,804 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:15:53,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:15:53,804 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:53,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:53,810 INFO L85 PathProgramCache]: Analyzing trace with hash 381352530, now seen corresponding path program 1 times [2024-01-27 16:15:53,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:53,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585316960] [2024-01-27 16:15:53,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:53,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:54,258 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:15:54,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:54,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585316960] [2024-01-27 16:15:54,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585316960] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:54,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:54,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:15:54,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909528752] [2024-01-27 16:15:54,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:54,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:15:54,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:54,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:15:54,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:15:54,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-01-27 16:15:54,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 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:15:54,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:54,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-01-27 16:15:54,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:54,775 INFO L124 PetriNetUnfolderBase]: 1271/2134 cut-off events. [2024-01-27 16:15:54,776 INFO L125 PetriNetUnfolderBase]: For 11545/11657 co-relation queries the response was YES. [2024-01-27 16:15:54,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9861 conditions, 2134 events. 1271/2134 cut-off events. For 11545/11657 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12016 event pairs, 524 based on Foata normal form. 109/2175 useless extension candidates. Maximal degree in co-relation 9833. Up to 1378 conditions per place. [2024-01-27 16:15:54,795 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 39 selfloop transitions, 8 changer transitions 31/95 dead transitions. [2024-01-27 16:15:54,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 804 flow [2024-01-27 16:15:54,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:15:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:15:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2024-01-27 16:15:54,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2024-01-27 16:15:54,796 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 320 flow. Second operand 8 states and 186 transitions. [2024-01-27 16:15:54,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 804 flow [2024-01-27 16:15:54,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 95 transitions, 698 flow, removed 53 selfloop flow, removed 4 redundant places. [2024-01-27 16:15:54,812 INFO L231 Difference]: Finished difference. Result has 71 places, 50 transitions, 350 flow [2024-01-27 16:15:54,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=350, PETRI_PLACES=71, PETRI_TRANSITIONS=50} [2024-01-27 16:15:54,813 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2024-01-27 16:15:54,813 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 50 transitions, 350 flow [2024-01-27 16:15:54,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 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:15:54,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:54,814 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:15:54,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:15:54,814 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:54,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:54,815 INFO L85 PathProgramCache]: Analyzing trace with hash 937206473, now seen corresponding path program 1 times [2024-01-27 16:15:54,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:54,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192700139] [2024-01-27 16:15:54,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:54,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:54,918 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:15:54,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:54,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192700139] [2024-01-27 16:15:54,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192700139] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:54,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:54,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:15:54,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158830054] [2024-01-27 16:15:54,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:54,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:15:54,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:54,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:15:54,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:15:54,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-01-27 16:15:54,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 50 transitions, 350 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:54,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:54,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-01-27 16:15:54,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:55,401 INFO L124 PetriNetUnfolderBase]: 2188/3439 cut-off events. [2024-01-27 16:15:55,402 INFO L125 PetriNetUnfolderBase]: For 10143/10598 co-relation queries the response was YES. [2024-01-27 16:15:55,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12807 conditions, 3439 events. 2188/3439 cut-off events. For 10143/10598 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 18789 event pairs, 372 based on Foata normal form. 334/3614 useless extension candidates. Maximal degree in co-relation 12775. Up to 1699 conditions per place. [2024-01-27 16:15:55,433 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 66 selfloop transitions, 5 changer transitions 0/87 dead transitions. [2024-01-27 16:15:55,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 87 transitions, 726 flow [2024-01-27 16:15:55,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:15:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:15:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-01-27 16:15:55,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6602564102564102 [2024-01-27 16:15:55,434 INFO L175 Difference]: Start difference. First operand has 71 places, 50 transitions, 350 flow. Second operand 4 states and 103 transitions. [2024-01-27 16:15:55,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 87 transitions, 726 flow [2024-01-27 16:15:55,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 87 transitions, 682 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-01-27 16:15:55,451 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 362 flow [2024-01-27 16:15:55,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=362, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2024-01-27 16:15:55,452 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2024-01-27 16:15:55,452 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 362 flow [2024-01-27 16:15:55,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:55,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:55,453 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:15:55,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:15:55,453 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:55,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:55,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1362699452, now seen corresponding path program 1 times [2024-01-27 16:15:55,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:55,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844992622] [2024-01-27 16:15:55,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:55,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:55,603 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:15:55,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:55,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844992622] [2024-01-27 16:15:55,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844992622] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:55,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:55,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:15:55,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995506231] [2024-01-27 16:15:55,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:55,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:15:55,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:55,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:15:55,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:15:55,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-01-27 16:15:55,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 362 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:55,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:55,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-01-27 16:15:55,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:55,993 INFO L124 PetriNetUnfolderBase]: 1583/2528 cut-off events. [2024-01-27 16:15:55,994 INFO L125 PetriNetUnfolderBase]: For 6179/6525 co-relation queries the response was YES. [2024-01-27 16:15:56,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9427 conditions, 2528 events. 1583/2528 cut-off events. For 6179/6525 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13132 event pairs, 233 based on Foata normal form. 271/2651 useless extension candidates. Maximal degree in co-relation 9396. Up to 886 conditions per place. [2024-01-27 16:15:56,017 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 70 selfloop transitions, 8 changer transitions 0/94 dead transitions. [2024-01-27 16:15:56,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 94 transitions, 732 flow [2024-01-27 16:15:56,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:15:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:15:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2024-01-27 16:15:56,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6717948717948717 [2024-01-27 16:15:56,022 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 362 flow. Second operand 5 states and 131 transitions. [2024-01-27 16:15:56,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 94 transitions, 732 flow [2024-01-27 16:15:56,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 94 transitions, 729 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:15:56,029 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 396 flow [2024-01-27 16:15:56,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=396, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2024-01-27 16:15:56,032 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2024-01-27 16:15:56,032 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 396 flow [2024-01-27 16:15:56,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:56,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:56,033 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:15:56,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 16:15:56,033 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:56,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:56,033 INFO L85 PathProgramCache]: Analyzing trace with hash -812898584, now seen corresponding path program 1 times [2024-01-27 16:15:56,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:56,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917442128] [2024-01-27 16:15:56,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:56,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:56,221 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:15:56,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:56,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917442128] [2024-01-27 16:15:56,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917442128] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:56,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:56,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:15:56,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753941342] [2024-01-27 16:15:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:56,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:15:56,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:56,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:15:56,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:15:56,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-01-27 16:15:56,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:56,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:56,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-01-27 16:15:56,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:56,570 INFO L124 PetriNetUnfolderBase]: 1271/1996 cut-off events. [2024-01-27 16:15:56,570 INFO L125 PetriNetUnfolderBase]: For 6197/6527 co-relation queries the response was YES. [2024-01-27 16:15:56,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8029 conditions, 1996 events. 1271/1996 cut-off events. For 6197/6527 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10059 event pairs, 205 based on Foata normal form. 193/2045 useless extension candidates. Maximal degree in co-relation 7995. Up to 811 conditions per place. [2024-01-27 16:15:56,585 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 62 selfloop transitions, 11 changer transitions 1/90 dead transitions. [2024-01-27 16:15:56,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 90 transitions, 714 flow [2024-01-27 16:15:56,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:15:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:15:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-01-27 16:15:56,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-01-27 16:15:56,590 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 396 flow. Second operand 6 states and 143 transitions. [2024-01-27 16:15:56,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 90 transitions, 714 flow [2024-01-27 16:15:56,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 90 transitions, 636 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-01-27 16:15:56,600 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 354 flow [2024-01-27 16:15:56,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=354, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2024-01-27 16:15:56,601 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2024-01-27 16:15:56,601 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 354 flow [2024-01-27 16:15:56,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:56,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:56,602 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] [2024-01-27 16:15:56,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 16:15:56,602 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:56,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:56,603 INFO L85 PathProgramCache]: Analyzing trace with hash -323930240, now seen corresponding path program 1 times [2024-01-27 16:15:56,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:56,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892374849] [2024-01-27 16:15:56,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:56,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:57,576 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:15:57,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:57,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892374849] [2024-01-27 16:15:57,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892374849] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:57,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:57,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:15:57,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015974970] [2024-01-27 16:15:57,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:57,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:15:57,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:57,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:15:57,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:15:57,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-01-27 16:15:57,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 354 flow. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:57,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:57,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-01-27 16:15:57,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:58,015 INFO L124 PetriNetUnfolderBase]: 1013/1910 cut-off events. [2024-01-27 16:15:58,016 INFO L125 PetriNetUnfolderBase]: For 4421/4734 co-relation queries the response was YES. [2024-01-27 16:15:58,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6611 conditions, 1910 events. 1013/1910 cut-off events. For 4421/4734 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 11855 event pairs, 191 based on Foata normal form. 37/1799 useless extension candidates. Maximal degree in co-relation 6581. Up to 825 conditions per place. [2024-01-27 16:15:58,031 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 61 selfloop transitions, 23 changer transitions 11/112 dead transitions. [2024-01-27 16:15:58,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 112 transitions, 815 flow [2024-01-27 16:15:58,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:15:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:15:58,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2024-01-27 16:15:58,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5327635327635327 [2024-01-27 16:15:58,033 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 354 flow. Second operand 9 states and 187 transitions. [2024-01-27 16:15:58,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 112 transitions, 815 flow [2024-01-27 16:15:58,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 112 transitions, 721 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-01-27 16:15:58,053 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 490 flow [2024-01-27 16:15:58,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=490, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2024-01-27 16:15:58,055 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places. [2024-01-27 16:15:58,055 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 490 flow [2024-01-27 16:15:58,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:58,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:58,057 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] [2024-01-27 16:15:58,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 16:15:58,057 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:58,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:58,058 INFO L85 PathProgramCache]: Analyzing trace with hash -434679946, now seen corresponding path program 2 times [2024-01-27 16:15:58,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:58,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194313168] [2024-01-27 16:15:58,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:58,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:59,021 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:15:59,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:59,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194313168] [2024-01-27 16:15:59,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194313168] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:59,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:59,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-01-27 16:15:59,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974410548] [2024-01-27 16:15:59,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:59,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-01-27 16:15:59,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:59,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-01-27 16:15:59,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-01-27 16:15:59,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-01-27 16:15:59,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 490 flow. Second operand has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 0 states have call successors, (0), 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:15:59,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:59,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-01-27 16:15:59,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:59,517 INFO L124 PetriNetUnfolderBase]: 1002/1957 cut-off events. [2024-01-27 16:15:59,517 INFO L125 PetriNetUnfolderBase]: For 3479/3858 co-relation queries the response was YES. [2024-01-27 16:15:59,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6254 conditions, 1957 events. 1002/1957 cut-off events. For 3479/3858 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 12841 event pairs, 262 based on Foata normal form. 118/1888 useless extension candidates. Maximal degree in co-relation 6222. Up to 550 conditions per place. [2024-01-27 16:15:59,536 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 43 selfloop transitions, 11 changer transitions 23/104 dead transitions. [2024-01-27 16:15:59,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 104 transitions, 762 flow [2024-01-27 16:15:59,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:15:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:15:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-01-27 16:15:59,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5673076923076923 [2024-01-27 16:15:59,538 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 490 flow. Second operand 8 states and 177 transitions. [2024-01-27 16:15:59,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 104 transitions, 762 flow [2024-01-27 16:15:59,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 104 transitions, 735 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-01-27 16:15:59,549 INFO L231 Difference]: Finished difference. Result has 81 places, 67 transitions, 485 flow [2024-01-27 16:15:59,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=485, PETRI_PLACES=81, PETRI_TRANSITIONS=67} [2024-01-27 16:15:59,550 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places. [2024-01-27 16:15:59,550 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 67 transitions, 485 flow [2024-01-27 16:15:59,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 0 states have call successors, (0), 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:15:59,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:59,551 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] [2024-01-27 16:15:59,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 16:15:59,552 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:59,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:59,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2137253198, now seen corresponding path program 3 times [2024-01-27 16:15:59,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:59,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052061594] [2024-01-27 16:15:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:59,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:15:59,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:15:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:15:59,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:15:59,688 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:15:59,689 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-01-27 16:15:59,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-01-27 16:15:59,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-01-27 16:15:59,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-01-27 16:15:59,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-01-27 16:15:59,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-01-27 16:15:59,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 16:15:59,693 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:15:59,698 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:15:59,699 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:15:59,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:15:59 BasicIcfg [2024-01-27 16:15:59,783 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:15:59,784 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:15:59,784 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:15:59,784 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:15:59,785 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:15:47" (3/4) ... [2024-01-27 16:15:59,785 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:15:59,877 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:15:59,877 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:15:59,878 INFO L158 Benchmark]: Toolchain (without parser) took 13324.29ms. Allocated memory was 153.1MB in the beginning and 494.9MB in the end (delta: 341.8MB). Free memory was 119.8MB in the beginning and 171.8MB in the end (delta: -52.0MB). Peak memory consumption was 292.0MB. Max. memory is 16.1GB. [2024-01-27 16:15:59,879 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 153.1MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:15:59,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.25ms. Allocated memory is still 153.1MB. Free memory was 119.3MB in the beginning and 95.8MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-01-27 16:15:59,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.55ms. Allocated memory is still 153.1MB. Free memory was 95.8MB in the beginning and 93.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 16:15:59,880 INFO L158 Benchmark]: Boogie Preprocessor took 94.43ms. Allocated memory is still 153.1MB. Free memory was 93.1MB in the beginning and 89.5MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:15:59,880 INFO L158 Benchmark]: RCFGBuilder took 714.45ms. Allocated memory is still 153.1MB. Free memory was 89.5MB in the beginning and 114.4MB in the end (delta: -24.9MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2024-01-27 16:15:59,880 INFO L158 Benchmark]: TraceAbstraction took 11786.23ms. Allocated memory was 153.1MB in the beginning and 494.9MB in the end (delta: 341.8MB). Free memory was 113.1MB in the beginning and 183.4MB in the end (delta: -70.3MB). Peak memory consumption was 270.3MB. Max. memory is 16.1GB. [2024-01-27 16:15:59,880 INFO L158 Benchmark]: Witness Printer took 93.66ms. Allocated memory is still 494.9MB. Free memory was 183.4MB in the beginning and 171.8MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-01-27 16:15:59,882 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.21ms. Allocated memory is still 153.1MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 551.25ms. Allocated memory is still 153.1MB. Free memory was 119.3MB in the beginning and 95.8MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.55ms. Allocated memory is still 153.1MB. Free memory was 95.8MB in the beginning and 93.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.43ms. Allocated memory is still 153.1MB. Free memory was 93.1MB in the beginning and 89.5MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 714.45ms. Allocated memory is still 153.1MB. Free memory was 89.5MB in the beginning and 114.4MB in the end (delta: -24.9MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11786.23ms. Allocated memory was 153.1MB in the beginning and 494.9MB in the end (delta: 341.8MB). Free memory was 113.1MB in the beginning and 183.4MB in the end (delta: -70.3MB). Peak memory consumption was 270.3MB. Max. memory is 16.1GB. * Witness Printer took 93.66ms. Allocated memory is still 494.9MB. Free memory was 183.4MB in the beginning and 171.8MB in the end (delta: 11.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; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=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=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=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=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - 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: 821]: 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: 823]: 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: 819]: 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, 64 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: 11.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 608 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 575 mSDsluCounter, 250 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 206 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1566 IncrementalHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 44 mSDtfsCounter, 1566 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=490occurred in iteration=10, InterpolantAutomatonStates: 79, 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.9s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 1930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:15:59,926 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