./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix018.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/mix018.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 a7349305eeae716fa3a7c11218caa894d6e5121d77db0055a98af7bd7c666586 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:11:09,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:11:09,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:11:09,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:11:09,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:11:09,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:11:09,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:11:09,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:11:09,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:11:09,341 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:11:09,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:11:09,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:11:09,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:11:09,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:11:09,344 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:11:09,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:11:09,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:11:09,348 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:11:09,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:11:09,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:11:09,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:11:09,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:11:09,350 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:11:09,350 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:11:09,350 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:11:09,350 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:11:09,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:11:09,351 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:11:09,351 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:11:09,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:11:09,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:11:09,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:11:09,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:11:09,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:11:09,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:11:09,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:11:09,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:11:09,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:11:09,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:11:09,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:11:09,354 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:11:09,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:11:09,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:11:09,355 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 -> a7349305eeae716fa3a7c11218caa894d6e5121d77db0055a98af7bd7c666586 [2024-01-27 16:11:09,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:11:09,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:11:09,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:11:09,612 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:11:09,612 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:11:09,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018.opt.i [2024-01-27 16:11:10,783 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:11:11,000 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:11:11,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018.opt.i [2024-01-27 16:11:11,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c111c051/a472376d5d9f45808caa5dfcfae59df2/FLAG492d771cf [2024-01-27 16:11:11,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c111c051/a472376d5d9f45808caa5dfcfae59df2 [2024-01-27 16:11:11,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:11:11,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:11:11,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:11:11,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:11:11,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:11:11,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:11:11" (1/1) ... [2024-01-27 16:11:11,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d07c1c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:11, skipping insertion in model container [2024-01-27 16:11:11,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:11:11" (1/1) ... [2024-01-27 16:11:11,101 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:11:11,264 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/mix018.opt.i[944,957] [2024-01-27 16:11:11,394 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:11:11,408 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:11:11,417 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/mix018.opt.i[944,957] [2024-01-27 16:11:11,455 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:11:11,484 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:11:11,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:11 WrapperNode [2024-01-27 16:11:11,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:11:11,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:11:11,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:11:11,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:11:11,493 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:11:11" (1/1) ... [2024-01-27 16:11:11,507 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:11:11" (1/1) ... [2024-01-27 16:11:11,534 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2024-01-27 16:11:11,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:11:11,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:11:11,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:11:11,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:11:11,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:11" (1/1) ... [2024-01-27 16:11:11,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:11" (1/1) ... [2024-01-27 16:11:11,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:11" (1/1) ... [2024-01-27 16:11:11,568 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-27 16:11:11,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:11" (1/1) ... [2024-01-27 16:11:11,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:11" (1/1) ... [2024-01-27 16:11:11,585 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:11" (1/1) ... [2024-01-27 16:11:11,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:11" (1/1) ... [2024-01-27 16:11:11,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:11" (1/1) ... [2024-01-27 16:11:11,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:11" (1/1) ... [2024-01-27 16:11:11,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:11:11,608 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:11:11,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:11:11,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:11:11,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:11" (1/1) ... [2024-01-27 16:11:11,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:11:11,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:11:11,641 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:11:11,659 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:11:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:11:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:11:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:11:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:11:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 16:11:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:11:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:11:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:11:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:11:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-27 16:11:11,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-27 16:11:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-27 16:11:11,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-27 16:11:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-27 16:11:11,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-27 16:11:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-01-27 16:11:11,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-01-27 16:11:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:11:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:11:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:11:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:11:11,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 16:11:11,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:11:11,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:11:11,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:11:11,684 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:11:11,807 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:11:11,809 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:11:12,100 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:11:12,100 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:11:12,295 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:11:12,295 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 16:11:12,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:11:12 BoogieIcfgContainer [2024-01-27 16:11:12,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:11:12,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:11:12,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:11:12,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:11:12,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:11:11" (1/3) ... [2024-01-27 16:11:12,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762aba6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:11:12, skipping insertion in model container [2024-01-27 16:11:12,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:11" (2/3) ... [2024-01-27 16:11:12,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762aba6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:11:12, skipping insertion in model container [2024-01-27 16:11:12,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:11:12" (3/3) ... [2024-01-27 16:11:12,303 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018.opt.i [2024-01-27 16:11:12,310 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:11:12,317 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:11:12,318 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-01-27 16:11:12,318 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:11:12,357 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 16:11:12,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2024-01-27 16:11:12,411 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-01-27 16:11:12,412 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:11:12,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-01-27 16:11:12,415 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2024-01-27 16:11:12,419 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2024-01-27 16:11:12,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:11:12,441 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;@2fc33d88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:11:12,441 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-01-27 16:11:12,449 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:11:12,449 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-01-27 16:11:12,449 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:11:12,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:12,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:11:12,451 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:11:12,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:12,455 INFO L85 PathProgramCache]: Analyzing trace with hash 396149237, now seen corresponding path program 1 times [2024-01-27 16:11:12,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:12,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189854420] [2024-01-27 16:11:12,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:12,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:12,841 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:11:12,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:12,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189854420] [2024-01-27 16:11:12,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189854420] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:12,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:12,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 16:11:12,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184244742] [2024-01-27 16:11:12,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:12,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:11:12,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:12,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:11:12,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:11:12,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 49 [2024-01-27 16:11:12,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:11:12,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:12,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 49 [2024-01-27 16:11:12,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:13,204 INFO L124 PetriNetUnfolderBase]: 879/1523 cut-off events. [2024-01-27 16:11:13,205 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:11:13,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2843 conditions, 1523 events. 879/1523 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 10500 event pairs, 159 based on Foata normal form. 60/1530 useless extension candidates. Maximal degree in co-relation 2831. Up to 1009 conditions per place. [2024-01-27 16:11:13,219 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 26 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2024-01-27 16:11:13,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 176 flow [2024-01-27 16:11:13,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:11:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:11:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-01-27 16:11:13,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7551020408163265 [2024-01-27 16:11:13,235 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 111 transitions. [2024-01-27 16:11:13,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 176 flow [2024-01-27 16:11:13,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 172 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 16:11:13,243 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow [2024-01-27 16:11:13,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-01-27 16:11:13,247 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-01-27 16:11:13,248 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow [2024-01-27 16:11:13,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:11:13,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:13,248 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:11:13,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:11:13,249 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:11:13,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:13,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1192277587, now seen corresponding path program 1 times [2024-01-27 16:11:13,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:13,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938226295] [2024-01-27 16:11:13,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:13,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:13,532 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:11:13,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:13,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938226295] [2024-01-27 16:11:13,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938226295] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:13,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:13,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:11:13,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893086866] [2024-01-27 16:11:13,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:13,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:11:13,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:13,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:11:13,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:11:13,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-01-27 16:11:13,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:11:13,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:13,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-01-27 16:11:13,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:15,104 INFO L124 PetriNetUnfolderBase]: 10623/16184 cut-off events. [2024-01-27 16:11:15,105 INFO L125 PetriNetUnfolderBase]: For 626/626 co-relation queries the response was YES. [2024-01-27 16:11:15,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31648 conditions, 16184 events. 10623/16184 cut-off events. For 626/626 co-relation queries the response was YES. Maximal size of possible extension queue 981. Compared 119601 event pairs, 2858 based on Foata normal form. 0/15642 useless extension candidates. Maximal degree in co-relation 31638. Up to 6461 conditions per place. [2024-01-27 16:11:15,186 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 40 selfloop transitions, 7 changer transitions 78/140 dead transitions. [2024-01-27 16:11:15,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 140 transitions, 560 flow [2024-01-27 16:11:15,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:11:15,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:11:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 298 transitions. [2024-01-27 16:11:15,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6757369614512472 [2024-01-27 16:11:15,190 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 9 states and 298 transitions. [2024-01-27 16:11:15,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 140 transitions, 560 flow [2024-01-27 16:11:15,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 140 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:11:15,199 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 188 flow [2024-01-27 16:11:15,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=188, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2024-01-27 16:11:15,201 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2024-01-27 16:11:15,203 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 188 flow [2024-01-27 16:11:15,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:11:15,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:15,203 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:11:15,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:11:15,204 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:11:15,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:15,204 INFO L85 PathProgramCache]: Analyzing trace with hash -12826546, now seen corresponding path program 1 times [2024-01-27 16:11:15,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:15,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129939111] [2024-01-27 16:11:15,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:15,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:15,386 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:11:15,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:15,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129939111] [2024-01-27 16:11:15,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129939111] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:15,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:15,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:11:15,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971725974] [2024-01-27 16:11:15,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:15,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:11:15,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:15,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:11:15,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:11:15,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 49 [2024-01-27 16:11:15,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:11:15,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:15,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 49 [2024-01-27 16:11:15,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:16,265 INFO L124 PetriNetUnfolderBase]: 5130/8819 cut-off events. [2024-01-27 16:11:16,265 INFO L125 PetriNetUnfolderBase]: For 11024/11584 co-relation queries the response was YES. [2024-01-27 16:11:16,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25026 conditions, 8819 events. 5130/8819 cut-off events. For 11024/11584 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 72565 event pairs, 1706 based on Foata normal form. 264/8466 useless extension candidates. Maximal degree in co-relation 25008. Up to 3766 conditions per place. [2024-01-27 16:11:16,321 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 29 selfloop transitions, 3 changer transitions 33/88 dead transitions. [2024-01-27 16:11:16,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 88 transitions, 494 flow [2024-01-27 16:11:16,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:11:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:11:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 219 transitions. [2024-01-27 16:11:16,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6384839650145773 [2024-01-27 16:11:16,324 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 188 flow. Second operand 7 states and 219 transitions. [2024-01-27 16:11:16,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 88 transitions, 494 flow [2024-01-27 16:11:16,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 432 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-01-27 16:11:16,353 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 177 flow [2024-01-27 16:11:16,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=177, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2024-01-27 16:11:16,354 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2024-01-27 16:11:16,354 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 177 flow [2024-01-27 16:11:16,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:11:16,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:16,355 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:11:16,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:11:16,355 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:11:16,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:16,356 INFO L85 PathProgramCache]: Analyzing trace with hash -890580954, now seen corresponding path program 1 times [2024-01-27 16:11:16,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:16,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471953375] [2024-01-27 16:11:16,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:16,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:16,532 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:11:16,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:16,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471953375] [2024-01-27 16:11:16,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471953375] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:16,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:16,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:11:16,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907072915] [2024-01-27 16:11:16,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:16,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:11:16,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:16,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:11:16,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:11:16,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-01-27 16:11:16,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 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:11:16,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:16,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-01-27 16:11:16,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:17,728 INFO L124 PetriNetUnfolderBase]: 6652/10753 cut-off events. [2024-01-27 16:11:17,728 INFO L125 PetriNetUnfolderBase]: For 11085/11088 co-relation queries the response was YES. [2024-01-27 16:11:17,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29786 conditions, 10753 events. 6652/10753 cut-off events. For 11085/11088 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 78740 event pairs, 1805 based on Foata normal form. 240/10918 useless extension candidates. Maximal degree in co-relation 29765. Up to 5170 conditions per place. [2024-01-27 16:11:17,866 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 57 selfloop transitions, 11 changer transitions 56/139 dead transitions. [2024-01-27 16:11:17,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 139 transitions, 799 flow [2024-01-27 16:11:17,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 16:11:17,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 16:11:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 313 transitions. [2024-01-27 16:11:17,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6387755102040816 [2024-01-27 16:11:17,869 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 177 flow. Second operand 10 states and 313 transitions. [2024-01-27 16:11:17,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 139 transitions, 799 flow [2024-01-27 16:11:17,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 139 transitions, 757 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-01-27 16:11:17,949 INFO L231 Difference]: Finished difference. Result has 72 places, 52 transitions, 247 flow [2024-01-27 16:11:17,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=247, PETRI_PLACES=72, PETRI_TRANSITIONS=52} [2024-01-27 16:11:17,950 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2024-01-27 16:11:17,951 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 52 transitions, 247 flow [2024-01-27 16:11:17,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 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:11:17,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:17,951 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:11:17,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:11:17,952 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:11:17,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:17,952 INFO L85 PathProgramCache]: Analyzing trace with hash -837012539, now seen corresponding path program 1 times [2024-01-27 16:11:17,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:17,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136728268] [2024-01-27 16:11:17,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:17,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:18,093 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:11:18,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:18,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136728268] [2024-01-27 16:11:18,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136728268] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:18,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:18,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:11:18,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947195231] [2024-01-27 16:11:18,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:18,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:11:18,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:18,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:11:18,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:11:18,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2024-01-27 16:11:18,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 52 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:11:18,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:18,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2024-01-27 16:11:18,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:19,941 INFO L124 PetriNetUnfolderBase]: 14168/21346 cut-off events. [2024-01-27 16:11:19,941 INFO L125 PetriNetUnfolderBase]: For 24863/26367 co-relation queries the response was YES. [2024-01-27 16:11:19,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57337 conditions, 21346 events. 14168/21346 cut-off events. For 24863/26367 co-relation queries the response was YES. Maximal size of possible extension queue 1231. Compared 157483 event pairs, 2563 based on Foata normal form. 1017/21534 useless extension candidates. Maximal degree in co-relation 57314. Up to 10649 conditions per place. [2024-01-27 16:11:20,066 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 55 selfloop transitions, 6 changer transitions 0/84 dead transitions. [2024-01-27 16:11:20,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 84 transitions, 487 flow [2024-01-27 16:11:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:11:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:11:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-01-27 16:11:20,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7091836734693877 [2024-01-27 16:11:20,068 INFO L175 Difference]: Start difference. First operand has 72 places, 52 transitions, 247 flow. Second operand 4 states and 139 transitions. [2024-01-27 16:11:20,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 84 transitions, 487 flow [2024-01-27 16:11:20,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 471 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-01-27 16:11:20,225 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 277 flow [2024-01-27 16:11:20,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2024-01-27 16:11:20,226 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2024-01-27 16:11:20,226 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 277 flow [2024-01-27 16:11:20,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:11:20,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:20,227 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] [2024-01-27 16:11:20,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:11:20,227 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:11:20,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:20,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1030588902, now seen corresponding path program 1 times [2024-01-27 16:11:20,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:20,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226841667] [2024-01-27 16:11:20,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:20,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:20,421 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:11:20,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:20,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226841667] [2024-01-27 16:11:20,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226841667] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:20,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:20,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:11:20,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346733295] [2024-01-27 16:11:20,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:20,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:11:20,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:20,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:11:20,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:11:20,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2024-01-27 16:11:20,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 277 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:11:20,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:20,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2024-01-27 16:11:20,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:22,435 INFO L124 PetriNetUnfolderBase]: 14412/23611 cut-off events. [2024-01-27 16:11:22,435 INFO L125 PetriNetUnfolderBase]: For 23303/24403 co-relation queries the response was YES. [2024-01-27 16:11:22,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64959 conditions, 23611 events. 14412/23611 cut-off events. For 23303/24403 co-relation queries the response was YES. Maximal size of possible extension queue 1369. Compared 199577 event pairs, 6651 based on Foata normal form. 427/21636 useless extension candidates. Maximal degree in co-relation 64936. Up to 9150 conditions per place. [2024-01-27 16:11:22,597 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 70 selfloop transitions, 10 changer transitions 1/105 dead transitions. [2024-01-27 16:11:22,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 105 transitions, 612 flow [2024-01-27 16:11:22,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:11:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:11:22,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 222 transitions. [2024-01-27 16:11:22,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6472303206997084 [2024-01-27 16:11:22,599 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 277 flow. Second operand 7 states and 222 transitions. [2024-01-27 16:11:22,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 105 transitions, 612 flow [2024-01-27 16:11:22,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 105 transitions, 606 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-01-27 16:11:22,620 INFO L231 Difference]: Finished difference. Result has 75 places, 62 transitions, 352 flow [2024-01-27 16:11:22,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=352, PETRI_PLACES=75, PETRI_TRANSITIONS=62} [2024-01-27 16:11:22,623 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 18 predicate places. [2024-01-27 16:11:22,623 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 62 transitions, 352 flow [2024-01-27 16:11:22,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:11:22,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:22,624 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] [2024-01-27 16:11:22,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:11:22,624 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:11:22,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:22,624 INFO L85 PathProgramCache]: Analyzing trace with hash 882745916, now seen corresponding path program 1 times [2024-01-27 16:11:22,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:22,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22191804] [2024-01-27 16:11:22,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:22,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:22,760 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:11:22,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:22,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22191804] [2024-01-27 16:11:22,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22191804] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:22,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:22,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:11:22,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606467486] [2024-01-27 16:11:22,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:22,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:11:22,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:22,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:11:22,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:11:22,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2024-01-27 16:11:22,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 62 transitions, 352 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 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:11:22,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:22,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2024-01-27 16:11:22,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:25,221 INFO L124 PetriNetUnfolderBase]: 18418/27756 cut-off events. [2024-01-27 16:11:25,222 INFO L125 PetriNetUnfolderBase]: For 34270/36980 co-relation queries the response was YES. [2024-01-27 16:11:25,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82014 conditions, 27756 events. 18418/27756 cut-off events. For 34270/36980 co-relation queries the response was YES. Maximal size of possible extension queue 1492. Compared 207929 event pairs, 2055 based on Foata normal form. 1440/28350 useless extension candidates. Maximal degree in co-relation 81988. Up to 11084 conditions per place. [2024-01-27 16:11:25,379 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 71 selfloop transitions, 10 changer transitions 3/109 dead transitions. [2024-01-27 16:11:25,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 109 transitions, 712 flow [2024-01-27 16:11:25,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:11:25,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:11:25,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2024-01-27 16:11:25,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.726530612244898 [2024-01-27 16:11:25,381 INFO L175 Difference]: Start difference. First operand has 75 places, 62 transitions, 352 flow. Second operand 5 states and 178 transitions. [2024-01-27 16:11:25,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 109 transitions, 712 flow [2024-01-27 16:11:25,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 109 transitions, 699 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-01-27 16:11:25,504 INFO L231 Difference]: Finished difference. Result has 80 places, 64 transitions, 378 flow [2024-01-27 16:11:25,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=378, PETRI_PLACES=80, PETRI_TRANSITIONS=64} [2024-01-27 16:11:25,504 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2024-01-27 16:11:25,505 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 64 transitions, 378 flow [2024-01-27 16:11:25,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 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:11:25,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:25,505 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] [2024-01-27 16:11:25,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:11:25,505 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:11:25,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:25,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1614165479, now seen corresponding path program 1 times [2024-01-27 16:11:25,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:25,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778321390] [2024-01-27 16:11:25,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:25,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:25,817 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:11:25,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:25,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778321390] [2024-01-27 16:11:25,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778321390] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:25,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:25,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:11:25,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010729655] [2024-01-27 16:11:25,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:25,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:11:25,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:25,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:11:25,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:11:25,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2024-01-27 16:11:25,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 64 transitions, 378 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:11:25,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:25,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2024-01-27 16:11:25,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:27,763 INFO L124 PetriNetUnfolderBase]: 14039/21212 cut-off events. [2024-01-27 16:11:27,763 INFO L125 PetriNetUnfolderBase]: For 38378/41727 co-relation queries the response was YES. [2024-01-27 16:11:27,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70130 conditions, 21212 events. 14039/21212 cut-off events. For 38378/41727 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 154112 event pairs, 986 based on Foata normal form. 1185/21785 useless extension candidates. Maximal degree in co-relation 70101. Up to 7296 conditions per place. [2024-01-27 16:11:27,908 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 83 selfloop transitions, 14 changer transitions 2/124 dead transitions. [2024-01-27 16:11:27,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 124 transitions, 841 flow [2024-01-27 16:11:27,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:11:27,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:11:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2024-01-27 16:11:27,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7312925170068028 [2024-01-27 16:11:27,910 INFO L175 Difference]: Start difference. First operand has 80 places, 64 transitions, 378 flow. Second operand 6 states and 215 transitions. [2024-01-27 16:11:27,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 124 transitions, 841 flow [2024-01-27 16:11:27,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 124 transitions, 814 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-01-27 16:11:27,948 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 437 flow [2024-01-27 16:11:27,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=437, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2024-01-27 16:11:27,948 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2024-01-27 16:11:27,948 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 437 flow [2024-01-27 16:11:27,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:11:27,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:27,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:11:27,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 16:11:27,949 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:11:27,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:27,950 INFO L85 PathProgramCache]: Analyzing trace with hash 405300433, now seen corresponding path program 1 times [2024-01-27 16:11:27,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:27,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399954453] [2024-01-27 16:11:27,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:27,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:28,125 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:11:28,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:28,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399954453] [2024-01-27 16:11:28,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399954453] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:28,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:28,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:11:28,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818235896] [2024-01-27 16:11:28,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:28,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:11:28,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:28,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:11:28,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:11:28,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2024-01-27 16:11:28,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 437 flow. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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:11:28,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:28,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2024-01-27 16:11:28,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:29,875 INFO L124 PetriNetUnfolderBase]: 12491/22161 cut-off events. [2024-01-27 16:11:29,875 INFO L125 PetriNetUnfolderBase]: For 43077/48356 co-relation queries the response was YES. [2024-01-27 16:11:30,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69565 conditions, 22161 events. 12491/22161 cut-off events. For 43077/48356 co-relation queries the response was YES. Maximal size of possible extension queue 1408. Compared 202199 event pairs, 4368 based on Foata normal form. 584/20384 useless extension candidates. Maximal degree in co-relation 69537. Up to 8959 conditions per place. [2024-01-27 16:11:30,069 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 60 selfloop transitions, 3 changer transitions 17/118 dead transitions. [2024-01-27 16:11:30,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 118 transitions, 816 flow [2024-01-27 16:11:30,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:11:30,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:11:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2024-01-27 16:11:30,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-01-27 16:11:30,071 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 437 flow. Second operand 6 states and 196 transitions. [2024-01-27 16:11:30,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 118 transitions, 816 flow [2024-01-27 16:11:30,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 118 transitions, 785 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-01-27 16:11:30,252 INFO L231 Difference]: Finished difference. Result has 86 places, 68 transitions, 411 flow [2024-01-27 16:11:30,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=411, PETRI_PLACES=86, PETRI_TRANSITIONS=68} [2024-01-27 16:11:30,253 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places. [2024-01-27 16:11:30,253 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 68 transitions, 411 flow [2024-01-27 16:11:30,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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:11:30,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:30,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:11:30,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 16:11:30,254 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:11:30,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:30,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2057075955, now seen corresponding path program 2 times [2024-01-27 16:11:30,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:30,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877062519] [2024-01-27 16:11:30,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:30,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:30,412 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:11:30,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:30,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877062519] [2024-01-27 16:11:30,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877062519] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:30,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:30,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:11:30,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431369349] [2024-01-27 16:11:30,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:30,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:11:30,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:30,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:11:30,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:11:30,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2024-01-27 16:11:30,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 68 transitions, 411 flow. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 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:11:30,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:30,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2024-01-27 16:11:30,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:32,881 INFO L124 PetriNetUnfolderBase]: 19254/28824 cut-off events. [2024-01-27 16:11:32,881 INFO L125 PetriNetUnfolderBase]: For 58075/63088 co-relation queries the response was YES. [2024-01-27 16:11:33,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95745 conditions, 28824 events. 19254/28824 cut-off events. For 58075/63088 co-relation queries the response was YES. Maximal size of possible extension queue 1948. Compared 219867 event pairs, 1262 based on Foata normal form. 1229/29194 useless extension candidates. Maximal degree in co-relation 95714. Up to 10552 conditions per place. [2024-01-27 16:11:33,091 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 58 selfloop transitions, 18 changer transitions 19/119 dead transitions. [2024-01-27 16:11:33,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 119 transitions, 793 flow [2024-01-27 16:11:33,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:11:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:11:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 234 transitions. [2024-01-27 16:11:33,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6822157434402333 [2024-01-27 16:11:33,092 INFO L175 Difference]: Start difference. First operand has 86 places, 68 transitions, 411 flow. Second operand 7 states and 234 transitions. [2024-01-27 16:11:33,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 119 transitions, 793 flow [2024-01-27 16:11:33,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 119 transitions, 768 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-01-27 16:11:33,499 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 448 flow [2024-01-27 16:11:33,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=448, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2024-01-27 16:11:33,500 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 27 predicate places. [2024-01-27 16:11:33,500 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 448 flow [2024-01-27 16:11:33,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 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:11:33,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:33,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:11:33,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 16:11:33,501 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:11:33,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:33,501 INFO L85 PathProgramCache]: Analyzing trace with hash -623396299, now seen corresponding path program 1 times [2024-01-27 16:11:33,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:33,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581727775] [2024-01-27 16:11:33,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:33,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:33,694 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:11:33,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:33,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581727775] [2024-01-27 16:11:33,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581727775] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:33,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:33,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:11:33,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667222743] [2024-01-27 16:11:33,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:33,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:11:33,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:33,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:11:33,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:11:33,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-01-27 16:11:33,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 448 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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:11:33,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:33,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-01-27 16:11:33,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:36,546 INFO L124 PetriNetUnfolderBase]: 18169/31861 cut-off events. [2024-01-27 16:11:36,547 INFO L125 PetriNetUnfolderBase]: For 76414/80975 co-relation queries the response was YES. [2024-01-27 16:11:36,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101635 conditions, 31861 events. 18169/31861 cut-off events. For 76414/80975 co-relation queries the response was YES. Maximal size of possible extension queue 2350. Compared 306840 event pairs, 2774 based on Foata normal form. 319/29057 useless extension candidates. Maximal degree in co-relation 101606. Up to 10177 conditions per place. [2024-01-27 16:11:36,815 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 40 selfloop transitions, 12 changer transitions 45/127 dead transitions. [2024-01-27 16:11:36,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 127 transitions, 923 flow [2024-01-27 16:11:36,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:11:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:11:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2024-01-27 16:11:36,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6122448979591837 [2024-01-27 16:11:36,817 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 448 flow. Second operand 7 states and 210 transitions. [2024-01-27 16:11:36,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 127 transitions, 923 flow [2024-01-27 16:11:38,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 127 transitions, 808 flow, removed 46 selfloop flow, removed 6 redundant places. [2024-01-27 16:11:38,036 INFO L231 Difference]: Finished difference. Result has 88 places, 64 transitions, 385 flow [2024-01-27 16:11:38,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=385, PETRI_PLACES=88, PETRI_TRANSITIONS=64} [2024-01-27 16:11:38,037 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2024-01-27 16:11:38,037 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 64 transitions, 385 flow [2024-01-27 16:11:38,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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:11:38,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:38,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:11:38,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 16:11:38,038 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:11:38,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:38,038 INFO L85 PathProgramCache]: Analyzing trace with hash 94687105, now seen corresponding path program 2 times [2024-01-27 16:11:38,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:38,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492311022] [2024-01-27 16:11:38,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:38,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:39,018 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:11:39,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:39,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492311022] [2024-01-27 16:11:39,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492311022] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:39,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:39,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:11:39,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125309991] [2024-01-27 16:11:39,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:39,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:11:39,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:39,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:11:39,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:11:39,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 49 [2024-01-27 16:11:39,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 64 transitions, 385 flow. Second operand has 9 states, 9 states have (on average 25.0) internal successors, (225), 9 states have internal predecessors, (225), 0 states have call successors, (0), 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:11:39,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:39,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 49 [2024-01-27 16:11:39,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:39,601 INFO L124 PetriNetUnfolderBase]: 3263/6178 cut-off events. [2024-01-27 16:11:39,602 INFO L125 PetriNetUnfolderBase]: For 8415/9126 co-relation queries the response was YES. [2024-01-27 16:11:39,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17156 conditions, 6178 events. 3263/6178 cut-off events. For 8415/9126 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 50660 event pairs, 970 based on Foata normal form. 57/5249 useless extension candidates. Maximal degree in co-relation 17125. Up to 2293 conditions per place. [2024-01-27 16:11:39,634 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 32 selfloop transitions, 10 changer transitions 17/98 dead transitions. [2024-01-27 16:11:39,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 98 transitions, 616 flow [2024-01-27 16:11:39,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 16:11:39,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 16:11:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 285 transitions. [2024-01-27 16:11:39,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5816326530612245 [2024-01-27 16:11:39,635 INFO L175 Difference]: Start difference. First operand has 88 places, 64 transitions, 385 flow. Second operand 10 states and 285 transitions. [2024-01-27 16:11:39,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 98 transitions, 616 flow [2024-01-27 16:11:39,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 98 transitions, 563 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-01-27 16:11:39,688 INFO L231 Difference]: Finished difference. Result has 90 places, 67 transitions, 397 flow [2024-01-27 16:11:39,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=397, PETRI_PLACES=90, PETRI_TRANSITIONS=67} [2024-01-27 16:11:39,689 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2024-01-27 16:11:39,689 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 67 transitions, 397 flow [2024-01-27 16:11:39,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.0) internal successors, (225), 9 states have internal predecessors, (225), 0 states have call successors, (0), 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:11:39,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:39,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:11:39,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 16:11:39,690 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:11:39,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:39,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1964383387, now seen corresponding path program 3 times [2024-01-27 16:11:39,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:39,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137344036] [2024-01-27 16:11:39,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:39,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:39,877 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:11:39,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:39,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137344036] [2024-01-27 16:11:39,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137344036] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:39,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:39,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-27 16:11:39,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884696223] [2024-01-27 16:11:39,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:39,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:11:39,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:39,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:11:39,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:11:39,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-01-27 16:11:39,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 67 transitions, 397 flow. Second operand has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:11:39,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:39,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-01-27 16:11:39,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:40,627 INFO L124 PetriNetUnfolderBase]: 5006/9439 cut-off events. [2024-01-27 16:11:40,627 INFO L125 PetriNetUnfolderBase]: For 14422/15351 co-relation queries the response was YES. [2024-01-27 16:11:40,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27065 conditions, 9439 events. 5006/9439 cut-off events. For 14422/15351 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 83746 event pairs, 1050 based on Foata normal form. 85/8401 useless extension candidates. Maximal degree in co-relation 27035. Up to 2936 conditions per place. [2024-01-27 16:11:40,669 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 29 selfloop transitions, 5 changer transitions 41/105 dead transitions. [2024-01-27 16:11:40,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 105 transitions, 673 flow [2024-01-27 16:11:40,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:11:40,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:11:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2024-01-27 16:11:40,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.548469387755102 [2024-01-27 16:11:40,671 INFO L175 Difference]: Start difference. First operand has 90 places, 67 transitions, 397 flow. Second operand 8 states and 215 transitions. [2024-01-27 16:11:40,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 105 transitions, 673 flow [2024-01-27 16:11:40,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 105 transitions, 653 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-01-27 16:11:40,774 INFO L231 Difference]: Finished difference. Result has 91 places, 58 transitions, 320 flow [2024-01-27 16:11:40,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=320, PETRI_PLACES=91, PETRI_TRANSITIONS=58} [2024-01-27 16:11:40,775 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 34 predicate places. [2024-01-27 16:11:40,775 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 58 transitions, 320 flow [2024-01-27 16:11:40,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:11:40,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:40,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:11:40,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 16:11:40,775 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:11:40,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:40,776 INFO L85 PathProgramCache]: Analyzing trace with hash -630638817, now seen corresponding path program 4 times [2024-01-27 16:11:40,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:40,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990792707] [2024-01-27 16:11:40,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:40,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:11:40,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:11:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:11:40,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:11:40,851 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:11:40,852 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-01-27 16:11:40,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-01-27 16:11:40,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-01-27 16:11:40,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-01-27 16:11:40,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-01-27 16:11:40,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-01-27 16:11:40,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-01-27 16:11:40,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-27 16:11:40,855 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:11:40,859 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:11:40,859 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:11:40,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:11:40 BasicIcfg [2024-01-27 16:11:40,944 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:11:40,945 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:11:40,945 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:11:40,945 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:11:40,946 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:11:12" (3/4) ... [2024-01-27 16:11:40,946 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:11:41,031 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:11:41,032 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:11:41,032 INFO L158 Benchmark]: Toolchain (without parser) took 29994.35ms. Allocated memory was 155.2MB in the beginning and 8.4GB in the end (delta: 8.3GB). Free memory was 84.1MB in the beginning and 6.6GB in the end (delta: -6.5GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-01-27 16:11:41,033 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 80.0MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:11:41,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.15ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 108.0MB in the end (delta: -24.1MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-01-27 16:11:41,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.00ms. Allocated memory is still 155.2MB. Free memory was 108.0MB in the beginning and 105.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:11:41,033 INFO L158 Benchmark]: Boogie Preprocessor took 71.88ms. Allocated memory is still 155.2MB. Free memory was 105.3MB in the beginning and 101.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 16:11:41,033 INFO L158 Benchmark]: RCFGBuilder took 688.39ms. Allocated memory is still 155.2MB. Free memory was 101.8MB in the beginning and 117.9MB in the end (delta: -16.1MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2024-01-27 16:11:41,035 INFO L158 Benchmark]: TraceAbstraction took 28646.31ms. Allocated memory was 155.2MB in the beginning and 8.4GB in the end (delta: 8.3GB). Free memory was 117.0MB in the beginning and 6.6GB in the end (delta: -6.5GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-01-27 16:11:41,035 INFO L158 Benchmark]: Witness Printer took 87.08ms. Allocated memory is still 8.4GB. Free memory was 6.6GB in the beginning and 6.6GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-01-27 16:11:41,037 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.17ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 80.0MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.15ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 108.0MB in the end (delta: -24.1MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.00ms. Allocated memory is still 155.2MB. Free memory was 108.0MB in the beginning and 105.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.88ms. Allocated memory is still 155.2MB. Free memory was 105.3MB in the beginning and 101.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 688.39ms. Allocated memory is still 155.2MB. Free memory was 101.8MB in the beginning and 117.9MB in the end (delta: -16.1MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. * TraceAbstraction took 28646.31ms. Allocated memory was 155.2MB in the beginning and 8.4GB in the end (delta: 8.3GB). Free memory was 117.0MB in the beginning and 6.6GB in the end (delta: -6.5GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 87.08ms. Allocated memory is still 8.4GB. Free memory was 6.6GB in the beginning and 6.6GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t469; [L865] FCALL, FORK 0 pthread_create(&t469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t469={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L866] 0 pthread_t t470; [L867] FCALL, FORK 0 pthread_create(&t470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, t470={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L868] 0 pthread_t t471; [L869] FCALL, FORK 0 pthread_create(&t471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L870] 0 pthread_t t472; [L871] FCALL, FORK 0 pthread_create(&t472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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$$choice2=1, x=2, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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$$choice2=1, x=2, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice2=1, x=2, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 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) [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] 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 [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] 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=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice2=1, x=2, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice2=1, x=2, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 867]: 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: 871]: 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: 869]: 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 9 procedures, 83 locations, 7 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: 28.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 24.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 822 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 779 mSDsluCounter, 272 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 211 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1993 IncrementalHoareTripleChecker+Invalid, 2042 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 61 mSDtfsCounter, 1993 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=448occurred in iteration=10, InterpolantAutomatonStates: 89, 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, 3.0s InterpolantComputationTime, 371 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 321 ConstructedInterpolants, 0 QuantifiedInterpolants, 2202 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:11:41,073 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