./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 6497de01
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/bin/uautomizer-verify-LYvppIcaGC --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 a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-6497de0
[2024-11-24 00:35:26,731 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-24 00:35:26,844 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-24 00:35:26,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-24 00:35:26,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-24 00:35:26,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-24 00:35:26,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-24 00:35:26,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-24 00:35:26,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-24 00:35:26,912 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-24 00:35:26,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-24 00:35:26,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-24 00:35:26,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-24 00:35:26,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-24 00:35:26,914 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-24 00:35:26,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-24 00:35:26,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-24 00:35:26,916 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-24 00:35:26,916 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-24 00:35:26,917 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-24 00:35:26,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-24 00:35:26,917 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-24 00:35:26,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-24 00:35:26,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-24 00:35:26,917 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-24 00:35:26,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-24 00:35:26,918 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-24 00:35:26,918 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-24 00:35:26,918 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-24 00:35:26,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 00:35:26,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 00:35:26,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 00:35:26,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:35:26,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-24 00:35:26,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 00:35:26,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 00:35:26,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 00:35:26,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:35:26,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-24 00:35:26,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-24 00:35:26,921 INFO L153 SettingsManager]: * Compute procedure contracts=false
[2024-11-24 00:35:26,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-24 00:35:26,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-24 00:35:26,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-24 00:35:26,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-24 00:35:26,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-24 00:35:26,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-24 00:35:26,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-24 00:35:26,922 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/bin/uautomizer-verify-LYvppIcaGC
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 -> a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29
[2024-11-24 00:35:27,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-24 00:35:27,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-24 00:35:27,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-24 00:35:27,340 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-24 00:35:27,341 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-24 00:35:27,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i
[2024-11-24 00:35:30,836 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/bin/uautomizer-verify-LYvppIcaGC/data/39167a8c2/0b66fed458e64020b50f7e4c7d209dab/FLAG83e469c7c
[2024-11-24 00:35:31,317 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-24 00:35:31,319 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i
[2024-11-24 00:35:31,348 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/bin/uautomizer-verify-LYvppIcaGC/data/39167a8c2/0b66fed458e64020b50f7e4c7d209dab/FLAG83e469c7c
[2024-11-24 00:35:31,374 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/bin/uautomizer-verify-LYvppIcaGC/data/39167a8c2/0b66fed458e64020b50f7e4c7d209dab
[2024-11-24 00:35:31,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-24 00:35:31,380 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-24 00:35:31,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-24 00:35:31,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-24 00:35:31,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-24 00:35:31,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:35:31" (1/1) ...
[2024-11-24 00:35:31,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a18aecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:31, skipping insertion in model container
[2024-11-24 00:35:31,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:35:31" (1/1) ...
[2024-11-24 00:35:31,448 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-24 00:35:31,694 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i[956,969]
[2024-11-24 00:35:32,078 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 00:35:32,096 INFO L200 MainTranslator]: Completed pre-run
[2024-11-24 00:35:32,114 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i[956,969]
[2024-11-24 00:35:32,184 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 00:35:32,228 INFO L204 MainTranslator]: Completed translation
[2024-11-24 00:35:32,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:32 WrapperNode
[2024-11-24 00:35:32,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-24 00:35:32,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-24 00:35:32,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-24 00:35:32,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-24 00:35:32,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:32" (1/1) ...
[2024-11-24 00:35:32,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:32" (1/1) ...
[2024-11-24 00:35:32,299 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128
[2024-11-24 00:35:32,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-24 00:35:32,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-24 00:35:32,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-24 00:35:32,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-24 00:35:32,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:32" (1/1) ...
[2024-11-24 00:35:32,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:32" (1/1) ...
[2024-11-24 00:35:32,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:32" (1/1) ...
[2024-11-24 00:35:32,365 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-24 00:35:32,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:32" (1/1) ...
[2024-11-24 00:35:32,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:32" (1/1) ...
[2024-11-24 00:35:32,381 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:32" (1/1) ...
[2024-11-24 00:35:32,385 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:32" (1/1) ...
[2024-11-24 00:35:32,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:32" (1/1) ...
[2024-11-24 00:35:32,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:32" (1/1) ...
[2024-11-24 00:35:32,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:32" (1/1) ...
[2024-11-24 00:35:32,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-24 00:35:32,394 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-24 00:35:32,394 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-24 00:35:32,394 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-24 00:35:32,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:32" (1/1) ...
[2024-11-24 00:35:32,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:35:32,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:35:32,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-24 00:35:32,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-24 00:35:32,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-24 00:35:32,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-24 00:35:32,469 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-24 00:35:32,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-24 00:35:32,469 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-24 00:35:32,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-24 00:35:32,469 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-11-24 00:35:32,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-11-24 00:35:32,469 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2024-11-24 00:35:32,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2024-11-24 00:35:32,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-24 00:35:32,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-24 00:35:32,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-24 00:35:32,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-24 00:35:32,471 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-24 00:35:32,701 INFO L234 CfgBuilder]: Building ICFG
[2024-11-24 00:35:32,703 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-24 00:35:33,121 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-24 00:35:33,122 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-24 00:35:33,529 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-24 00:35:33,529 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-24 00:35:33,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:35:33 BoogieIcfgContainer
[2024-11-24 00:35:33,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-24 00:35:33,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-24 00:35:33,534 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-24 00:35:33,539 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-24 00:35:33,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:35:31" (1/3) ...
[2024-11-24 00:35:33,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a3055b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:35:33, skipping insertion in model container
[2024-11-24 00:35:33,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:32" (2/3) ...
[2024-11-24 00:35:33,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a3055b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:35:33, skipping insertion in model container
[2024-11-24 00:35:33,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:35:33" (3/3) ...
[2024-11-24 00:35:33,544 INFO L128 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt_rmo.opt.i
[2024-11-24 00:35:33,562 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-24 00:35:33,564 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix026_pso.opt_rmo.opt.i that has 5 procedures, 49 locations, 1 initial locations, 0 loop locations, and 2 error locations.
[2024-11-24 00:35:33,565 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-24 00:35:33,681 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-24 00:35:33,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow
[2024-11-24 00:35:33,805 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events.
[2024-11-24 00:35:33,810 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 00:35:33,817 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 6. Compared 96 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-11-24 00:35:33,817 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow
[2024-11-24 00:35:33,821 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow
[2024-11-24 00:35:33,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-24 00:35:33,862 INFO L333 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, 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;@20964b29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-24 00:35:33,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-11-24 00:35:33,879 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-24 00:35:33,879 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events.
[2024-11-24 00:35:33,879 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 00:35:33,884 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:35:33,884 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:35:33,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:35:33,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:35:33,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1360947892, now seen corresponding path program 1 times
[2024-11-24 00:35:33,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:35:33,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731330640]
[2024-11-24 00:35:33,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:35:33,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:35:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:35:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:35:34,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:35:34,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731330640]
[2024-11-24 00:35:34,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731330640] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:35:34,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:35:34,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 00:35:34,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3100967]
[2024-11-24 00:35:34,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:35:34,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 00:35:34,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:35:34,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 00:35:34,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 00:35:34,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 49
[2024-11-24 00:35:34,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:35:34,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:35:34,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 49
[2024-11-24 00:35:34,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:35:35,937 INFO L124 PetriNetUnfolderBase]: 1153/2029 cut-off events.
[2024-11-24 00:35:35,937 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES.
[2024-11-24 00:35:35,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 2029 events. 1153/2029 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 14342 event pairs, 211 based on Foata normal form. 72/2029 useless extension candidates. Maximal degree in co-relation 3739. Up to 1303 conditions per place.
[2024-11-24 00:35:35,977 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 29 selfloop transitions, 2 changer transitions 2/55 dead transitions.
[2024-11-24 00:35:35,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 191 flow
[2024-11-24 00:35:35,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 00:35:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 00:35:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions.
[2024-11-24 00:35:36,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7755102040816326
[2024-11-24 00:35:36,003 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 114 transitions.
[2024-11-24 00:35:36,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 191 flow
[2024-11-24 00:35:36,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 186 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-11-24 00:35:36,022 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow
[2024-11-24 00:35:36,026 INFO L262 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-11-24 00:35:36,035 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places.
[2024-11-24 00:35:36,035 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow
[2024-11-24 00:35:36,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:35:36,036 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:35:36,036 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:35:36,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-24 00:35:36,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:35:36,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:35:36,039 INFO L85 PathProgramCache]: Analyzing trace with hash -447854663, now seen corresponding path program 1 times
[2024-11-24 00:35:36,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:35:36,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132545665]
[2024-11-24 00:35:36,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:35:36,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:35:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:35:36,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:35:36,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:35:36,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132545665]
[2024-11-24 00:35:36,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132545665] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:35:36,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:35:36,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 00:35:36,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693706230]
[2024-11-24 00:35:36,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:35:36,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 00:35:36,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:35:36,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 00:35:36,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 00:35:36,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49
[2024-11-24 00:35:36,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:35:36,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:35:36,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49
[2024-11-24 00:35:36,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:35:38,301 INFO L124 PetriNetUnfolderBase]: 4629/7359 cut-off events.
[2024-11-24 00:35:38,302 INFO L125 PetriNetUnfolderBase]: For 344/344 co-relation queries the response was YES.
[2024-11-24 00:35:38,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14271 conditions, 7359 events. 4629/7359 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 52921 event pairs, 663 based on Foata normal form. 240/7317 useless extension candidates. Maximal degree in co-relation 14261. Up to 3569 conditions per place.
[2024-11-24 00:35:38,374 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 46 selfloop transitions, 6 changer transitions 1/70 dead transitions.
[2024-11-24 00:35:38,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 268 flow
[2024-11-24 00:35:38,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 00:35:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 00:35:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions.
[2024-11-24 00:35:38,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7091836734693877
[2024-11-24 00:35:38,379 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 4 states and 139 transitions.
[2024-11-24 00:35:38,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 268 flow
[2024-11-24 00:35:38,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 00:35:38,384 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 134 flow
[2024-11-24 00:35:38,384 INFO L262 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=46}
[2024-11-24 00:35:38,385 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places.
[2024-11-24 00:35:38,385 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 134 flow
[2024-11-24 00:35:38,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:35:38,385 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:35:38,386 INFO L206 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-11-24 00:35:38,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-24 00:35:38,386 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:35:38,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:35:38,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1781214591, now seen corresponding path program 1 times
[2024-11-24 00:35:38,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:35:38,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28926618]
[2024-11-24 00:35:38,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:35:38,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:35:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:35:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:35:38,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:35:38,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28926618]
[2024-11-24 00:35:38,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28926618] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:35:38,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:35:38,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-24 00:35:38,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970381388]
[2024-11-24 00:35:38,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:35:38,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 00:35:38,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:35:38,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 00:35:38,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-24 00:35:38,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49
[2024-11-24 00:35:38,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:35:38,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:35:38,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49
[2024-11-24 00:35:38,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:35:40,034 INFO L124 PetriNetUnfolderBase]: 3853/6123 cut-off events.
[2024-11-24 00:35:40,035 INFO L125 PetriNetUnfolderBase]: For 1604/1604 co-relation queries the response was YES.
[2024-11-24 00:35:40,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13905 conditions, 6123 events. 3853/6123 cut-off events. For 1604/1604 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 42104 event pairs, 249 based on Foata normal form. 228/6137 useless extension candidates. Maximal degree in co-relation 13893. Up to 2561 conditions per place.
[2024-11-24 00:35:40,088 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 59 selfloop transitions, 10 changer transitions 1/87 dead transitions.
[2024-11-24 00:35:40,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 87 transitions, 385 flow
[2024-11-24 00:35:40,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-24 00:35:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-24 00:35:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 177 transitions.
[2024-11-24 00:35:40,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7224489795918367
[2024-11-24 00:35:40,091 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 134 flow. Second operand 5 states and 177 transitions.
[2024-11-24 00:35:40,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 87 transitions, 385 flow
[2024-11-24 00:35:40,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 374 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-24 00:35:40,097 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 186 flow
[2024-11-24 00:35:40,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=60, PETRI_TRANSITIONS=50}
[2024-11-24 00:35:40,098 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places.
[2024-11-24 00:35:40,098 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 186 flow
[2024-11-24 00:35:40,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:35:40,098 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:35:40,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:35:40,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-24 00:35:40,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:35:40,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:35:40,100 INFO L85 PathProgramCache]: Analyzing trace with hash -714166673, now seen corresponding path program 1 times
[2024-11-24 00:35:40,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:35:40,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288547703]
[2024-11-24 00:35:40,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:35:40,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:35:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:35:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:35:40,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:35:40,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288547703]
[2024-11-24 00:35:40,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288547703] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:35:40,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:35:40,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 00:35:40,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674499510]
[2024-11-24 00:35:40,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:35:40,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 00:35:40,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:35:40,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 00:35:40,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-24 00:35:40,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49
[2024-11-24 00:35:40,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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-11-24 00:35:40,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:35:40,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49
[2024-11-24 00:35:40,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:35:41,722 INFO L124 PetriNetUnfolderBase]: 2645/4123 cut-off events.
[2024-11-24 00:35:41,722 INFO L125 PetriNetUnfolderBase]: For 3362/3362 co-relation queries the response was YES.
[2024-11-24 00:35:41,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10685 conditions, 4123 events. 2645/4123 cut-off events. For 3362/3362 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 24984 event pairs, 115 based on Foata normal form. 172/4180 useless extension candidates. Maximal degree in co-relation 10671. Up to 1100 conditions per place.
[2024-11-24 00:35:41,767 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 70 selfloop transitions, 14 changer transitions 1/102 dead transitions.
[2024-11-24 00:35:41,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 508 flow
[2024-11-24 00:35:41,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 00:35:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 00:35:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions.
[2024-11-24 00:35:41,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7244897959183674
[2024-11-24 00:35:41,770 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 186 flow. Second operand 6 states and 213 transitions.
[2024-11-24 00:35:41,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 508 flow
[2024-11-24 00:35:41,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 102 transitions, 478 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-11-24 00:35:41,799 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 236 flow
[2024-11-24 00:35:41,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=63, PETRI_TRANSITIONS=54}
[2024-11-24 00:35:41,800 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places.
[2024-11-24 00:35:41,801 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 236 flow
[2024-11-24 00:35:41,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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-11-24 00:35:41,801 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:35:41,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:35:41,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-24 00:35:41,802 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:35:41,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:35:41,802 INFO L85 PathProgramCache]: Analyzing trace with hash -512799105, now seen corresponding path program 1 times
[2024-11-24 00:35:41,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:35:41,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848175539]
[2024-11-24 00:35:41,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:35:41,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:35:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:35:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:35:42,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:35:42,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848175539]
[2024-11-24 00:35:42,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848175539] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:35:42,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:35:42,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 00:35:42,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130778417]
[2024-11-24 00:35:42,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:35:42,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 00:35:42,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:35:42,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 00:35:42,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-24 00:35:42,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49
[2024-11-24 00:35:42,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 236 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-11-24 00:35:42,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:35:42,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49
[2024-11-24 00:35:42,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:35:43,121 INFO L124 PetriNetUnfolderBase]: 1793/2667 cut-off events.
[2024-11-24 00:35:43,122 INFO L125 PetriNetUnfolderBase]: For 3792/3792 co-relation queries the response was YES.
[2024-11-24 00:35:43,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7750 conditions, 2667 events. 1793/2667 cut-off events. For 3792/3792 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13976 event pairs, 77 based on Foata normal form. 80/2696 useless extension candidates. Maximal degree in co-relation 7735. Up to 828 conditions per place.
[2024-11-24 00:35:43,145 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 63 selfloop transitions, 18 changer transitions 1/99 dead transitions.
[2024-11-24 00:35:43,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 99 transitions, 506 flow
[2024-11-24 00:35:43,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 00:35:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 00:35:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 231 transitions.
[2024-11-24 00:35:43,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.673469387755102
[2024-11-24 00:35:43,147 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 236 flow. Second operand 7 states and 231 transitions.
[2024-11-24 00:35:43,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 99 transitions, 506 flow
[2024-11-24 00:35:43,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 460 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-11-24 00:35:43,172 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 246 flow
[2024-11-24 00:35:43,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=66, PETRI_TRANSITIONS=54}
[2024-11-24 00:35:43,173 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places.
[2024-11-24 00:35:43,173 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 246 flow
[2024-11-24 00:35:43,174 INFO L472 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-11-24 00:35:43,174 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:35:43,174 INFO L206 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-11-24 00:35:43,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-24 00:35:43,174 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:35:43,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:35:43,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1444904738, now seen corresponding path program 1 times
[2024-11-24 00:35:43,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:35:43,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596797746]
[2024-11-24 00:35:43,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:35:43,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:35:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:35:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:35:43,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:35:43,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596797746]
[2024-11-24 00:35:43,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596797746] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:35:43,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:35:43,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 00:35:43,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814503456]
[2024-11-24 00:35:43,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:35:43,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 00:35:43,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:35:43,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 00:35:43,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-24 00:35:43,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49
[2024-11-24 00:35:43,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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-11-24 00:35:43,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:35:43,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49
[2024-11-24 00:35:43,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:35:45,519 INFO L124 PetriNetUnfolderBase]: 5514/8801 cut-off events.
[2024-11-24 00:35:45,520 INFO L125 PetriNetUnfolderBase]: For 3638/3805 co-relation queries the response was YES.
[2024-11-24 00:35:45,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20354 conditions, 8801 events. 5514/8801 cut-off events. For 3638/3805 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 59732 event pairs, 535 based on Foata normal form. 16/8506 useless extension candidates. Maximal degree in co-relation 20338. Up to 3426 conditions per place.
[2024-11-24 00:35:45,600 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 67 selfloop transitions, 14 changer transitions 12/119 dead transitions.
[2024-11-24 00:35:45,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 119 transitions, 586 flow
[2024-11-24 00:35:45,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 00:35:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 00:35:45,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 220 transitions.
[2024-11-24 00:35:45,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.641399416909621
[2024-11-24 00:35:45,602 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 246 flow. Second operand 7 states and 220 transitions.
[2024-11-24 00:35:45,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 119 transitions, 586 flow
[2024-11-24 00:35:45,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 119 transitions, 480 flow, removed 22 selfloop flow, removed 10 redundant places.
[2024-11-24 00:35:45,669 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 258 flow
[2024-11-24 00:35:45,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=258, PETRI_PLACES=68, PETRI_TRANSITIONS=66}
[2024-11-24 00:35:45,670 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places.
[2024-11-24 00:35:45,672 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 258 flow
[2024-11-24 00:35:45,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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-11-24 00:35:45,672 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:35:45,672 INFO L206 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-11-24 00:35:45,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-24 00:35:45,673 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:35:45,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:35:45,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1475221774, now seen corresponding path program 2 times
[2024-11-24 00:35:45,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:35:45,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857023823]
[2024-11-24 00:35:45,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-24 00:35:45,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:35:45,795 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-24 00:35:45,795 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:35:46,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:35:46,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:35:46,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857023823]
[2024-11-24 00:35:46,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857023823] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:35:46,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:35:46,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-24 00:35:46,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062848616]
[2024-11-24 00:35:46,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:35:46,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 00:35:46,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:35:46,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 00:35:46,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-24 00:35:46,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49
[2024-11-24 00:35:46,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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-11-24 00:35:46,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:35:46,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49
[2024-11-24 00:35:46,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:35:48,778 INFO L124 PetriNetUnfolderBase]: 9916/15832 cut-off events.
[2024-11-24 00:35:48,778 INFO L125 PetriNetUnfolderBase]: For 5932/6178 co-relation queries the response was YES.
[2024-11-24 00:35:48,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38134 conditions, 15832 events. 9916/15832 cut-off events. For 5932/6178 co-relation queries the response was YES. Maximal size of possible extension queue 952. Compared 117977 event pairs, 1503 based on Foata normal form. 248/15250 useless extension candidates. Maximal degree in co-relation 38117. Up to 5989 conditions per place.
[2024-11-24 00:35:48,886 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 85 selfloop transitions, 26 changer transitions 17/155 dead transitions.
[2024-11-24 00:35:48,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 155 transitions, 820 flow
[2024-11-24 00:35:48,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-24 00:35:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-24 00:35:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 253 transitions.
[2024-11-24 00:35:48,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6454081632653061
[2024-11-24 00:35:48,888 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 258 flow. Second operand 8 states and 253 transitions.
[2024-11-24 00:35:48,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 155 transitions, 820 flow
[2024-11-24 00:35:48,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 155 transitions, 814 flow, removed 3 selfloop flow, removed 2 redundant places.
[2024-11-24 00:35:48,897 INFO L231 Difference]: Finished difference. Result has 77 places, 86 transitions, 489 flow
[2024-11-24 00:35:48,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=489, PETRI_PLACES=77, PETRI_TRANSITIONS=86}
[2024-11-24 00:35:48,898 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places.
[2024-11-24 00:35:48,898 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 86 transitions, 489 flow
[2024-11-24 00:35:48,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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-11-24 00:35:48,899 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:35:48,899 INFO L206 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-11-24 00:35:48,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-24 00:35:48,899 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:35:48,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:35:48,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1702899830, now seen corresponding path program 3 times
[2024-11-24 00:35:48,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:35:48,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420823170]
[2024-11-24 00:35:48,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-24 00:35:48,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:35:49,036 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-11-24 00:35:49,036 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:35:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:35:49,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:35:49,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420823170]
[2024-11-24 00:35:49,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420823170] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:35:49,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:35:49,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 00:35:49,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895887263]
[2024-11-24 00:35:49,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:35:49,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 00:35:49,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:35:49,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 00:35:49,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-24 00:35:49,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49
[2024-11-24 00:35:49,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 86 transitions, 489 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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-11-24 00:35:49,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:35:49,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49
[2024-11-24 00:35:49,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:35:52,153 INFO L124 PetriNetUnfolderBase]: 12386/20316 cut-off events.
[2024-11-24 00:35:52,153 INFO L125 PetriNetUnfolderBase]: For 20315/20600 co-relation queries the response was YES.
[2024-11-24 00:35:52,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53022 conditions, 20316 events. 12386/20316 cut-off events. For 20315/20600 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 162066 event pairs, 3413 based on Foata normal form. 295/19440 useless extension candidates. Maximal degree in co-relation 52999. Up to 8088 conditions per place.
[2024-11-24 00:35:52,301 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 32 selfloop transitions, 4 changer transitions 70/135 dead transitions.
[2024-11-24 00:35:52,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 135 transitions, 942 flow
[2024-11-24 00:35:52,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 00:35:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 00:35:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions.
[2024-11-24 00:35:52,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6122448979591837
[2024-11-24 00:35:52,305 INFO L175 Difference]: Start difference. First operand has 77 places, 86 transitions, 489 flow. Second operand 6 states and 180 transitions.
[2024-11-24 00:35:52,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 135 transitions, 942 flow
[2024-11-24 00:35:52,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 135 transitions, 936 flow, removed 3 selfloop flow, removed 2 redundant places.
[2024-11-24 00:35:52,372 INFO L231 Difference]: Finished difference. Result has 81 places, 59 transitions, 253 flow
[2024-11-24 00:35:52,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=253, PETRI_PLACES=81, PETRI_TRANSITIONS=59}
[2024-11-24 00:35:52,373 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places.
[2024-11-24 00:35:52,376 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 59 transitions, 253 flow
[2024-11-24 00:35:52,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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-11-24 00:35:52,377 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:35:52,377 INFO L206 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-11-24 00:35:52,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-24 00:35:52,378 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:35:52,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:35:52,378 INFO L85 PathProgramCache]: Analyzing trace with hash -537843860, now seen corresponding path program 4 times
[2024-11-24 00:35:52,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:35:52,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479018788]
[2024-11-24 00:35:52,378 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-24 00:35:52,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:35:52,431 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-24 00:35:52,432 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:35:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:35:52,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:35:52,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479018788]
[2024-11-24 00:35:52,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479018788] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:35:52,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:35:52,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 00:35:52,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784400551]
[2024-11-24 00:35:52,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:35:52,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 00:35:52,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:35:52,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 00:35:52,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-24 00:35:52,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49
[2024-11-24 00:35:52,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 59 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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-11-24 00:35:52,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:35:52,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49
[2024-11-24 00:35:52,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:35:53,873 INFO L124 PetriNetUnfolderBase]: 2496/4496 cut-off events.
[2024-11-24 00:35:53,873 INFO L125 PetriNetUnfolderBase]: For 1697/1772 co-relation queries the response was YES.
[2024-11-24 00:35:53,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9986 conditions, 4496 events. 2496/4496 cut-off events. For 1697/1772 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 30767 event pairs, 531 based on Foata normal form. 52/4225 useless extension candidates. Maximal degree in co-relation 9960. Up to 1547 conditions per place.
[2024-11-24 00:35:53,911 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 29 selfloop transitions, 1 changer transitions 34/94 dead transitions.
[2024-11-24 00:35:53,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 94 transitions, 461 flow
[2024-11-24 00:35:53,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 00:35:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 00:35:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions.
[2024-11-24 00:35:53,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6122448979591837
[2024-11-24 00:35:53,913 INFO L175 Difference]: Start difference. First operand has 81 places, 59 transitions, 253 flow. Second operand 7 states and 210 transitions.
[2024-11-24 00:35:53,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 94 transitions, 461 flow
[2024-11-24 00:35:53,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 94 transitions, 430 flow, removed 10 selfloop flow, removed 7 redundant places.
[2024-11-24 00:35:53,923 INFO L231 Difference]: Finished difference. Result has 80 places, 54 transitions, 202 flow
[2024-11-24 00:35:53,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=202, PETRI_PLACES=80, PETRI_TRANSITIONS=54}
[2024-11-24 00:35:53,925 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places.
[2024-11-24 00:35:53,926 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 54 transitions, 202 flow
[2024-11-24 00:35:53,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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-11-24 00:35:53,926 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:35:53,926 INFO L206 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-11-24 00:35:53,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-24 00:35:53,927 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:35:53,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:35:53,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1405063560, now seen corresponding path program 5 times
[2024-11-24 00:35:53,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:35:53,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110065149]
[2024-11-24 00:35:53,928 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-24 00:35:53,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:35:54,036 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-24 00:35:54,037 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:35:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:35:56,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:35:56,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110065149]
[2024-11-24 00:35:56,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110065149] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:35:56,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:35:56,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-24 00:35:56,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703758478]
[2024-11-24 00:35:56,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:35:56,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-24 00:35:56,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:35:56,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-24 00:35:56,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2024-11-24 00:35:56,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49
[2024-11-24 00:35:56,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 54 transitions, 202 flow. Second operand has 9 states, 9 states have (on average 21.555555555555557) internal successors, (194), 9 states have internal predecessors, (194), 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-11-24 00:35:56,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:35:56,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49
[2024-11-24 00:35:56,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:35:57,061 INFO L124 PetriNetUnfolderBase]: 1782/3204 cut-off events.
[2024-11-24 00:35:57,062 INFO L125 PetriNetUnfolderBase]: For 821/857 co-relation queries the response was YES.
[2024-11-24 00:35:57,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6996 conditions, 3204 events. 1782/3204 cut-off events. For 821/857 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 20555 event pairs, 488 based on Foata normal form. 16/2987 useless extension candidates. Maximal degree in co-relation 6973. Up to 1111 conditions per place.
[2024-11-24 00:35:57,087 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 31 selfloop transitions, 5 changer transitions 36/99 dead transitions.
[2024-11-24 00:35:57,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 99 transitions, 491 flow
[2024-11-24 00:35:57,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-24 00:35:57,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-24 00:35:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 244 transitions.
[2024-11-24 00:35:57,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5532879818594104
[2024-11-24 00:35:57,089 INFO L175 Difference]: Start difference. First operand has 80 places, 54 transitions, 202 flow. Second operand 9 states and 244 transitions.
[2024-11-24 00:35:57,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 99 transitions, 491 flow
[2024-11-24 00:35:57,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 99 transitions, 464 flow, removed 9 selfloop flow, removed 7 redundant places.
[2024-11-24 00:35:57,095 INFO L231 Difference]: Finished difference. Result has 80 places, 55 transitions, 216 flow
[2024-11-24 00:35:57,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=80, PETRI_TRANSITIONS=55}
[2024-11-24 00:35:57,096 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places.
[2024-11-24 00:35:57,096 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 55 transitions, 216 flow
[2024-11-24 00:35:57,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.555555555555557) internal successors, (194), 9 states have internal predecessors, (194), 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-11-24 00:35:57,097 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:35:57,097 INFO L206 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-11-24 00:35:57,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-24 00:35:57,098 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:35:57,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:35:57,098 INFO L85 PathProgramCache]: Analyzing trace with hash -371490634, now seen corresponding path program 6 times
[2024-11-24 00:35:57,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:35:57,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571238528]
[2024-11-24 00:35:57,099 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-24 00:35:57,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:35:57,185 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s)
[2024-11-24 00:35:57,185 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-24 00:35:57,185 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-24 00:35:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 00:35:57,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-24 00:35:57,304 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-11-24 00:35:57,306 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2024-11-24 00:35:57,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2024-11-24 00:35:57,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2024-11-24 00:35:57,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2024-11-24 00:35:57,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2024-11-24 00:35:57,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2024-11-24 00:35:57,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2024-11-24 00:35:57,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-24 00:35:57,309 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1]
[2024-11-24 00:35:57,447 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-24 00:35:57,447 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-24 00:35:57,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:35:57 BasicIcfg
[2024-11-24 00:35:57,464 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-24 00:35:57,465 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-24 00:35:57,465 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-24 00:35:57,466 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-24 00:35:57,467 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:35:33" (3/4) ...
[2024-11-24 00:35:57,468 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-24 00:35:57,642 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9.
[2024-11-24 00:35:57,704 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/bin/uautomizer-verify-LYvppIcaGC/witness.graphml
[2024-11-24 00:35:57,708 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/bin/uautomizer-verify-LYvppIcaGC/witness.yml
[2024-11-24 00:35:57,708 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-24 00:35:57,709 INFO L158 Benchmark]: Toolchain (without parser) took 26329.39ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 105.1MB in the beginning and 428.3MB in the end (delta: -323.2MB). Peak memory consumption was 649.2MB. Max. memory is 16.1GB.
[2024-11-24 00:35:57,709 INFO L158 Benchmark]: CDTParser took 2.04ms. Allocated memory is still 167.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 00:35:57,709 INFO L158 Benchmark]: CACSL2BoogieTranslator took 847.26ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 81.4MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-24 00:35:57,710 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.71ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 79.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 00:35:57,710 INFO L158 Benchmark]: Boogie Preprocessor took 92.80ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 76.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 00:35:57,710 INFO L158 Benchmark]: RCFGBuilder took 1135.80ms. Allocated memory is still 142.6MB. Free memory was 76.0MB in the beginning and 94.7MB in the end (delta: -18.7MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB.
[2024-11-24 00:35:57,714 INFO L158 Benchmark]: TraceAbstraction took 23931.24ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 93.6MB in the beginning and 449.3MB in the end (delta: -355.7MB). Peak memory consumption was 609.8MB. Max. memory is 16.1GB.
[2024-11-24 00:35:57,714 INFO L158 Benchmark]: Witness Printer took 242.42ms. Allocated memory is still 1.1GB. Free memory was 449.3MB in the beginning and 428.3MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-24 00:35:57,716 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 2.04ms. Allocated memory is still 167.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 847.26ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 81.4MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 69.71ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 79.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 92.80ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 76.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 1135.80ms. Allocated memory is still 142.6MB. Free memory was 76.0MB in the beginning and 94.7MB in the end (delta: -18.7MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB.
* TraceAbstraction took 23931.24ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 93.6MB in the beginning and 449.3MB in the end (delta: -355.7MB). Peak memory consumption was 609.8MB. Max. memory is 16.1GB.
* Witness Printer took 242.42ms. Allocated memory is still 1.1GB. Free memory was 449.3MB in the beginning and 428.3MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. 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_p0_EAX = 0;
[L714] 0 int __unbuffered_p1_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;
[L727] 0 _Bool y$flush_delayed;
[L728] 0 int y$mem_tmp;
[L729] 0 _Bool y$r_buff0_thd0;
[L730] 0 _Bool y$r_buff0_thd1;
[L731] 0 _Bool y$r_buff0_thd2;
[L732] 0 _Bool y$r_buff0_thd3;
[L733] 0 _Bool y$r_buff0_thd4;
[L734] 0 _Bool y$r_buff1_thd0;
[L735] 0 _Bool y$r_buff1_thd1;
[L736] 0 _Bool y$r_buff1_thd2;
[L737] 0 _Bool y$r_buff1_thd3;
[L738] 0 _Bool y$r_buff1_thd4;
[L739] 0 _Bool y$read_delayed;
[L740] 0 int *y$read_delayed_var;
[L741] 0 int y$w_buff0;
[L742] 0 _Bool y$w_buff0_used;
[L743] 0 int y$w_buff1;
[L744] 0 _Bool y$w_buff1_used;
[L746] 0 int z = 0;
[L747] 0 _Bool weak$$choice0;
[L748] 0 _Bool weak$$choice2;
[L856] 0 pthread_t t693;
[L857] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t693=-4, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L858] 0 pthread_t t694;
[L859] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t693=-4, t694=-3, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L860] 0 pthread_t t695;
[L861] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t693=-4, t694=-3, t695=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L862] 0 pthread_t t696;
[L863] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t693=-4, t694=-3, t695=-2, t696=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L795] 3 y$w_buff1 = y$w_buff0
[L796] 3 y$w_buff0 = 1
[L797] 3 y$w_buff1_used = y$w_buff0_used
[L798] 3 y$w_buff0_used = (_Bool)1
[L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18] COND FALSE 3 !(!expression)
[L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0
[L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1
[L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2
[L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3
[L804] 3 y$r_buff1_thd4 = y$r_buff0_thd4
[L805] 3 y$r_buff0_thd3 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L808] 3 z = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L825] 4 z = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2]
[L828] 4 __unbuffered_p3_EAX = z
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2]
[L831] 4 __unbuffered_p3_EBX = a
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2]
[L752] 1 a = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2]
[L755] 1 __unbuffered_p0_EAX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2]
[L834] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L835] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L836] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L837] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L838] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2]
[L767] 2 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2]
[L770] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L771] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L772] 2 y$flush_delayed = weak$$choice2
[L773] 2 y$mem_tmp = y
[L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L781] 2 __unbuffered_p1_EAX = y
[L782] 2 y = y$flush_delayed ? y$mem_tmp : y
[L783] 2 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2]
[L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2]
[L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2]
[L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2]
[L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2]
[L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2]
[L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693=-4, t694=-3, t695=-2, t696=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2]
[L867] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L867] RET 0 assume_abort_if_not(main$tmp_guard0)
[L869] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L870] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L871] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L872] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L873] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693=-4, t694=-3, t695=-2, t696=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2]
[L876] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693=-4, t694=-3, t695=-2, t696=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2]
[L878] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2]
[L18] 0 reach_error()
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2]
- UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 861]: 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: 859]: 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: 857]: 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: 863]: 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: 23.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 677 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 643 mSDsluCounter, 328 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1527 IncrementalHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 39 mSDtfsCounter, 1527 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=489occurred in iteration=7, InterpolantAutomatonStates: 62, 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.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 1884 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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, ConComCheckerStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-11-24 00:35:57,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa99710e-47ce-45e8-a588-1ad153c4fed4/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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