./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi010.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi010.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/bin/uautomizer-verify-qhAvR1uOyd --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 582aea72bf150e6792f444cf029a22a25cb033a365b198fc215f246088fb4d39 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:18:52,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:18:53,054 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:18:53,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:18:53,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:18:53,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:18:53,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:18:53,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:18:53,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:18:53,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:18:53,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:18:53,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:18:53,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:18:53,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:18:53,100 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:18:53,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:18:53,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:18:53,102 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:18:53,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:18:53,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:18:53,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:18:53,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:18:53,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:18:53,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:18:53,102 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:18:53,102 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:18:53,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:18:53,103 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:18:53,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:18:53,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:18:53,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:18:53,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:18:53,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:18:53,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:18:53,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:18:53,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:18:53,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:18:53,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:18:53,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:18:53,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:18:53,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:18:53,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:18:53,104 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_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/bin/uautomizer-verify-qhAvR1uOyd 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 -> 582aea72bf150e6792f444cf029a22a25cb033a365b198fc215f246088fb4d39 [2024-11-13 13:18:53,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:18:53,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:18:53,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:18:53,449 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:18:53,450 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:18:53,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/rfi010.i Unable to find full path for "g++" [2024-11-13 13:18:55,309 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:18:55,728 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:18:55,729 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/sv-benchmarks/c/pthread-wmm/rfi010.i [2024-11-13 13:18:55,742 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/bin/uautomizer-verify-qhAvR1uOyd/data/4281c97ed/1a47414a665f4e9988c315223f8f6e34/FLAG13090ec95 [2024-11-13 13:18:55,757 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/bin/uautomizer-verify-qhAvR1uOyd/data/4281c97ed/1a47414a665f4e9988c315223f8f6e34 [2024-11-13 13:18:55,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:18:55,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:18:55,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:18:55,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:18:55,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:18:55,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:18:55" (1/1) ... [2024-11-13 13:18:55,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7504b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:55, skipping insertion in model container [2024-11-13 13:18:55,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:18:55" (1/1) ... [2024-11-13 13:18:55,806 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:18:55,980 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_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/sv-benchmarks/c/pthread-wmm/rfi010.i[983,996] [2024-11-13 13:18:56,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:18:56,210 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:18:56,221 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_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/sv-benchmarks/c/pthread-wmm/rfi010.i[983,996] [2024-11-13 13:18:56,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:18:56,357 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:18:56,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:56 WrapperNode [2024-11-13 13:18:56,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:18:56,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:18:56,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:18:56,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:18:56,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:56" (1/1) ... [2024-11-13 13:18:56,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:56" (1/1) ... [2024-11-13 13:18:56,430 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-11-13 13:18:56,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:18:56,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:18:56,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:18:56,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:18:56,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:56" (1/1) ... [2024-11-13 13:18:56,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:56" (1/1) ... [2024-11-13 13:18:56,444 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:56" (1/1) ... [2024-11-13 13:18:56,471 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-13 13:18:56,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:56" (1/1) ... [2024-11-13 13:18:56,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:56" (1/1) ... [2024-11-13 13:18:56,486 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:56" (1/1) ... [2024-11-13 13:18:56,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:56" (1/1) ... [2024-11-13 13:18:56,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:56" (1/1) ... [2024-11-13 13:18:56,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:56" (1/1) ... [2024-11-13 13:18:56,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:18:56,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:18:56,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:18:56,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:18:56,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:56" (1/1) ... [2024-11-13 13:18:56,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:18:56,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:18:56,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:18:56,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:18:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 13:18:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:18:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 13:18:56,593 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 13:18:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 13:18:56,593 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 13:18:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:18:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 13:18:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:18:56,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:18:56,595 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 13:18:56,741 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:18:56,742 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:18:57,089 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 13:18:57,089 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:18:57,325 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:18:57,325 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 13:18:57,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:18:57 BoogieIcfgContainer [2024-11-13 13:18:57,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:18:57,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:18:57,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:18:57,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:18:57,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:18:55" (1/3) ... [2024-11-13 13:18:57,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b50b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:18:57, skipping insertion in model container [2024-11-13 13:18:57,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:56" (2/3) ... [2024-11-13 13:18:57,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b50b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:18:57, skipping insertion in model container [2024-11-13 13:18:57,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:18:57" (3/3) ... [2024-11-13 13:18:57,336 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010.i [2024-11-13 13:18:57,352 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:18:57,353 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi010.i that has 3 procedures, 32 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2024-11-13 13:18:57,354 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 13:18:57,423 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 13:18:57,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 72 flow [2024-11-13 13:18:57,502 INFO L124 PetriNetUnfolderBase]: 1/30 cut-off events. [2024-11-13 13:18:57,507 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 13:18:57,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 1/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2024-11-13 13:18:57,511 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 32 transitions, 72 flow [2024-11-13 13:18:57,515 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 30 transitions, 66 flow [2024-11-13 13:18:57,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:18:57,542 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;@52f5a6bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:18:57,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-13 13:18:57,550 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 13:18:57,550 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-13 13:18:57,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 13:18:57,551 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:18:57,551 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 13:18:57,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:18:57,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:18:57,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1663867071, now seen corresponding path program 1 times [2024-11-13 13:18:57,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:18:57,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127304450] [2024-11-13 13:18:57,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:57,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:18:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:58,270 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-13 13:18:58,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:18:58,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127304450] [2024-11-13 13:18:58,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127304450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:18:58,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:18:58,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 13:18:58,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904863036] [2024-11-13 13:18:58,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:18:58,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:18:58,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:18:58,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:18:58,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:18:58,316 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 32 [2024-11-13 13:18:58,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-13 13:18:58,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:18:58,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 32 [2024-11-13 13:18:58,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:18:58,572 INFO L124 PetriNetUnfolderBase]: 122/278 cut-off events. [2024-11-13 13:18:58,572 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 13:18:58,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 278 events. 122/278 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1492 event pairs, 14 based on Foata normal form. 15/285 useless extension candidates. Maximal degree in co-relation 499. Up to 181 conditions per place. [2024-11-13 13:18:58,577 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 18 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2024-11-13 13:18:58,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 120 flow [2024-11-13 13:18:58,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:18:58,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:18:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-11-13 13:18:58,592 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2024-11-13 13:18:58,594 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 66 flow. Second operand 3 states and 70 transitions. [2024-11-13 13:18:58,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 120 flow [2024-11-13 13:18:58,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 13:18:58,602 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 62 flow [2024-11-13 13:18:58,605 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2024-11-13 13:18:58,611 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2024-11-13 13:18:58,612 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 62 flow [2024-11-13 13:18:58,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-13 13:18:58,612 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:18:58,612 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:18:58,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:18:58,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:18:58,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:18:58,614 INFO L85 PathProgramCache]: Analyzing trace with hash -967801383, now seen corresponding path program 1 times [2024-11-13 13:18:58,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:18:58,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182187306] [2024-11-13 13:18:58,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:58,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:18:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:59,035 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-13 13:18:59,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:18:59,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182187306] [2024-11-13 13:18:59,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182187306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:18:59,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:18:59,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:18:59,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895488392] [2024-11-13 13:18:59,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:18:59,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:18:59,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:18:59,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:18:59,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:18:59,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-13 13:18:59,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-13 13:18:59,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:18:59,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-13 13:18:59,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:18:59,466 INFO L124 PetriNetUnfolderBase]: 252/524 cut-off events. [2024-11-13 13:18:59,466 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-13 13:18:59,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 524 events. 252/524 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3047 event pairs, 82 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 1004. Up to 278 conditions per place. [2024-11-13 13:18:59,470 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 22 selfloop transitions, 3 changer transitions 33/67 dead transitions. [2024-11-13 13:18:59,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 67 transitions, 272 flow [2024-11-13 13:18:59,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:18:59,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 13:18:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-11-13 13:18:59,473 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.578125 [2024-11-13 13:18:59,473 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 62 flow. Second operand 8 states and 148 transitions. [2024-11-13 13:18:59,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 67 transitions, 272 flow [2024-11-13 13:18:59,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 67 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 13:18:59,475 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 91 flow [2024-11-13 13:18:59,476 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=91, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2024-11-13 13:18:59,477 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2024-11-13 13:18:59,477 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 91 flow [2024-11-13 13:18:59,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-13 13:18:59,477 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:18:59,477 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:18:59,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:18:59,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:18:59,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:18:59,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1695546919, now seen corresponding path program 1 times [2024-11-13 13:18:59,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:18:59,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016897307] [2024-11-13 13:18:59,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:59,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:18:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:59,866 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-13 13:18:59,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:18:59,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016897307] [2024-11-13 13:18:59,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016897307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:18:59,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:18:59,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:18:59,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281680876] [2024-11-13 13:18:59,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:18:59,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:18:59,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:18:59,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:18:59,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:18:59,881 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2024-11-13 13:18:59,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-13 13:18:59,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:18:59,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2024-11-13 13:18:59,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:19:00,091 INFO L124 PetriNetUnfolderBase]: 177/382 cut-off events. [2024-11-13 13:19:00,091 INFO L125 PetriNetUnfolderBase]: For 320/320 co-relation queries the response was YES. [2024-11-13 13:19:00,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 382 events. 177/382 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1861 event pairs, 25 based on Foata normal form. 24/402 useless extension candidates. Maximal degree in co-relation 945. Up to 161 conditions per place. [2024-11-13 13:19:00,096 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 32 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2024-11-13 13:19:00,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 46 transitions, 227 flow [2024-11-13 13:19:00,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:19:00,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 13:19:00,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2024-11-13 13:19:00,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6640625 [2024-11-13 13:19:00,098 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 91 flow. Second operand 4 states and 85 transitions. [2024-11-13 13:19:00,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 46 transitions, 227 flow [2024-11-13 13:19:00,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 220 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-13 13:19:00,101 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 110 flow [2024-11-13 13:19:00,102 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2024-11-13 13:19:00,102 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2024-11-13 13:19:00,102 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 110 flow [2024-11-13 13:19:00,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-13 13:19:00,103 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:19:00,103 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:19:00,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:19:00,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:19:00,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:19:00,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1271617990, now seen corresponding path program 1 times [2024-11-13 13:19:00,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:19:00,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79010378] [2024-11-13 13:19:00,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:19:00,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:19:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:19:00,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:19:00,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:19:00,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79010378] [2024-11-13 13:19:00,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79010378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:19:00,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:19:00,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:19:00,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948405246] [2024-11-13 13:19:00,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:19:00,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:19:00,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:19:00,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:19:00,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:19:00,455 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-13 13:19:00,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 110 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-13 13:19:00,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:19:00,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-13 13:19:00,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:19:00,747 INFO L124 PetriNetUnfolderBase]: 153/332 cut-off events. [2024-11-13 13:19:00,747 INFO L125 PetriNetUnfolderBase]: For 206/208 co-relation queries the response was YES. [2024-11-13 13:19:00,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 332 events. 153/332 cut-off events. For 206/208 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1564 event pairs, 49 based on Foata normal form. 12/338 useless extension candidates. Maximal degree in co-relation 844. Up to 192 conditions per place. [2024-11-13 13:19:00,750 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 20 selfloop transitions, 3 changer transitions 17/51 dead transitions. [2024-11-13 13:19:00,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 254 flow [2024-11-13 13:19:00,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:19:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 13:19:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-11-13 13:19:00,754 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2024-11-13 13:19:00,754 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 110 flow. Second operand 7 states and 118 transitions. [2024-11-13 13:19:00,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 254 flow [2024-11-13 13:19:00,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 239 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-11-13 13:19:00,759 INFO L231 Difference]: Finished difference. Result has 49 places, 30 transitions, 120 flow [2024-11-13 13:19:00,760 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=120, PETRI_PLACES=49, PETRI_TRANSITIONS=30} [2024-11-13 13:19:00,761 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2024-11-13 13:19:00,761 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 30 transitions, 120 flow [2024-11-13 13:19:00,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-13 13:19:00,761 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:19:00,761 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:19:00,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:19:00,762 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:19:00,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:19:00,762 INFO L85 PathProgramCache]: Analyzing trace with hash -380278151, now seen corresponding path program 1 times [2024-11-13 13:19:00,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:19:00,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270150473] [2024-11-13 13:19:00,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:19:00,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:19:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:19:01,071 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-13 13:19:01,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:19:01,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270150473] [2024-11-13 13:19:01,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270150473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:19:01,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:19:01,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:19:01,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852894181] [2024-11-13 13:19:01,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:19:01,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:19:01,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:19:01,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:19:01,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:19:01,082 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2024-11-13 13:19:01,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 30 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-13 13:19:01,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:19:01,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2024-11-13 13:19:01,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:19:01,236 INFO L124 PetriNetUnfolderBase]: 93/204 cut-off events. [2024-11-13 13:19:01,237 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2024-11-13 13:19:01,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 204 events. 93/204 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 709 event pairs, 17 based on Foata normal form. 16/216 useless extension candidates. Maximal degree in co-relation 540. Up to 86 conditions per place. [2024-11-13 13:19:01,238 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 27 selfloop transitions, 6 changer transitions 1/43 dead transitions. [2024-11-13 13:19:01,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 230 flow [2024-11-13 13:19:01,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:19:01,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 13:19:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-11-13 13:19:01,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5875 [2024-11-13 13:19:01,240 INFO L175 Difference]: Start difference. First operand has 49 places, 30 transitions, 120 flow. Second operand 5 states and 94 transitions. [2024-11-13 13:19:01,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 230 flow [2024-11-13 13:19:01,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 190 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-11-13 13:19:01,245 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 112 flow [2024-11-13 13:19:01,245 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2024-11-13 13:19:01,246 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2024-11-13 13:19:01,247 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 112 flow [2024-11-13 13:19:01,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-13 13:19:01,247 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:19:01,247 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:19:01,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:19:01,248 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:19:01,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:19:01,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1337370074, now seen corresponding path program 1 times [2024-11-13 13:19:01,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:19:01,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498117474] [2024-11-13 13:19:01,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:19:01,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:19:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:19:01,733 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-13 13:19:01,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:19:01,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498117474] [2024-11-13 13:19:01,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498117474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:19:01,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:19:01,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:19:01,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655092960] [2024-11-13 13:19:01,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:19:01,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:19:01,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:19:01,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:19:01,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:19:01,747 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-11-13 13:19:01,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 112 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-13 13:19:01,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:19:01,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-11-13 13:19:01,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:19:02,024 INFO L124 PetriNetUnfolderBase]: 116/284 cut-off events. [2024-11-13 13:19:02,025 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-11-13 13:19:02,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 284 events. 116/284 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1129 event pairs, 29 based on Foata normal form. 4/279 useless extension candidates. Maximal degree in co-relation 651. Up to 127 conditions per place. [2024-11-13 13:19:02,027 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 25 selfloop transitions, 7 changer transitions 14/56 dead transitions. [2024-11-13 13:19:02,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 270 flow [2024-11-13 13:19:02,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:19:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 13:19:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-11-13 13:19:02,029 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2024-11-13 13:19:02,029 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 112 flow. Second operand 7 states and 116 transitions. [2024-11-13 13:19:02,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 56 transitions, 270 flow [2024-11-13 13:19:02,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 236 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-13 13:19:02,036 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 120 flow [2024-11-13 13:19:02,036 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=120, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2024-11-13 13:19:02,037 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2024-11-13 13:19:02,037 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 120 flow [2024-11-13 13:19:02,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-13 13:19:02,037 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:19:02,037 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:19:02,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:19:02,038 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:19:02,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:19:02,038 INFO L85 PathProgramCache]: Analyzing trace with hash -804665844, now seen corresponding path program 2 times [2024-11-13 13:19:02,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:19:02,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829339707] [2024-11-13 13:19:02,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:19:02,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:19:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:19:02,478 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-13 13:19:02,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:19:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829339707] [2024-11-13 13:19:02,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829339707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:19:02,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:19:02,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:19:02,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111700658] [2024-11-13 13:19:02,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:19:02,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:19:02,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:19:02,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:19:02,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:19:02,487 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-11-13 13:19:02,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 120 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-13 13:19:02,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:19:02,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-11-13 13:19:02,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:19:02,770 INFO L124 PetriNetUnfolderBase]: 121/309 cut-off events. [2024-11-13 13:19:02,770 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-11-13 13:19:02,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 309 events. 121/309 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1320 event pairs, 41 based on Foata normal form. 4/302 useless extension candidates. Maximal degree in co-relation 673. Up to 105 conditions per place. [2024-11-13 13:19:02,772 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 20 selfloop transitions, 1 changer transitions 19/50 dead transitions. [2024-11-13 13:19:02,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 242 flow [2024-11-13 13:19:02,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:19:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:19:02,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-11-13 13:19:02,773 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-11-13 13:19:02,773 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 120 flow. Second operand 6 states and 100 transitions. [2024-11-13 13:19:02,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 242 flow [2024-11-13 13:19:02,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 233 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-13 13:19:02,777 INFO L231 Difference]: Finished difference. Result has 49 places, 28 transitions, 95 flow [2024-11-13 13:19:02,777 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=95, PETRI_PLACES=49, PETRI_TRANSITIONS=28} [2024-11-13 13:19:02,778 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2024-11-13 13:19:02,778 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 28 transitions, 95 flow [2024-11-13 13:19:02,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-13 13:19:02,780 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:19:02,780 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:19:02,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:19:02,780 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:19:02,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:19:02,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2106172246, now seen corresponding path program 3 times [2024-11-13 13:19:02,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:19:02,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45446588] [2024-11-13 13:19:02,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:19:02,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:19:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:19:05,044 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-13 13:19:05,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:19:05,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45446588] [2024-11-13 13:19:05,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45446588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:19:05,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:19:05,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:19:05,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082064351] [2024-11-13 13:19:05,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:19:05,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:19:05,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:19:05,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:19:05,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:19:05,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2024-11-13 13:19:05,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 28 transitions, 95 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:05,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:19:05,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2024-11-13 13:19:05,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:19:05,566 INFO L124 PetriNetUnfolderBase]: 68/188 cut-off events. [2024-11-13 13:19:05,567 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-11-13 13:19:05,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 188 events. 68/188 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 652 event pairs, 8 based on Foata normal form. 4/186 useless extension candidates. Maximal degree in co-relation 405. Up to 34 conditions per place. [2024-11-13 13:19:05,568 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 17 selfloop transitions, 5 changer transitions 14/48 dead transitions. [2024-11-13 13:19:05,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 217 flow [2024-11-13 13:19:05,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:19:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 13:19:05,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions. [2024-11-13 13:19:05,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.490625 [2024-11-13 13:19:05,570 INFO L175 Difference]: Start difference. First operand has 49 places, 28 transitions, 95 flow. Second operand 10 states and 157 transitions. [2024-11-13 13:19:05,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 217 flow [2024-11-13 13:19:05,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 48 transitions, 190 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-11-13 13:19:05,572 INFO L231 Difference]: Finished difference. Result has 51 places, 28 transitions, 98 flow [2024-11-13 13:19:05,572 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=98, PETRI_PLACES=51, PETRI_TRANSITIONS=28} [2024-11-13 13:19:05,573 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2024-11-13 13:19:05,573 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 28 transitions, 98 flow [2024-11-13 13:19:05,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:05,574 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:19:05,574 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:19:05,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:19:05,574 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:19:05,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:19:05,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1087980846, now seen corresponding path program 4 times [2024-11-13 13:19:05,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:19:05,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462623684] [2024-11-13 13:19:05,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:19:05,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:19:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:19:05,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:19:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:19:05,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:19:05,793 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:19:05,794 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-13 13:19:05,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-13 13:19:05,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-13 13:19:05,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-13 13:19:05,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-13 13:19:05,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:19:05,797 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-13 13:19:05,880 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 13:19:05,881 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:19:05,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:19:05 BasicIcfg [2024-11-13 13:19:05,891 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:19:05,891 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:19:05,891 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:19:05,892 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:19:05,892 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:18:57" (3/4) ... [2024-11-13 13:19:05,893 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 13:19:05,974 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 13:19:05,974 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:19:05,975 INFO L158 Benchmark]: Toolchain (without parser) took 10213.80ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 91.6MB in the beginning and 79.6MB in the end (delta: 12.0MB). Peak memory consumption was 126.8MB. Max. memory is 16.1GB. [2024-11-13 13:19:05,977 INFO L158 Benchmark]: CDTParser took 1.03ms. Allocated memory is still 83.9MB. Free memory was 41.6MB in the beginning and 41.5MB in the end (delta: 103.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:19:05,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.78ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 67.6MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 13:19:05,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.68ms. Allocated memory is still 117.4MB. Free memory was 67.6MB in the beginning and 65.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:19:05,978 INFO L158 Benchmark]: Boogie Preprocessor took 75.46ms. Allocated memory is still 117.4MB. Free memory was 65.3MB in the beginning and 62.0MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:19:05,981 INFO L158 Benchmark]: RCFGBuilder took 818.56ms. Allocated memory is still 117.4MB. Free memory was 62.0MB in the beginning and 65.9MB in the end (delta: -3.9MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-13 13:19:05,981 INFO L158 Benchmark]: TraceAbstraction took 8562.35ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 65.2MB in the beginning and 88.0MB in the end (delta: -22.8MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. [2024-11-13 13:19:05,982 INFO L158 Benchmark]: Witness Printer took 83.10ms. Allocated memory is still 234.9MB. Free memory was 88.0MB in the beginning and 79.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:19:05,983 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.03ms. Allocated memory is still 83.9MB. Free memory was 41.6MB in the beginning and 41.5MB in the end (delta: 103.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 596.78ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 67.6MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.68ms. Allocated memory is still 117.4MB. Free memory was 67.6MB in the beginning and 65.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 75.46ms. Allocated memory is still 117.4MB. Free memory was 65.3MB in the beginning and 62.0MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 818.56ms. Allocated memory is still 117.4MB. Free memory was 62.0MB in the beginning and 65.9MB in the end (delta: -3.9MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8562.35ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 65.2MB in the beginning and 88.0MB in the end (delta: -22.8MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. * Witness Printer took 83.10ms. Allocated memory is still 234.9MB. Free memory was 88.0MB in the beginning and 79.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1761; [L824] FCALL, FORK 0 pthread_create(&t1761, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1761=-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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L825] 0 pthread_t t1762; [L826] FCALL, FORK 0 pthread_create(&t1762, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1761=-1, t1762=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L771] 2 y$w_buff1 = y$w_buff0 [L772] 2 y$w_buff0 = 1 [L773] 2 y$w_buff1_used = y$w_buff0_used [L774] 2 y$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L776] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 y$flush_delayed = weak$$choice2 [L785] 2 y$mem_tmp = y [L786] 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) [L787] 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)) [L788] 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)) [L789] 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)) [L790] 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)) [L791] 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)) [L792] 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)) [L793] 2 __unbuffered_p1_EAX = y [L794] 2 y = y$flush_delayed ? y$mem_tmp : y [L795] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L798] 2 __unbuffered_p1_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L741] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 y$flush_delayed = weak$$choice2 [L749] 1 y$mem_tmp = y [L750] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L751] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L752] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L753] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L754] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L756] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = y [L758] 1 y = y$flush_delayed ? y$mem_tmp : y [L759] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761=-1, t1762=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 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) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 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 [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761=-1, t1762=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761=-1, t1762=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 locations, 5 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: 8.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 257 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 239 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 761 IncrementalHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 14 mSDtfsCounter, 761 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=4, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-13 13:19:06,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdfc7daf-cfa7-491a-a67c-beeaafb9d667/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE